Please use this identifier to cite or link to this item:
|Title:||PE-Assembler: De novo assembler using short paired-end reads||Authors:||Ariyaratne, P.N.
|Issue Date:||2011||Citation:||Ariyaratne, P.N., Sung, W.-K. (2011). PE-Assembler: De novo assembler using short paired-end reads. Bioinformatics 27 (2) : 167-174. ScholarBank@NUS Repository. https://doi.org/10.1093/bioinformatics/btq626||Abstract:||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 graphbased 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. © The Author 2010. Published by Oxford University Press. All rights reserved.||Source Title:||Bioinformatics||URI:||http://scholarbank.nus.edu.sg/handle/10635/39687||ISSN:||13674803||DOI:||10.1093/bioinformatics/btq626|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.