期刊
BMC BIOINFORMATICS
卷 13, 期 -, 页码 -出版社
BMC
DOI: 10.1186/1471-2105-13-S6-S1
关键词
-
类别
资金
- Direct For Computer & Info Scie & Enginr
- Div Of Information & Intelligent Systems [0812111] Funding Source: National Science Foundation
Background: The very large memory requirements for the construction of assembly graphs for de novo genome assembly limit current algorithms to super-computing environments. Methods: In this paper, we demonstrate that constructing a sparse assembly graph which stores only a small fraction of the observed k-mers as nodes and the links between these nodes allows the de novo assembly of even moderately-sized genomes (similar to 500 M) on a typical laptop computer. Results: We implement this sparse graph concept in a proof-of-principle software package, SparseAssembler, utilizing a new sparse k-mer graph structure evolved from the de Bruijn graph. We test our SparseAssembler with both simulated and real data, achieving similar to 90% memory savings and retaining high assembly accuracy, without sacrificing speed in comparison to existing de novo assemblers.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据