arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1108.3556cs.DSq-bio.GN
收藏

SparseAssembler2:稀疏k-mer图在高效记忆基因组组装中的应用

SparseAssembler2: Sparse k-mer Graph for Memory Efficient Genome Assembly

Chengxi Ye, Charles H. Cannon, Zhanshan Sam Ma, Douglas W. Yu, Mihai Pop

摘要:

我们工作的正式版本已经发表在BMC Bioinformatics上,可以在这里找到:http://www.biomedcentral.com/1471-2105/13/S6/S1动机:为了解决与de Bruijn基于图的算法相关的巨大内存使用问题,我们发布了SparseAssembler 1。与最先进的汇编器相比,SparseAssembler 1可以节省多达90%的内存消耗,但它需要多轮去噪才能准确地组装基因组。在本文中,我们介绍了一个新的通用模型,只使用稀疏的k-mer的基因组组装。新模型从一开始就取代了de Bruijn图的思想,并且与我们以前的SparseAssembler 1相比,实现了类似的内存效率和更好的鲁棒性。结果如下:我们证明,所有重叠的k-mer,这是在现有的de Bruijn图基因组组装器中使用的读取的分解,是过于谨慎。我们引入了一个稀疏的k-mer图结构保存稀疏的k-mer,这大大降低了从头基因组组装所需的内存空间要求。与de Bruijn图方法相比,我们设计了一个简单但强大的策略,即,找到基因组中k-mer之间的连接,并沿着连接进行遍历,这可以通过仅保存几个k-mer来完成。为了实现该策略,我们只需要选择一些甚至可能不是重叠的k-mer,并在这些k-mer之间建立由read指示的链接。我们可以遍历这个稀疏的k-mer图来构建重叠群,并最终完成基因组组装。由于新的稀疏k-mers图几乎拥有de Bruijn图的所有优点,因此我们能够采用Dijkstra式的广度优先搜索算法来规避测序错误并解决多态性。

英文摘要:

The formal version of our work has been published in BMC Bioinformatics and can be found here: http://www.biomedcentral.com/1471-2105/13/S6/S1 Motivation: To tackle the problem of huge memory usage associated with de Bruijn graph-based algorithms, upon which some of the most widely used de novo genome assemblers have been built, we released SparseAssembler1. SparseAssembler1 can save as much as 90% memory consumption in comparison with the state-of-art assemblers, but it requires rounds of denoising to accurately assemble genomes. In this paper, we introduce a new general model for genome assembly that uses only sparse k-mers. The new model replaces the idea of the de Bruijn graph from the beginning, and achieves similar memory efficiency and much better robustness compared with our previous SparseAssembler1. Results: We demonstrate that the decomposition of reads of all overlapping k-mers, which is used in existing de Bruijn graph genome assemblers, is overly cautious. We introduce a sparse k-mer graph structure for saving sparse k-mers, which greatly reduces memory space requirements necessary for de novo genome assembly. In contrast with the de Bruijn graph approach, we devise a simple but powerful strategy, i.e., finding links between the k-mers in the genome and traversing following the links, which can be done by saving only a few k-mers. To implement the strategy, we need to only select some k-mers that may not even be overlapping ones, and build the links between these k-mers indicated by the reads. We can traverse through this sparse k-mer graph to build the contigs, and ultimately complete the genome assembly. Since the new sparse k-mers graph shares almost all advantages of de Bruijn graph, we are able to adapt a Dijkstra-like breadth-first search algorithm to circumvent sequencing errors and resolve polymorphisms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑