A Practical Comparison of De Novo Genome Assembly Software Tools for Next-Generation Sequencing Technologies
Open accessThe 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.
Integrity signals
Registry
Cites
Statistics
Figures











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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Different assemblers have different applicability and performance [15], [16].”
From Digital Gene Expression Analysis Based on Integrated De Novo Transcriptome Assembly of Sweet Potato [Ipomoea batatas (L.) Lam.] (2012) · cites this paper as [15]
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.”
BackgroundInfluentialVelvet: 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.”
MethodTandem 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].”
MethodNext-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].”
BackgroundResultInfluentialABySS: 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).”
BackgroundMethodInfluentialDe 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].”
BackgroundMethodInfluentialHigh-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…”
BackgroundMethodInfluentialAn 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].”
BackgroundThe 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].”
BackgroundAssembly 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].”
BackgroundDe novo bacterial genome sequencing: Millions of very short reads assembled on a desktop computer
Hernandez, D., François, P., Farinelli, L., Østerås, M., & Schrenzel, J. (2008) · Genome Research · doi:10.1101/gr.072033.107 · Cited by 629 · cited 2×
“Edena is a typically graph-based assembly tool, which has two running modes: strict and nonstrict modes [16].”
BackgroundRay: Simultaneous Assembly of Reads from a Mix of High-Throughput Sequencing Technologies
Boisvert, S., Laviolette, F., & Corbeil, J. (2010) · Journal of Computational Biology · doi:10.1089/cmb.2009.0238 · Cited by 539 · cited 1×
“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.”
Assembling millions of short DNA sequences using SSAKE
Warren, R. L., Sutton, G. G., Jones, S. J. M., & Holt, R. A. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl629 · Cited by 495 · cited 3×
“Several assemblers, such as SSAKE [9], SOAPdenovo [11], AbySS [12], Velvet [14,15], exploit PE sequencing information to reduce gaps from assembled contigs.”
BackgroundMethodHigh-throughput sequence alignment using Graphics Processing Units
Schatz, M. C., Trapnell, C., Delcher, A. L., & Varshney, A. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-474 · Cited by 310 · cited 1×
“Interestingly, GPU computational method has been applied in other two short reads analysis procedures, i.e. error correction and alignment, and speeded up of these processes many times as reported [26,27,28].”
MethodSHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing
Dohm, J. C., Lottaz, C., Borodina, T., & Himmelbauer, H. (2007) · Genome Research · doi:10.1101/gr.6435207 · Cited by 283 · 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].”
BackgroundDe 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 · cited 1×
“Here, we also verified that PE reads is superior to SE reads in terms of resolution for repetitive elements, which is in consistent with previous study [18].”
ResultExtending assembly of short DNA sequences to handle error
Jeck, W. R., Reinhardt, J. A., Baltrus, D. A., Hickenbotham, M. T., Magrini, V., Mardis, E. R., Dangl, J. L., & Jones, C. D. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm451 · Cited by 269 · cited 1×
“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].”
BackgroundZerbino, D. R., McEwen, G. K., Margulies, E. H., & Birney, E. (2009) · PLoS ONE · doi:10.1371/journal.pone.0008407 · Cited by 223 · 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.”
MethodDe novo assembly of short sequence reads
Paszkiewicz, K., & Studholme, D. J. (2010) · Briefings in Bioinformatics · doi:10.1093/bib/bbq020 · Cited by 204 · cited 1×
“Even though the assembly algorithms for de novo genome assembly have been well-reviewed [19], we are the first to test and compare these tools with different datasets practically.”
MethodNowrousian, M., Stajich, J. E., Chu, M., Engh, I., Espagne, E., Halliday, K., Kamerewerd, J., Kempken, F., Knab, B., Kuo, H.-C., et al. (2010) · PLoS Genetics · doi:10.1371/journal.pgen.1000891 · Cited by 193 · cited 1×
“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].”
BackgroundDiGuistini, S., Liao, N. Y., Platt, D., Robertson, G., Seidel, M., Chan, S. K., Docking, T. R., Birol, I., Holt, R. A., Hirst, M., et al. (2009) · Genome Biology · doi:10.1186/gb-2009-10-9-r94 · Cited by 161 · cited 1×
“Besides, integration of multi datasets from various sequencing strategies are exploited to tackle the complex genome assembly [29], which greatly challenge the development of assembly algorithms to suit for diverse short reads.”
BackgroundAssembly complexity of prokaryotic genomes using short reads
Kingsford, C., Schatz, M. C., & Pop, M. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-21 · Cited by 155 · cited 1×
“Assembly for small genomes, such as those of prokaryote organisms, has been well resolved [20,21,22].”
BackgroundReinhardt, J. A., Baltrus, D. A., Nishimura, M. T., Jeck, W. R., Jones, C. D., & Dangl, J. L. (2009) · Genome Research · doi:10.1101/gr.083311.108 · Cited by 148 · cited 1×
“Usually, several assembler are combined for this issue [30].”
BackgroundWhole genome assembly of a natto production strain Bacillus subtilis natto from very short read data
Nishito, Y., Osana, Y., Hachiya, T., Popendorf, K., Toyoda, A., Fujiyama, A., Itaya, M., & Sakakibara, Y. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-243 · Cited by 112 · cited 1×
“Assembly for small genomes, such as prokaryote organisms, has been well resolved [20,21,22].”
BackgroundOptimizing data intensive GPGPU computations for DNA sequence alignment
Trapnell, C., & Schatz, M. C. (2009) · Parallel Computing · doi:10.1016/j.parco.2009.05.002 · Cited by 111 · cited 1×
“error correction and alignment, and speeded up of these processes many times as reported [26,27,28].”
BackgroundDe novo sequencing of plant genomes using second-generation technologies
Imelfort, M., & Edwards, D. (2009) · Briefings in Bioinformatics · doi:10.1093/bib/bbp039 · Cited by 110 · cited 1×
“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].”
BackgroundFarrer, R. A., Kemen, E., Jones, J. D. G., & Studholme, D. J. (2009) · FEMS Microbiology Letters · doi:10.1111/j.1574-6968.2008.01441.x · Cited by 77 · cited 1×
“Assembly for small genomes, such as prokaryote organisms, has been well resolved [20,21,22].”
BackgroundQSRA – a quality-value guided de novo short read assembler
Bryant, D. W., Wong, W., & Mockler, T. C. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-69 · Cited by 77 · cited 2×
“QSRA [7] is developed upon the original VCAKE algorithm, which indeed reduces the computational time, at the cost of RAM occupation.”
BackgroundMethodShi, H., Schmidt, B., Liu, W., & Müller‐Wittig, W. (2010) · Journal of Computational Biology · doi:10.1089/cmb.2009.0062 · Cited by 73 · cited 1×
“Interestingly, GPU computational method has been applied in other two short reads analysis procedures, i.e. error correction and alignment, and speeded up of these processes many times as reported [26,27,28].”
MethodA fast hybrid short read fragment assembly algorithm
Schmidt, B., Sinha, R., Beresford-Smith, B., & Puglisi, S. J. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp374 · Cited by 53 · cited 1×
“At last, Taipan was proposed as the hybrid of string-based and graph-based approaches [17], with the dominative feature - the exceedingly short runtime.”
BackgroundCahill, M. J., Köser, C. U., Ross, N. E., & Archer, J. A. C. (2010) · PLoS ONE · doi:10.1371/journal.pone.0011518 · Cited by 44 · cited 2×
“The paired-end (PE) sequencing can, to some extent, compensate for read length [13].”
BackgroundUsing the TIGR Assembler in Shotgun Sequencing Projects
Pop, M., & Kosack, D. (2004) · Humana Press eBooks · doi:10.1385/1-59259-752-1:279 · Cited by 23 · cited 1×
“DNA fragment assembly has a long history since the emergence of the first generation of sequencing technologies [2,3].”
Background
Cited by
Ten years of next-generation sequencing technology
van Dijk, E. L., Auger, H., Jaszczyszyn, Y., & Thermes, C. (2014) · Trends in Genetics · doi:10.1016/j.tig.2014.07.001 · Cited by 1,622
Bacillus thuringiensis Toxins: An Overview of Their Biocidal Activity
Palma, L., Muñoz, D., Berry, C., Murillo, J., & Caballero, P. (2014) · Toxins · doi:10.3390/toxins6123296 · Cited by 810
“Sequences can readily be assembled in contigs using a regular desktop computer [160] with de novo assembly tools bundled in bioinformatic software, such as CLC Genomics Workbench or Geneious Pro (both commercial software), or using diverse open source assemblers freely available in the BioLinux distribution [161], amo…”
Corset: enabling differential gene expression analysis for de novoassembled transcriptomes
Davidson, N. M., & Oshlack, A. (2014) · Genome Biology · doi:10.1186/s13059-014-0410-6 · Cited by 673
“For example, the relative merits of different de novo assemblers and steps prior to assembly, such as quality control, have been examined [12 – 15].”
BackgroundAssemblathon 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
Nagarajan, N., & Pop, M. (2013) · Nature Reviews Genetics · doi:10.1038/nrg3367 · Cited by 474
“The genome of a single organism isolated through culture, for which a substantial quantity of DNA can be obtained. on the specific structure of the sequencing experiment (in terms of the genome repeat structure, sequencing technology used, and so forth) 42,43,60,61 .”
Background
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
- Publisher
- Public Library of Science (PLoS)
- Published
- 2011-03-14
- Volume
- 6
- Issue
- 3
- Pages
- e17915
- ISSN
- 1932-6203 (ISSN-L)
- PMC
- PMC3056720
- 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
- gold
- doi.org
- 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
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.