A fast hybrid short read fragment assembly algorithm
Authors:
Open Access
- 17 June 2009
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (17) , 2279-2280
Abstract
Summary: The shorter and vastly more numerous reads produced by second-generation sequencing technologies require new tools that can assemble massive numbers of reads in reasonable time. Existing short-read assembly tools can be classified into two categories: greedy extension-based and graph-based. While the graph-based approaches are generally superior in terms of assembly quality, the computer resources required for building and storing a huge graph are very high. In this article, we present Taipan, an assembly algorithm which can be viewed as a hybrid of these two approaches. Taipan uses greedy extensions for contig construction but at each step realizes enough of the corresponding read graph to make better decisions as to how assembly should continue. We show that this approach can achieve an assembly quality at least as good as the graph-based approaches used in the popular Edena and Velvet assembly tools using a moderate amount of computing resources. Availability and Implementation: Source code in C running on Linux is freely available at http://taipan.sourceforge.net Contact:asbschmidt@ntu.edu.sgKeywords
This publication has 9 references indexed in Scilit:
- Velvet: Algorithms for de novo short read assembly using de Bruijn graphsGenome Research, 2008
- De novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computerGenome Research, 2008
- Bioinformatics challenges of new sequencing technologyTrends in Genetics, 2008
- The impact of next-generation sequencing technology on geneticsTrends in Genetics, 2008
- Short read fragment assembly of bacterial genomesGenome Research, 2007
- SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencingGenome Research, 2007
- Extending assembly of short DNA sequences to handle errorBioinformatics, 2007
- Assembling millions of short DNA sequences using SSAKEBioinformatics, 2006
- Automated generation of heuristics for biological sequence comparisonBMC Bioinformatics, 2005