使用谱保持串集表示 -Mer 集。
Representation of -Mer Sets Using Spectrum-Preserving String Sets.
机构信息
Department of Computer Science and Engineering, Penn State, University Park, State College, PA, USA.
Department of Biochemistry and Molecular Biology, Penn State, University Park, State College, PA, USA.
出版信息
J Comput Biol. 2021 Apr;28(4):381-394. doi: 10.1089/cmb.2020.0431. Epub 2020 Dec 7.
Abstract
.
摘要
.
相似文献
1
Representation of -Mer Sets Using Spectrum-Preserving String Sets.使用谱保持串集表示 -Mer 集。
J Comput Biol. 2021 Apr;28(4):381-394. doi: 10.1089/cmb.2020.0431. Epub 2020 Dec 7.
2
Enhanced Compression of -Mer Sets with Counters via de Bruijn Graphs.通过 de Bruijn 图对 -Mer 集进行增强型压缩与计数器。
J Comput Biol. 2024 Jun;31(6):524-538. doi: 10.1089/cmb.2024.0530. Epub 2024 May 31.
3
Disk compression of k-mer sets.k-mer集的磁盘压缩
Algorithms Mol Biol. 2021 Jun 21;16(1):10. doi: 10.1186/s13015-021-00192-7.
4
Compression Algorithm for Colored de Bruijn Graphs.彩色德布鲁因图的压缩算法
Lebniz Int Proc Inform. 2023 Sep;273. doi: 10.4230/LIPIcs.WABI.2023.17. Epub 2023 Aug 29.
5
Fulgor: A fast and compact -mer index for large-scale matching and color queries.富尔戈尔：一种用于大规模匹配和颜色查询的快速紧凑的k-mer索引。
bioRxiv. 2023 May 20:2023.05.09.539895. doi: 10.1101/2023.05.09.539895.
6
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time.欧拉蒂格斯：在线性时间内无重复的k-mer集的最小明文表示。
Algorithms Mol Biol. 2023 Jul 4;18(1):5. doi: 10.1186/s13015-023-00227-1.
7
Simplitigs as an efficient and scalable representation of de Bruijn graphs.Simplitigs 作为一种高效且可扩展的 de Bruijn 图表示方法。
Genome Biol. 2021 Apr 6;22(1):96. doi: 10.1186/s13059-021-02297-z.
8
Squeakr: an exact and approximate k-mer counting system.Squeakr：一种精确和近似的 k-mer 计数系统。
Bioinformatics. 2018 Feb 15;34(4):568-575. doi: 10.1093/bioinformatics/btx636.
9
Fulgor: a fast and compact k-mer index for large-scale matching and color queries.Fulgor：一种用于大规模匹配和颜色查询的快速紧凑的k-mer索引。
Algorithms Mol Biol. 2024 Jan 22;19(1):3. doi: 10.1186/s13015-024-00251-9.
10
A space and time-efficient index for the compacted colored de Bruijn graph.一种用于压缩彩色 de Bruijn 图的空间和时间高效索引。
Bioinformatics. 2018 Jul 1;34(13):i169-i177. doi: 10.1093/bioinformatics/bty292.
引用本文的文献
1
Efficient and robust search of microbial genomes via phylogenetic compression.通过系统发育压缩对微生物基因组进行高效且稳健的搜索。
Nat Methods. 2025 Apr;22(4):692-697. doi: 10.1038/s41592-025-02625-2. Epub 2025 Apr 9.
2
Fractional hitting sets for efficient multiset sketching.用于高效多重集草图绘制的分数击中集
Algorithms Mol Biol. 2025 Feb 8;20(1):1. doi: 10.1186/s13015-024-00268-0.
3
Compression algorithm for colored de Bruijn graphs.彩色德布鲁因图的压缩算法。
Algorithms Mol Biol. 2024 May 26;19(1):20. doi: 10.1186/s13015-024-00254-6.
4
Theoretical Analysis of Sequencing Bioinformatics Algorithms and Beyond.测序生物信息学算法及其他方面的理论分析
Commun ACM. 2023 Jul;66(7):118-125. doi: 10.1145/3571723. Epub 2023 Jun 22.
5
Compression Algorithm for Colored de Bruijn Graphs.彩色德布鲁因图的压缩算法
Lebniz Int Proc Inform. 2023 Sep;273. doi: 10.4230/LIPIcs.WABI.2023.17. Epub 2023 Aug 29.
6
Space-efficient computation of k-mer dictionaries for large values of k.针对大k值的k-mer字典进行节省空间的计算。
Algorithms Mol Biol. 2024 Apr 5;19(1):14. doi: 10.1186/s13015-024-00259-1.
7
Eulertigs: minimum plain text representation of k-mer sets without repetitions in linear time.欧拉蒂格斯：在线性时间内无重复的k-mer集的最小明文表示。
Algorithms Mol Biol. 2023 Jul 4;18(1):5. doi: 10.1186/s13015-023-00227-1.
8
Locality-preserving minimal perfect hashing of k-mers.保局最小完美哈希的 k- -mer。
Bioinformatics. 2023 Jun 30;39(Suppl 1):i534-i543. doi: 10.1093/bioinformatics/btad219.
9
On weighted k-mer dictionaries.关于加权k-元字典。
Algorithms Mol Biol. 2023 Jun 17;18(1):3. doi: 10.1186/s13015-023-00226-2.
10
Matchtigs: minimum plain text representation of k-mer sets.匹配项：k-mer 集的最小纯文本表示。
Genome Biol. 2023 Jun 9;24(1):136. doi: 10.1186/s13059-023-02968-z.
本文引用的文献
1
Simplitigs as an efficient and scalable representation of de Bruijn graphs.Simplitigs 作为一种高效且可扩展的 de Bruijn 图表示方法。
Genome Biol. 2021 Apr 6;22(1):96. doi: 10.1186/s13059-021-02297-z.
2
Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs.Bifrost：彩色紧凑布隆图的高度并行构建和索引
Genome Biol. 2020 Sep 17;21(1):249. doi: 10.1186/s13059-020-02135-8.
3
De Novo Clustering of Long-Read Transcriptome Data Using a Greedy, Quality Value-Based Algorithm.使用基于质量值的贪婪算法对长读长转录组数据进行从头聚类
J Comput Biol. 2020 Apr;27(4):472-484. doi: 10.1089/cmb.2019.0299. Epub 2020 Mar 16.
4
When the levee breaks: a practical guide to sketching algorithms for processing the flood of genomic data.决堤之时：算法速写实用指南，助你应对基因组洪流。
Genome Biol. 2019 Sep 13;20(1):199. doi: 10.1186/s13059-019-1809-x.
5
Improved representation of sequence bloom trees.序列 Bloom 树的表示方法改进。
Bioinformatics. 2020 Feb 1;36(3):721-727. doi: 10.1093/bioinformatics/btz662.
6
DiscoverY: a classifier for identifying Y chromosome sequences in male assemblies.DiscoverY：一种用于鉴定男性基因组中 Y 染色体序列的分类器。
BMC Genomics. 2019 Aug 9;20(1):641. doi: 10.1186/s12864-019-5996-3.
7
deGSM: Memory Scalable Construction Of Large Scale de Bruijn Graph.deGSM：大规模 de Bruijn 图的可扩展存储构建。
IEEE/ACM Trans Comput Biol Bioinform. 2021 Nov-Dec;18(6):2157-2166. doi: 10.1109/TCBB.2019.2913932. Epub 2021 Dec 8.
8
Assembly of long, error-prone reads using repeat graphs.使用重复图组装长的、易错的读取。
Nat Biotechnol. 2019 May;37(5):540-546. doi: 10.1038/s41587-019-0072-8. Epub 2019 Apr 1.
9
Ultrafast search of all deposited bacterial and viral genomic data.快速搜索所有已存入的细菌和病毒基因组数据。
Nat Biotechnol. 2019 Feb;37(2):152-159. doi: 10.1038/s41587-018-0010-1. Epub 2019 Feb 4.
10
Fast de Bruijn Graph Compaction in Distributed Memory Environments.快速有向无环图压缩在分布式内存环境中。
IEEE/ACM Trans Comput Biol Bioinform. 2020 Jan-Feb;17(1):136-148. doi: 10.1109/TCBB.2018.2858797. Epub 2018 Jul 31.
Zotero 插件