CoChat

A Practical Comparison of De Novo Genome Assembly Software Tools for Next-Generation Sequencing Technologies

Open access

The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.

Abstract

The advent of next-generation sequencing technologies is accompanied with the development of many whole-genome sequence assembly methods and software, especially for de novo fragment assembly. Due to the poor knowledge about the applicability and performance of these software tools, choosing a befitting assembler becomes a tough task. Here, we provide the information of adaptivity for each program, then above all, compare the performance of eight distinct tools against eight groups of simulated datasets from Solexa sequencing platform. Considering the computational time, maximum random access memory (RAM) occupancy, assembly accuracy and integrity, our study indicate that string-based assemblers, overlap-layout-consensus (OLC) assemblers are well-suited for very short reads and longer reads of small genomes respectively. For large datasets of more than hundred millions of short reads, De Bruijn graph-based assemblers would be more appropriate. In terms of software implementation, string-based assemblers are superior to graph-based ones, of which SOAPdenovo is complex for the creation of configuration file. Our comparison study will assist researchers in selecting a well-suited assembler and offer essential information for the improvement of existing assemblers or the developing of novel assemblers.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1371/journal.pone.0017915

Cites

32 of 32 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Overview of de novo short reads assemblers. Programs developed from year of 2005 to 2010 are classified according to the assembly strategies. Currently, there are mainly four sorts of assemblers, while the other ones are denoted as “Other Strategies”. Different box symbols are utilized to distinguish assemblers that for short reads from different platforms.
Figure 1 Overview of de novo short reads assemblers. Programs developed from year of 2005 to 2010 are classified according to the assembly strategies. Currently, there are mainly four sorts of assemblers, while the other ones are denoted as “Other Strategies”. Different box symbols are utilized to distinguish assemblers that for short reads from different platforms.CC BY · PubMed Central
Figure 2 Computational running time and maximum memory occupancy of 36-mer short reads assembly procedures. (A) the computational times of each assembler for different datasets. (B) the maximum RAM used during the assembly process. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.
Figure 2 Computational running time and maximum memory occupancy of 36-mer short reads assembly procedures. (A) the computational times of each assembler for different datasets. (B) the maximum RAM used during the assembly process. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.CC BY · PubMed Central
Figure 3 Computational running time and maximum memory occupancy of 75-mer short reads assembly procedures. (A) the computational times of each assembler for different datasets. (B) the maximum RAM used during the assembly process. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.
Figure 3 Computational running time and maximum memory occupancy of 75-mer short reads assembly procedures. (A) the computational times of each assembler for different datasets. (B) the maximum RAM used during the assembly process. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.CC BY · PubMed Central
Figure 4 Accuracy and integrity for 36-mer datasets assembly. For short reads assembly, accurate and high genome coverage contigs are expected. Here, the quality of consequential contigs is shown with (A) the accuracy of assembled contigs and (B) the genome coverage of the assembled contigs. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.
Figure 4 Accuracy and integrity for 36-mer datasets assembly. For short reads assembly, accurate and high genome coverage contigs are expected. Here, the quality of consequential contigs is shown with (A) the accuracy of assembled contigs and (B) the genome coverage of the assembled contigs. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.CC BY · PubMed Central
Figure 5 Accuracy and integrity for 75-mer datasets assembly. For short reads assembly, accurate and high genome coverage contigs are expected. Here, the quality of consequential contigs is shown with (A) the accuracy of assembled contigs and (B) the genome coverage of the assembled contigs. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.
Figure 5 Accuracy and integrity for 75-mer datasets assembly. For short reads assembly, accurate and high genome coverage contigs are expected. Here, the quality of consequential contigs is shown with (A) the accuracy of assembled contigs and (B) the genome coverage of the assembled contigs. No data is shown when the RAM is insufficient or the assembly tool is not suitable for the dataset.CC BY · PubMed Central
Figure 6 Statistics for assembled contigs of 36-mer short reads. Indicatrix that illustrates the feature of size distribution are adopted for analysis. “#” denotes the RAM of machine is not enough, and “N/A” means the data is not available. The N50 size and N80 size represent the maximum read length for which all contigs greater than or equal to the threshold covered 50% or 80% of the reference genome.
Figure 6 Statistics for assembled contigs of 36-mer short reads. Indicatrix that illustrates the feature of size distribution are adopted for analysis. “#” denotes the RAM of machine is not enough, and “N/A” means the data is not available. The N50 size and N80 size represent the maximum read length for which all contigs greater than or equal to the threshold covered 50% or 80% of the reference genome.CC BY · PubMed Central
Figure 7 Statistics for assembled contigs of 75-mer short reads. Indicatrix that illustrates the feature of size distribution are adopted for analysis. “#” denotes the RAM of machine is not enough, and “N/A” means the data is not available. The N50 size and N80 size represent the maximum read length for which all contigs greater than or equal to the threshold covered 50% or 80% of the reference genome.
Figure 7 Statistics for assembled contigs of 75-mer short reads. Indicatrix that illustrates the feature of size distribution are adopted for analysis. “#” denotes the RAM of machine is not enough, and “N/A” means the data is not available. The N50 size and N80 size represent the maximum read length for which all contigs greater than or equal to the threshold covered 50% or 80% of the reference genome.CC BY · PubMed Central
Figure 8 Size comparison of datasets used in this study. This figure shows the relative size comparison of short reads datasets with different legends. SE denotes Single-end short reads dataset, while PE denotes Paired-end short reads dataset.
Figure 8 Size comparison of datasets used in this study. This figure shows the relative size comparison of short reads datasets with different legends. SE denotes Single-end short reads dataset, while PE denotes Paired-end short reads dataset.CC BY · PubMed Central
Figure 9 Pipeline for evaluation of short reads assembly programs. Four reference genomes with different size are exploited to generate short reads bearing base errors. The performance of assemblers is evaluated through computational time, accuracy, integrity and contig size, etc.
Figure 9 Pipeline for evaluation of short reads assembly programs. Four reference genomes with different size are exploited to generate short reads bearing base errors. The performance of assemblers is evaluated through computational time, accuracy, integrity and contig size, etc.CC BY · PubMed Central
Figure 10 Analysis of complexity of reference genome sequences. Tandem repeats finder (Version 4.04) is utilized to detect the number of repeat elements with length less than 2000 bp, the parameter “minimum alignment score ” is set to 70 and 150 for two types of short reads. The increase of genome size, repeat numbers and GC content may imply the increasing in genome assembly complexity.
Figure 10 Analysis of complexity of reference genome sequences. Tandem repeats finder (Version 4.04) is utilized to detect the number of repeat elements with length less than 2000 bp, the parameter “minimum alignment score ” is set to 70 and 150 for two types of short reads. The increase of genome size, repeat numbers and GC content may imply the increasing in genome assembly complexity.CC BY · PubMed Central
Figure 11 Features of selected short reads assembly programs. Noncommercial programs based on varied sorts of assembly approaches were selected for testing on synthetic Solexa short reads. “*” indicates any operating systems with perl interpreter, while “OLC” is for overlap-layout-consensus, and “N/A” for not available. The features for different programs are obtained from related references and documents of the latest version software (version information is not listed here).
Figure 11 Features of selected short reads assembly programs. Noncommercial programs based on varied sorts of assembly approaches were selected for testing on synthetic Solexa short reads. “*” indicates any operating systems with perl interpreter, while “OLC” is for overlap-layout-consensus, and “N/A” for not available. The features for different programs are obtained from related references and documents of the latest version software (version information is not listed here).CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

  • Basic local alignment search tool

    Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669 · cited 1×

    “2.20 for Windows 32bit machine [32], of which with size no shorter than Ybp (Y is 100 bp for 36mer datasets and 200 bp for 75mer datasets) and at least 98% of each read completely match to the reference sequence were presumed to be correct.”
    BackgroundInfluential
  • 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 · cited 1×

    “Several assemblers, such as SSAKE [9], SOAPdenovo [11], AbySS [12], Velvet [14,15], exploit PE sequencing information to reduce gaps from assembled contigs.”
    Method
  • Tandem repeats finder: a program to analyze DNA sequences

    Benson, G. (1999) · Nucleic Acids Research · doi:10.1093/nar/27.2.573 · Cited by 9,374 · cited 1×

    “Before the assembly procedure implemented, we detected the repeat elements in reference genomes with Tandem Repeats Finder [31].”
    Method
  • Next-generation DNA sequencing

    Shendure, J., & Ji, H. (2008) · Nature Biotechnology · doi:10.1038/nbt1486 · Cited by 4,509 · cited 2×

    “In recent years, the next-generation sequencing (or deep sequencing) technologies have been evolving rapidly, with the potential to accelerate biological and biomedical research dramatically [1].”
    BackgroundResultInfluential
  • 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 · cited 5×

    “Three hierarchies of parallelization are taken into implementation: multi-thread on a single machine [11], multi-process with cluster machines [12,25] and cloud computation (http://sourceforge.net/apps/mediawiki/contrail-bio/index. php?title = Contrail).”
    BackgroundMethodInfluential
  • 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 · cited 5×

    “However, short reads from eukaryote genomes, with features of gargantuan size and high repetitiveness, make sky-high requirement for assembly strategies and computer hardware [10,11,23,24].”
    BackgroundMethodInfluential
  • 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 · cited 4×

    “For large datasets of more than hundred millions of short reads, De Bruijn graph-based assemblers could have commendable resolutions due to their short runtime and low RAM occupancy, of which SOAPdenovo performs well on very short reads, while ALLPATHS-LG could be a good choice for ,100 bp short reads assembly, as it…”
    BackgroundMethodInfluential
  • An 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 · cited 1×

    “DNA fragment assembly has a long history since the emergence of the first generation of sequencing technologies [2,3].”
    Background
  • 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 · cited 2×

    “String-based assem-blers, implemented with Greedy-extension algorithm, are mainly reported for the assembly of small genomes [5,7,8,9], while the latter ones are designed aiming at handling complex genomes [10,11,12].”
    Background
  • 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 · cited 2×

    “Genome sequence assembly is greatly challenged by repeat sequences, especially when the repeats are longer than short reads [4].”
    Background

Show all 32 references

Cited by

See all 265

Metadata

Authors
Zhang, W., Chen, J., Yang, Y., Tang, Y., Shang, J., & Shen, B.
Affiliations
Soochow University (CN)
Corresponding author
Shen, Bairong
Venue
PLoS ONE
Published
2011-03-14
Volume
6
Issue
3
Pages
e17915
ISSN
1932-6203 (ISSN-L)
OpenAlex
W2167719367
Cited by
250
References
32
Citations by year
2026: 1 · 2025: 1 · 2024: 4 · 2023: 6 · 2022: 9 · 2021: 6 · 2020: 11 · 2019: 7 · 2018: 14 · 2017: 27 · 2016: 27 · 2015: 25 · 2014: 37 · 2013: 32 · 2012: 28
FWCI
14.53
Type
journal article
Language
en
Open access
Locations
  • PLoS ONE (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • Figshare (submittedVersion, cc-by)
Funders
National Natural Science Foundation of China (31040020)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
Keywords
de novo genome assembly, next-generation sequencing, Illumina sequencing, simulated sequencing data, assembly accuracy, computational performance
MeSH terms
Animals, Base Sequence, Humans, Reference Standards, Software, Time Factors, Genome, Sequence Analysis, DNA, Computational Biology, Contig Mapping, Databases, Nucleic Acid

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 Practical Comparison of De Novo Genome Assembly Software Tools for Next-Generation Sequencing Technologies. https://app.cochat.ai/papers/10.1371/journal.pone.0017915
The paper
Zhang, W., Chen, J., Yang, Y., Tang, Y., Shang, J., & Shen, B. (2011). A Practical Comparison of De Novo Genome Assembly Software Tools for Next-Generation Sequencing Technologies. PLoS ONE. https://doi.org/10.1371/journal.pone.0017915

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.