The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Benchmarking of long-read assemblers for prokaryote whole genome sequencing
Open accessAbstract
Background: Data sets from long-read sequencing platforms (Oxford Nanopore Technologies and Pacific Biosciences) allow for most prokaryote genomes to be completely assembled – one contig per chromosome or plasmid. However, the high per-read error rate of long-read sequencing necessitates different approaches to assembly than those used for short-read sequencing. Multiple assembly tools (assemblers) exist, which use a variety of algorithms for long-read assembly. Methods: We used 500 simulated read sets and 120 real read sets to assess the performance of eight long-read assemblers (Canu, Flye, Miniasm/Minipolish, NECAT, NextDenovo/NextPolish, Raven, Redbean and Shasta) across a wide variety of genomes and read parameters. Assemblies were assessed on their structural accuracy/completeness, sequence identity, contig circularisation and computational resources used. Results: Canu v2.1 produced reliable assemblies and was good with plasmids, but it performed poorly with circularisation and had the longest runtimes of all assemblers tested. Flye v2.8 was also reliable and made the smallest sequence errors, though it used the most RAM. Miniasm/Minipolish v0.3/v0.1.3 was the most likely to produce clean contig circularisation. NECAT v20200803 was reliable and good at circularisation but tended to make larger sequence errors. NextDenovo/NextPolish v2.3.1/v1.3.1 was reliable with chromosome assembly but bad with plasmid assembly. Raven v1.3.0 was reliable for chromosome assembly, though it did not perform well on small plasmids and had circularisation issues. Redbean v2.5 and Shasta v0.7.0 were computationally efficient but more likely to produce incomplete assemblies. Conclusions: Of the assemblers tested, Flye, Miniasm/Minipolish, NextDenovo/NextPolish and Raven performed best overall. However, no single tool performed well on all metrics, highlighting the need for continued development on long-read 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
Minimap2: Pairwise alignment for nucleotide sequences
Li, H. (2018) · Bioinformatics · doi:10.1093/bioinformatics/bty191 · Cited by 14,807
QUAST: quality assessment tool for genome assemblies
Gurevich, A., Saveliev, V., Vyahhi, N., & Tesler, G. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt086 · Cited by 11,172
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
Walker, B. J., Abeel, T., Shea, T., Priest, M., Abouelliel, A., Sakthikumar, S., Cuomo, C. A., Zeng, Q., Wortman, J., Young, S. K., et al. (2014) · PLoS ONE · doi:10.1371/journal.pone.0112963 · Cited by 9,197
Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads
Wick, R. R., Judd, L. M., Gorrie, C. L., & Holt, K. E. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005595 · Cited by 8,653
Self-citationCanu: scalable and accurate long-read assembly via adaptive k -mer weighting and repeat separation
Koren, S., Walenz, B. P., Berlin, K., Miller, J. R., Bergman, N. H., & Phillippy, A. M. (2017) · Genome Research · doi:10.1101/gr.215087.116 · Cited by 7,304
Assembly of long, error-prone reads using repeat graphs
Kolmogorov, M., Yuan, J., Lin, Y., & Pevzner, P. A. (2019) · Nature Biotechnology · doi:10.1038/s41587-019-0072-8 · Cited by 5,986
Coming of age: ten years of next-generation sequencing technologies
Goodwin, S., McPherson, J. D., & McCombie, W. R. (2016) · Nature Reviews Genetics · doi:10.1038/nrg.2016.49 · Cited by 4,352
Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data
Chin, C.-S., Alexander, D. H., Marks, P., Klammer, A. A., Drake, J., Heiner, C., Clum, A., Copeland, A., Huddleston, J., Eichler, E. E., et al. (2013) · Nature Methods · doi:10.1038/nmeth.2474 · Cited by 4,029
Performance of neural network basecalling tools for Oxford Nanopore sequencing
Wick, R. R., Judd, L. M., & Holt, K. E. (2019) · Genome Biology · doi:10.1186/s13059-019-1727-y · Cited by 3,221
Self-citationFast and accurate de novo genome assembly from long uncorrected reads
Vaser, R., Sović, I., Nagarajan, N., & Šikić, M. (2017) · Genome Research · doi:10.1101/gr.214270.116 · Cited by 3,043
Phased diploid genome assembly with single-molecule real-time sequencing
Chin, C.-S., Peluso, P., Sedlazeck, F. J., Nattestad, M., Concepcion, G. T., Clum, A., Dunn, C., O'Malley, R., Figueroa-Balderas, R., Morales-Cruz, A., et al. (2016) · Nature Methods · doi:10.1038/nmeth.4035 · Cited by 1,904
Zimin, A. V., Marçais, G., Puiu, D., Roberts, M., Salzberg, S. L., & Yorke, J. A. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt476 · Cited by 1,463
Fast and accurate long-read assembly with wtdbg2
Ruan, J., & Li, H. (2020) · Nature Methods · doi:10.1038/s41592-019-0669-3 · Cited by 1,380
A complete bacterial genome assembled de novo using only nanopore sequencing data
Loman, N. J., Quick, J., & Simpson, J. T. (2015) · Nature Methods · doi:10.1038/nmeth.3444 · Cited by 1,294
NextPolish: a fast and efficient genome polishing tool for long-read assembly
Hu, J., Fan, J., Sun, Z., & Liu, S. (2020) · Bioinformatics · doi:10.1093/bioinformatics/btz891 · Cited by 1,219
Completing bacterial genome assemblies with multiplex MinION sequencing
Wick, R. R., Judd, L. M., Gorrie, C. L., & Holt, K. E. (2017) · Microbial Genomics · doi:10.1099/mgen.0.000132 · Cited by 978
Self-citationInsights from 20 years of bacterial genome sequencing
Land, M., Hauser, L., Jun, S.-R., Nookaew, I., Leuze, M. R., Ahn, T.-H., Karpinets, T., Lund, O., Kora, G., Wassenaar, T., et al. (2015) · Functional & Integrative Genomics · doi:10.1007/s10142-015-0433-4 · Cited by 727
Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomes
Shafin, K., Pesout, T., Lorig-Roach, R., Haukness, M., Olsen, H. E., Bosworth, C., Armstrong, J., Tigyi, K., Maurer, N., Koren, S., et al. (2020) · Nature Biotechnology · doi:10.1038/s41587-020-0503-6 · Cited by 567
The fragment assembly string graph
Myers, E. W. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1114 · Cited by 424
Comparison of long-read sequencing technologies in the hybrid assembly of complex bacterial genomes
De Maio, N., Shaw, L. P., Hubbard, A., George, S., Sanderson, N. D., Swann, J., Wick, R., AbuOun, M., Stubberfield, E., Hoosdally, S. J., et al. (2019) · Microbial Genomics · doi:10.1099/mgen.0.000294 · Cited by 270
Self-citationCurrent Strategies of Polyploid Plant Genome Sequence Assembly
Kyriakidou, M., Tai, H. H., Anglin, N. L., Ellis, D., & Strömvik, M. V. (2018) · Frontiers in Plant Science · doi:10.3389/fpls.2018.01660 · Cited by 203
Efficient Local Alignment Discovery amongst Noisy Long Reads
Myers, G. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-44753-6_5 · Cited by 164
Badread: simulation of error-prone long reads
Wick, R. R. (2019) · The Journal of Open Source Software · doi:10.21105/joss.01316 · Cited by 155
Self-citationHINGE: long-read assembly achieves optimal repeat resolutionPreprint
Kamath, G. M., Shomorony, I., Xia, F., Courtade, T. A., & Tse, D. N. C. (2017) · Genome Research · doi:10.1101/gr.216465.116 · Cited by 93
Haubold, B., & Wiehe, T. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-541 · Cited by 83
A history of DNA sequence assembly
Myers, E. W. (2016) · it - Information Technology · doi:10.1515/itit-2015-0047 · Cited by 49
Yet another de novo genome assembler
Vaser, R., & Šikić, M. (2019) · International symposium on image and signal processing and analysis/ISPA ... · doi:10.1109/ispa.2019.8868909 · Cited by 49
Chen, Y., Nie, F., Xie, S., Zheng, Y., Bray, T., Dai, Q., Wang, Y.-X., Xing, J.-F., Huang, Z., Wang, D., et al. (2020) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2020.02.01.930107 · Cited by 38
Cited by
Polypolish: Short-read polishing of long-read bacterial genome assemblies
Wick, R. R., & Holt, K. E. (2022) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1009802 · Cited by 703
Self-citationTrycycler: consensus long-read assemblies for bacterial genomes
Wick, R. R., Judd, L. M., Cerdeira, L. T., Hawkey, J., Méric, G., Vezina, B., Wyres, K. L., & Holt, K. E. (2021) · Genome Biology · doi:10.1186/s13059-021-02483-z · Cited by 531
Self-citationTime- and memory-efficient genome assembly with Raven
Vaser, R., & Šikić, M. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00073-4 · Cited by 522
BFVD—a large repository of predicted viral protein structures
Kim, R. S., Levy Karin, E., Mirdita, M., Chikhi, R., & Steinegger, M. (2025) · Nucleic Acids Research · doi:10.1093/nar/gkae1119 · Cited by 86
Mitochondrial genome diversity across the subphylum Saccharomycotina
Wolters, J. F., LaBella, A. L., Opulente, D. A., Rokas, A., & Hittinger, C. T. (2023) · Frontiers in Microbiology · doi:10.3389/fmicb.2023.1268944 · Cited by 17
Metadata
- Authors
- Wick, R. R., & Holt, K. E.
- Venue
- F1000Research
- Publisher
- F1000 Research Ltd
- Published
- 2021-02-01
- Volume
- 8
- Pages
- 2138
- ISSN
- 2046-1402 (ISSN-L)
- OpenAlex
- W2994969834
- Cited by
- 278
- References
- 29
- FWCI
- 12.61
- Type
- journal article
- Language
- en
- Open access
- gold
- Licence
- creativecommons.org/licenses/by/4.0/ (tdm)
- Funders
- Sylvia and Charles Viertel Charitable Foundation
- Bill and Melinda Gates Foundation (OPP1175797)
- Department of Education, Employment and Workplace Relations, Australian Government
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.