PE-Assembler: de novo assembler using short paired-end reads. 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. Availability: The software package can be found at http://www.comp.nus.edu.sg/ bioinfo/peasm/. Alternatively it is available from authors upon request
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Jean, Géraldine; Radulescu, Andreea; Rusu, Irena: The contig assembly problem and its algorithmic solutions (2017)
- Ariyaratne, Pramila Nuwantha; Sung, Wing-Kin: PE-assembler: \textitdenovo assembler using short paired-end reads (2011) ioport