The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient construction of an assembly string graph using the FM-index
Open accessAbstract
Motivation: Sequence assembly is a difficult problem whose importance has grown again recently as the cost of sequencing has dramatically dropped. Most new sequence assembly software has started by building a de Bruijn graph, avoiding the overlap-based methods used previously because of the computational cost and complexity of these with very large numbers of short reads. Here, we show how to use suffix array-based methods that have formed the basis of recent very fast sequence mapping algorithms to find overlaps and generate assembly string graphs asymptotically faster than previously described algorithms. Results: Standard overlap assembly methods have time complexity O(N2), where N is the sum of the lengths of the reads. We use the Ferragina–Manzini index (FM-index) derived from the Burrows–Wheeler transform to find overlaps of length at least τ among a set of reads. As well as an approach that finds all overlaps then implements transitive reduction to produce a string graph, we show how to output directly only the irreducible overlaps, significantly shrinking memory requirements and reducing compute time to O(N), independent of depth. Overlap-based assembly methods naturally handle mixed length read sets, including capillary reads or long reads promised by the third generation sequencing technologies. The algorithms we present here pave the way for overlap-based assembly approaches to be developed that scale to whole vertebrate genome de novo assembly. Contact: js18@sanger.ac.uk
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cites
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424
Cited by
An integrated map of genetic variation from 1,092 human genomes
The 1000 Genomes Project Consortium (2012) · Nature · doi:10.1038/nature11632 · Cited by 7,711
Efficient de novo assembly of large genomes using compressed data structures
Simpson, J. T., & Durbin, R. (2012) · Genome Research · doi:10.1101/gr.126953.111 · Cited by 768
Self-citationAnalysis of RNA-Seq Data Using TopHat and Cufflinks
Ghosh, S., & Chan, C.-K. K. (2016) · Methods in Molecular Biology · doi:10.1007/978-1-4939-3167-5_18 · Cited by 593
Assemblathon 1: A competitive assessment of de novo short read assembly methods
Earl, D., Bradnam, K., St. John, J., Darling, A., Lin, D., Fass, J., Yu, H. O. K., Buffalo, V., Zerbino, D. R., Diekhans, M., et al. (2011) · Genome Research · doi:10.1101/gr.126599.111 · Cited by 507
Self-citationAn Integrated Pipeline for de Novo Assembly of Microbial Genomes
Tritt, A., Eisen, J. A., Facciotti, M. T., & Darling, A. E. (2012) · PLoS ONE · doi:10.1371/journal.pone.0042304 · Cited by 437
Metadata
- Authors
- Simpson, J. T., & Durbin, R.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2010-06-01
- Volume
- 26
- Issue
- 12
- Pages
- i367-i373
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2161048357
- Cited by
- 254
- References
- 1
- FWCI
- 21.77
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Efficient construction of an assembly string graph using the FM-index. https://app.cochat.ai/papers/10.1093/bioinformatics/btq217
- The paper
- Simpson, J. T., & Durbin, R. (2010). Efficient construction of an assembly string graph using the FM-index. Bioinformatics. https://doi.org/10.1093/bioinformatics/btq217
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.