期刊
BIOINFORMATICS
卷 27, 期 2, 页码 167-174出版社
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btq626
关键词
-
类别
资金
- MOE AcRF Tier 2 [R-252-000-444-112]
- Agency for Science, Technology and Research (A*STAR)
Motivation: Many de novo genome assemblers have been proposed recently. The basis for most existing methods relies on the de bruijn graph: a complex graph structure that attempts to encompass the entire genome. Such graphs can be prohibitively large, may fail to capture subtle information and is difficult to be parallelized. Result: We present a method that eschews the traditional graph-based approach in favor of a simple 3' extension approach that has potential to be massively parallelized. Our results show that it is able to obtain assemblies that are more contiguous, complete and less error prone compared with existing methods.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据