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.
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
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
A Whole-Genome Assembly of Drosophila
Myers, E. W., Sutton, G. G., Delcher, A. L., Dew, I. M., Fasulo, D. P., Flanigan, M. J., Kravitz, S. A., Mobarry, C. M., Reinert, K. H. J., Remington, K. A., et al. (2000) · Science · doi:10.1126/science.287.5461.2196 · Cited by 1,538
High-quality draft assemblies of mammalian genomes from massively parallel sequence data
Gnerre, S., MacCallum, I., Przybylski, D., Ribeiro, F. J., Burton, J. N., Walker, B. J., Sharpe, T., Hall, G., Shea, T. P., Sykes, S., et al. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1017351108 · Cited by 1,533
The genome of the cucumber,Cucumis sativus L
Huang, S., Li, R., Zhang, Z., Li, L., Gu, X., Fan, W., Lucas, W. J., Wang, X., Xie, B., Ni, P., et al. (2009) · Nature Genetics · doi:10.1038/ng.475 · Cited by 1,490
Self-citationAn Eulerian path approach to DNA fragment assembly
Pevzner, P. A., Tang, H., & Waterman, M. S. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.171285098 · Cited by 1,352
The sequence and de novo assembly of the giant panda genome
Li, R., Fan, W., Tian, G., Zhu, H., He, L., Cai, J., Huang, Q., Cai, Q., Li, B., Bai, Y., et al. (2010) · Nature · doi:10.1038/nature08696 · Cited by 1,180
Self-citationAnalyzing and minimizing PCR amplification bias in Illumina sequencing libraries
Aird, D., Ross, M. G., Chen, W.-S., Danielsson, M., Fennell, T., Russ, C., Jaffe, D. B., Nusbaum, C., & Gnirke, A. (2011) · Genome Biology · doi:10.1186/gb-2011-12-2-r18 · Cited by 1,174
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
A Draft Sequence for the Genome of the Domesticated Silkworm ( Bombyx mori )
Biology analysis group, Xia, Q., Zhou, Z., Lu, C., Cheng, D., Dai, F., Li, B., Zhao, P., Zha, X., Cheng, T., et al. (2004) · Science · doi:10.1126/science.1102210 · Cited by 1,117
Self-citationThe Genomes of Oryza sativa: A History of Duplications
Yu, J., Wang, J., Lin, W., Li, S., Li, H., Zhou, J., Ni, P., Dong, W., Hu, S., Zeng, C., et al. (2005) · PLoS Biology · doi:10.1371/journal.pbio.0030038 · Cited by 983
Self-citationGenomic mapping by fingerprinting random clones: A mathematical analysis
Lander, E. S., & Waterman, M. S. (1988) · Genomics · doi:10.1016/0888-7543(88)90007-9 · Cited by 961
The diploid genome sequence of an Asian individual
Wang, J., Wang, W., Li, R., Li, Y., Tian, G., Goodman, L., Fan, W., Zhang, J., Li, J., Zhang, J., et al. (2008) · Nature · doi:10.1038/nature07484 · Cited by 924 · cited 1×
“However, although the secondgeneration technologies are comparatively very cheap, their application was mainly restricted to resequencing projects [4, 5] where a good reference sequence existed, due to the much shorter read length (30–400 bp) in comparison with Sanger sequencing (500–1000 bp).”
BackgroundSelf-citationLimitations of next-generation genome sequence assembly
Alkan, C., Sajjadian, S., & Eichler, E. E. (2011) · Nature Methods · doi:10.1038/nmeth.1527 · Cited by 733
High-Throughput Gene Mapping in Caenorhabditis elegans
Swan, K. A., Curtis, D. E., McKusick, K. B., Voinov, A. V., Mapa, F. A., & Cancilla, M. R. (2002) · Genome Research · doi:10.1101/gr.208902 · Cited by 616
Aggressive assembly of pyrosequencing reads with mates
Miller, J. R., Delcher, A. L., Koren, S., Venter, E., Walenz, B. P., Brownley, A., Johnson, J., Li, K., Mobarry, C., & Sutton, G. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn548 · Cited by 602
Quake: quality-aware detection and correction of sequencing errors
Kelley, D. R., Schatz, M. C., & Salzberg, S. L. (2010) · Genome Biology · doi:10.1186/gb-2010-11-11-r116 · Cited by 582
Assembly of large genomes using second-generation sequencing
Schatz, M. C., Delcher, A. L., & Salzberg, S. L. (2010) · Genome Research · doi:10.1101/gr.101360.109 · Cited by 499
Eukaryotic genome size databases
Gregory, T. R., Nicol, J. A., Tamm, H., Kullman, B., Kullman, K., Leitch, I. J., Murray, B. G., Kapraun, D. F., Greilhuber, J., & Bennett, M. D. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkl828 · Cited by 432
A strategy of DNA sequencing employing computer programs
Staden, R. (1979) · Nucleic Acids Research · doi:10.1093/nar/6.7.2601 · Cited by 409
Genome assembly reborn: recent computational challenges
Pop, M. (2009) · Briefings in Bioinformatics · doi:10.1093/bib/bbp026 · Cited by 387
Complete Resequencing of 40 Genomes Reveals Domestication Events and Genes in Silkworm ( Bombyx )
Xia, Q., Guo, Y., Zhang, Z., Li, D., Xuan, Z., Li, Z., Dai, F., Li, Y., Cheng, D., Li, R., et al. (2009) · Science · doi:10.1126/science.1176620 · Cited by 380
Self-citationSense from sequence reads: methods for alignment and assembly
Flicek, P., & Birney, E. (2009) · Nature Methods · doi:10.1038/nmeth.1376 · Cited by 358
A New Algorithm for DNA Sequence Assembly
IDURY, R. M., & WATERMAN, M. S. (1995) · Journal of Computational Biology · doi:10.1089/cmb.1995.2.291 · Cited by 342
Improving draft assemblies by iterative mapping and assembly of short reads to eliminate gaps
Tsai, I. J., Otto, T. D., & Berriman, M. (2010) · Genome Biology · doi:10.1186/gb-2010-11-4-r41 · Cited by 281
De novo fragment assembly with short mate-paired reads: Does the read length matter?
Chaisson, M. J., Brinza, D., & Pevzner, P. A. (2009) · Genome Research · doi:10.1101/gr.079053.108 · Cited by 279
Discovering and detecting transposable elements in genome sequences
Bergman, C. M., & Quesneville, H. (2007) · Briefings in Bioinformatics · doi:10.1093/bib/bbm048 · Cited by 258
Efficient construction of an assembly string graph using the FM-index
Simpson, J. T., & Durbin, R. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq217 · Cited by 254
Mouse segmental duplication and copy number variation
She, X., Cheng, Z., Zöllner, S., Church, D. M., & Eichler, E. E. (2008) · Nature Genetics · doi:10.1038/ng.172 · Cited by 224
Zerbino, D. R., McEwen, G. K., Margulies, E. H., & Birney, E. (2009) · PLoS ONE · doi:10.1371/journal.pone.0008407 · Cited by 223
Mullikin, J. C., & Ning, Z. (2003) · Genome Research · doi:10.1101/gr.731003 · Cited by 222
Reptile: representative tiling for short read error correction
Yang, X., Dorman, K. S., & Aluru, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq468 · Cited by 158
SOPRA: Scaffolding algorithm for paired reads via statistical optimization
Dayarian, A., Michael, T. P., & Sengupta, A. M. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-345 · Cited by 142
Optimized Multiplex PCR: Efficiently Closing a Whole-Genome Shotgun Sequencing Project
Tettelin, H., Radune, D., Kasif, S., Khouri, H. M., & Salzberg, S. L. (1999) · Genomics · doi:10.1006/geno.1999.6048 · Cited by 140
Assembling Genomic DNA Sequences with PHRAP
de la Bastide, M., & McCombie, W. R. (2007) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi1104s17 · Cited by 137
HiTEC: accurate error correction in high-throughput sequencing data
Ilie, L., Fazayeli, F., & Ilie, S. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq653 · Cited by 137
Phenotypic connections in surprising places
Linghu, B., & DeLisi, C. (2010) · Genome biology · doi:10.1186/gb-2010-11-4-116 · Cited by 128
ECHO: A reference-free short-read error correction algorithmPreprint
Kao, W.-C., Chan, A. H., & Song, Y. S. (2011) · Genome Research · doi:10.1101/gr.111351.110 · Cited by 118
RePS: A Sequence Assembler That Masks Exact Repeats Identified from the Shotgun DataPreprint
Wang, J., Wong, G. K., Ni, P., Han, Y., Huang, X., Zhang, J., Ye, C., Zhang, Y., Hu, J., Zhang, K., et al. (2002) · Genome Research · doi:10.1101/gr.165102 · Cited by 72
Generating a Genome Assembly with PCAP
Huang, X., & Yang, S. (2005) · Current Protocols in Bioinformatics · doi:10.1002/0471250953.bi1103s11 · Cited by 40
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
Bioinformatics and Computational Tools for Next-Generation Sequencing Analysis in Clinical Genetics
Pereira, R., Oliveira, J., & Sousa, M. (2020) · Journal of Clinical Medicine · doi:10.3390/jcm9010132 · Cited by 279
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-citation
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
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.