Journal
BIOINFORMATICS
Volume 27, Issue 2, Pages 167-174Publisher
OXFORD UNIV PRESS
DOI: 10.1093/bioinformatics/btq626
Keywords
-
Categories
Funding
- MOE AcRF Tier 2 [R-252-000-444-112]
- Agency for Science, Technology and Research (A*STAR)
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available