A fast hybrid short read fragment assembly algorithm
Open accessThe DOI matches its Crossref record.
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.sg
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Assembly algorithms for next-generation sequencing data
Miller, J. R., Koren, S., & Sutton, G. (2010) · Genomics · doi:10.1016/j.ygeno.2010.03.001 · Cited by 1,154
RNA-seq: from technology to biology
Marguerat, S., & Bähler, J. (2010) · Cellular and Molecular Life Sciences · doi:10.1007/s00018-009-0180-6 · Cited by 531
GapFiller: a de novo assembly approach to fill the gap within paired reads
Nadalin, F., Vezzi, F., & Policriti, A. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-s14-s8 · Cited by 352
Effects of GC Bias in Next-Generation-Sequencing Data on De Novo Genome Assembly
Chen, Y.-C., Liu, T., Yu, C.-H., Chiang, T.-Y., & Hwang, C.-C. (2013) · PLoS ONE · doi:10.1371/journal.pone.0062856 · Cited by 285
“In this study, we applied seven NGS assemblers: ALLPATHS-LG [24,25], ABySS [26], Edena [27], SOAPdenovo [28], SSAKE [29], Velvet [30,31] and Velvet-SC [14].”
MethodZhang, W., Chen, J., Yang, Y., Tang, Y., Shang, J., & Shen, B. (2011) · PLoS ONE · doi:10.1371/journal.pone.0017915 · Cited by 250
“At last, Taipan was proposed as the hybrid of string-based and graph-based approaches [17], with the dominative feature - the exceedingly short runtime.”
Background
Metadata
- Authors
- Schmidt, B., Sinha, R., Beresford-Smith, B., & Puglisi, S. J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2009-06-17
- Volume
- 25
- Issue
- 17
- Pages
- 2279-2280
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2118335502
- Cited by
- 53
- References
- 0
- FWCI
- 2.16
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A fast hybrid short read fragment assembly algorithm. https://app.cochat.ai/papers/10.1093/bioinformatics/btp374
- The paper
- Schmidt, B., Sinha, R., Beresford-Smith, B., & Puglisi, S. J. (2009). A fast hybrid short read fragment assembly algorithm. Bioinformatics. https://doi.org/10.1093/bioinformatics/btp374
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.