Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 230

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

Benchmarking of long-read assemblers for prokaryote whole genome sequencing

Open access
Wick, Ryan R., Holt, Kathryn E. · 2019 · F1000Research

Abstract

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 six long-read assemblers (Canu, Flye, Miniasm/Minipolish, 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 v1.9 produced moderately reliable assemblies but had the longest runtimes of all assemblers tested. Flye v2.6 was more reliable and did particularly well with plasmid assembly. Miniasm/Minipolish v0.3 was the only assembler which consistently produced clean contig circularisation. Raven v0.0.5 was the most reliable for chromosome assembly, though it did not perform well on small plasmids and had circularisation issues. Redbean v2.5 and Shasta v0.3.0 were computationally efficient but more likely to produce incomplete assemblies. Conclusions: Of the assemblers tested, Flye, Miniasm/Minipolish 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.12688/f1000research.21782.1

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 7 references

Research works printed but not linked: 20

  1. E Myers, 2016, A history of DNA sequence assembly., IT - Information Technology., 58, 126-132, 10.1515/itit-2015-0047 · DOI
  2. M Land, 2015, Insights from 20 years of bacterial genome sequencing., Funct Integr Genomics., 15, 141-161, 10.1007/s10142-015-0433-4 · DOI · Paper page
  3. B Haubold, 2006, How repetitive are genomes?, BMC Bioinformatics., 7, 541, 10.1186/1471-2105-7-541 · DOI
  4. M Kyriakidou, 2018, Current Strategies of Polyploid Plant Genome Sequence Assembly., Front Plant Sci., 9, 1660, 10.3389/fpls.2018.01660 · DOI · Paper page
  5. N Loman, 2015, A complete bacterial genome assembled de novo using only nanopore sequencing data., Nat Methods., 12, 733-735, 10.1038/nmeth.3444 · DOI · Paper page
  6. R Wick, 2019, Badread: simulation of error-prone long reads., J Open Source Softw., 4, 1316, 10.21105/joss.01316 · DOI
  7. R Wick, 2017, Completing bacterial genome assemblies with multiplex MinION sequencing., Microb Genom., 3, e000132, 10.1099/mgen.0.000132 · DOI · Paper page
  8. N De Maio, 2019, Comparison of long-read sequencing technologies in the hybrid assembly of complex bacterial genomes., Microb Genom., 5, e000294, 10.1099/mgen.0.000294 · DOI · Paper page
  9. R Wick, 2017, Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads., PLoS Comput Biol., 13, e1005595, 10.1371/journal.pcbi.1005595 · DOI · Paper page
  10. C Chin, 2013, Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data., Nat Methods., 10, 563-569, 10.1038/nmeth.2474 · DOI · Paper page
  11. C Chin, 2016, Phased diploid genome assembly with single-molecule real-time sequencing., Nat Methods., 13, 1050-1054, 10.1038/nmeth.4035 · DOI · Paper page
  12. G Kamath, 2017, HINGE: long-read assembly achieves optimal repeat resolution., Genome Res., 27, 747-756, 10.1101/gr.216465.116 · DOI
  13. E Myers, 2014, Efficient local alignment discovery amongst noisy long reads., Lecture Notes in Computer Science., 8701, 52-67, 10.1007/978-3-662-44753-6_5 · DOI · Paper page
  14. A Zimin, 2013, The MaSuRCA genome assembler., Bioinformatics., 29, 2669-2677, 10.1093/bioinformatics/btt476 · DOI · Paper page
  15. S Koren, 2017, Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation., Genome Res., 27, 722-736, 10.1101/gr.215087.116 · DOI · Paper page
  16. R Vaser, 2017, Fast and accurate de novo genome assembly from long uncorrected reads., Genome Res., 27, 737-746, 10.1101/gr.214270.116 · DOI · Paper page
  17. R Vaser, 2019, Yet another de novo genome assembler., bioRxiv., 10.1101/656306 · DOI
  18. J Ruan, 2019, Fast and accurate long-read assembly with wtdbg2., Nat Methods., 10.1038/s41592-019-0669-3 · DOI · Paper page
  19. D Zerbino, 2008, Velvet: algorithms for de novo short read assembly using de Bruijn graphs., Genome Res., 18, 821-829, 10.1101/gr.074492.107 · DOI · Paper page
  20. B Walker, 2014, Pilon: an integrated tool for comprehensive microbial variant detection and genome assembly improvement., PLoS One., 9, e112963, 10.1371/journal.pone.0112963 · DOI · Paper page

Cited by

See all 230

Metadata

Authors
Wick, R. R., & Holt, K. E.
Venue
F1000Research
Published
2019-12-23
Volume
8
Pages
2138
ISSN
2046-1402 (ISSN-L)
OpenAlex
W4244292587
Cited by
230
References
7
FWCI
6.23
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Benchmarking of long-read assemblers for prokaryote whole genome sequencing. https://app.cochat.ai/papers/10.12688/f1000research.21782.1
The paper
Wick, R. R., & Holt, K. E. (2019). Benchmarking of long-read assemblers for prokaryote whole genome sequencing. F1000Research. https://doi.org/10.12688/f1000research.21782.1

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.