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

By Sergey Koren, Brian Walenz, Konstantin Berlin, Jason Rafe Miller, Nicholas H. Bergman, Adam M. Phillippy. bioRxiv, 2016

6,453 citations recorded by the source corpus.

Long-read single-molecule sequencing has revolutionized de novo genome assembly and enabled the automated reconstruction of reference-quality genomes. However, given the relatively high error rates of such technologies, efficient and accurate assembly of large repeats and closely related haplotypes remains challenging. We address these issues with Canu, a successor of Celera Assembler that is specifically designed for noisy single-molecule sequences. Canu introduces support for nanopore sequencing, halves depth-of-coverage requirements, and improves assembly continuity while simultaneously reducing runtime by an order of magnitude on large genomes versus Celera Assembler 8.2. These advances result from new overlapping and assembly algorithms, including an adaptive overlapping strategy based on tf-idf weighted MinHash and a sparse assembly graph construction that avoids collapsing diverged repeats and haplotypes. We demonstrate that Canu can reliably assemble complete microbial genomes and near-complete eukaryotic chromosomes using either PacBio or Oxford Nanopore technologies, and achieves a contig NG50 of greater than 21 Mbp on both human and Drosophila melanogaster PacBio datasets. For assembly structures that cannot be linearly represented, Canu provides graph-based assembly outputs in graphical fragment assembly (GFA) format for analysis or integration with complementary phasing and scaffolding techniques. The combination of such highly resolved assembly graphs with long-range scaffolding information promises the complete and automated assembly of complex genomes.

Subfields: Artificial Intelligence, Computer Networks and Communications, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/2b59fd18ada769ef76fb7fcc7382f063791abfab

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Heng Li
  2. Steven L. Salzberg
  3. Richard Durbin
  4. Mihai Pop
  5. Michael C. Schatz
  6. Fritz J. Sedlazeck
  7. Sergey Koren
  8. Adam M. Phillippy

In Computer Networks and Communications

  1. Jay Shendure
  2. Richard Durbin
  3. Mihai Pop
  4. Steven L. Salzberg
  5. Pavel A. Pevzner
  6. Michael C. Schatz
  7. Sergey Nurk
  8. Heng Li

In Molecular Biology

  1. Steven L. Salzberg
  2. Heng Li
  3. Sergey Koren
  4. Michael C. Schatz
  5. Adam M. Phillippy
  6. Mihai Pop
  7. Kathryn E. Holt
  8. Ryan R. Wick

Citations in the corpus