General Information
| Description | De novo assembler using short paired-end reads |
| Homepage | http://www.comp.nus.edu.sg/~bioinfo/peasm/ |
Publications
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.
Contact:
ksung@comp.nus.edu.sg; sungk@gis.a-star.edu.sg
Supplementary information:
Supplementary data are available at Bioinformatics online.
Related Tools
IDBA-tran
Published June 2013
A more robust de novo de Bruijn graph assembler for transcriptomes with uneven expression levels
EBARDenovo
Published March 2013
Highly accurate de novo assembly of RNA-Seq with efficient chimera-detection
deBGR
Published July 2017
An efficient and near-exact representation of the weighted de Bruijn graph
FAIR Evaluation
Sorry, you must be signed in to evaluate this object.
