Benchmarking of long-read assemblers for prokaryote whole genome sequencing

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 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.

References 32

1. 1.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

2. 2.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

3. 3.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

4. 4.
   Pilon: An Integrated Tool for Comprehensive Microbial Variant Detection and Genome Assembly Improvement · 2014

   No notice
5. 5.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

6. 6.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

7. 7.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

8. 8.
   Insights from 20 years of bacterial genome sequencing · 2015

   No notice
9. 9.

   This reference’s wording can’t be shown under the paper’s licence.

   Not in our library

10. 10.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

11. 11.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

12. 12.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

13. 13.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

14. 14.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

15. 15.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

16. 16.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

17. 17.
    Current Strategies of Polyploid Plant Genome Sequence Assembly · 2018

    No notice
18. 18.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

19. 19.
    Canu: scalable and accurate long-read assembly via adaptive k -mer weighting and repeat separation · 2017

    No notice
20. 20.
    Completing bacterial genome assemblies with multiplex MinION sequencing · 2017

    No notice
21. 21.
    Performance of neural network basecalling tools for Oxford Nanopore sequencing · 2019

    No notice
22. 22.
    Unicycler: Resolving bacterial genome assemblies from short and long sequencing reads · 2017

    No notice
23. 23.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

24. 24.
    Comparison of long-read sequencing technologies in the hybrid assembly of complex bacterial genomes · 2019

    No notice
25. 25.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

26. 26.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

27. 27.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

28. 28.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

29. 29.
    Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomes · 2020

    No notice
30. 30.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

31. 31.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

32. 32.

    This reference’s wording can’t be shown under the paper’s licence.

    Not in our library

Cited by papers we hold 5

• Assembling the perfect bacterial genome using Oxford Nanopore and Illumina sequencing · 2023
  No notice
• Polypolish: Short-read polishing of long-read bacterial genome assemblies · 2022
  No notice
• Telomere length de novo assembly of all 7 chromosomes and mitogenome sequencing of the model entomopathogenic fungus, Metarhizium brunneum, by means of a novel assembly pipeline · 2021
  Not checked
• Highly contiguous assemblies of 101 drosophilid genomes · 2021
  Corrected
• Trycycler: consensus long-read assemblies for bacterial genomes · 2021
  No notice

Reads

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.