The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph
Open accessAbstract
Since the completion of the cucumber and panda genome projects using Illumina sequencing in 2009, the global scientific community has had to pay much more attention to this new cost-effective approach to generate the draft sequence of large genomes. To allow new users to more easily understand the assembly algorithms and the optimum software packages for their projects, we make a detailed comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph, from how they match the Lander-Waterman model, to the required sequencing depth and reads length. We also discuss the computational efficiency of each class of algorithm, the influence of repeats and heterozygosity and points of note in the subsequent scaffold linkage and gap closure steps. We hope this review can help further promote the application of second-generation de novo sequencing, as well as aid the future development of assembly algorithms.
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
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Zerbino, D. R., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.074492.107 · Cited by 9,491
Genome sequencing in microfabricated high-density picolitre reactors
Margulies, M., Egholm, M., Altman, W. E., Attiya, S., Bader, J. S., Bemben, L. A., Berka, J., Braverman, M. S., Chen, Y.-J., Chen, Z., et al. (2005) · Nature · doi:10.1038/nature03959 · Cited by 7,693
Self-citationSequencing technologies – the next generation
Metzker, M. L. (2010) · Nature Reviews Genetics · doi:10.1038/nrg2626 · Cited by 7,066
CAP3: A DNA Sequence Assembly Program
Huang, X., & Madan, A. (1999) · Genome Research · doi:10.1101/gr.9.9.868 · Cited by 5,261
A fast, lock-free approach for efficient parallel counting of occurrences of k -mers
Marçais, G., & Kingsford, C. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btr011 · Cited by 4,661
Accurate whole human genome sequencing using reversible terminator chemistry
Bentley, D. R., Balasubramanian, S., Swerdlow, H. P., Smith, G. P., Milton, J., Brown, C. G., Hall, K. P., Evers, D. J., Barnes, C. L., Bignell, H. R., et al. (2008) · Nature · doi:10.1038/nature07517 · Cited by 3,684
ABySS: A parallel assembler for short read sequence data
Simpson, J. T., Wong, K., Jackman, S. D., Schein, J. E., Jones, S. J. M., & Birol, İ. (2009) · Genome Research · doi:10.1101/gr.089532.108 · Cited by 3,608
De novo assembly of human genomes with massively parallel short read sequencing
Li, R., Zhu, H., Ruan, J., Qian, W., Fang, X., Shi, Z., Li, Y., Li, S., Shan, G., Kristiansen, K., et al. (2010) · Genome Research · doi:10.1101/gr.097261.109 · Cited by 2,926
Scaffolding pre-assembled contigs using SSPACE.
Boetzer, M., Henkel, C. V., Jansen, H. J., Butler, D., & Pirovano, W. (2011) · Bioinformatics · doi:10.1093/bioinformatics/btq683 · Cited by 2,337
An integrated semiconductor device enabling non-optical genome sequencing
Rothberg, J. M., Hinz, W., Rearick, T. M., Schultz, J., Mileski, W., Davey, M., Leamon, J. H., Johnson, K., Milgrew, M. J., Edwards, M., et al. (2011) · Nature · doi:10.1038/nature10242 · Cited by 2,172
Cited by
Alignment-free sequence comparison: benefits, applications, and tools
Zielezinski, A., Vinga, S., Almeida, J., & Karlowski, W. M. (2017) · Genome Biology · doi:10.1186/s13059-017-1319-7 · Cited by 542
Assembly of long error-prone reads using de Bruijn graphs
Lin, Y., Yuan, J., Kolmogorov, M., Shen, M. W., Chaisson, M., & Pevzner, P. A. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1604560113 · Cited by 382
Self-citationLong walk to genomics: History and current approaches to genome sequencing and assembly
Giani, A. M., Gallo, G. R., Gianfranceschi, L., & Formenti, G. (2020) · Computational and Structural Biotechnology Journal · doi:10.1016/j.csbj.2019.11.002 · Cited by 304
Cassava genome from a wild ancestor to cultivated varieties
Wang, W., Feng, B., Xiao, J., Xia, Z., Zhou, X., Li, P., Zhang, W., Wang, Y., Møller, B. L., Zhang, P., et al. (2014) · Nature Communications · doi:10.1038/ncomms6110 · Cited by 273
Self-citationVollmers, J., Wiegand, S., & Kaster, A.-K. (2017) · PLoS ONE · doi:10.1371/journal.pone.0169662 · Cited by 240
Metadata
- Authors
- Li, Z., Chen, Y., Mu, D., Yuan, J., Shi, Y., Zhang, H., Gan, J., Li, N., Hu, X., Liu, B., Yang, B., & Fan, W.
- Venue
- Briefings in Functional Genomics
- Publisher
- Oxford University Press (OUP)
- Published
- 2011-12-19
- Volume
- 11
- Issue
- 1
- Pages
- 25-37
- ISSN
- 2041-2647 (ISSN-L)
- 2041-2649
- 2041-2657
- OpenAlex
- W1997246534
- Cited by
- 274
- References
- 48
- FWCI
- 3.64
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph. https://app.cochat.ai/papers/10.1093/bfgp/elr035
- The paper
- Li, Z., Chen, Y., Mu, D., Yuan, J., Shi, Y., Zhang, H., Gan, J., Li, N., Hu, X., Liu, B., Yang, B., & Fan, W. (2012). Comparison of the two major classes of assembly algorithms: overlap-layout-consensus and de-bruijn-graph. Briefings in Functional Genomics. https://doi.org/10.1093/bfgp/elr035
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.