Assembly of long, error-prone reads using repeat graphs

By Mikhail Kolmogorov, Jeffrey Yuan, Yu Lin, Pavel A. Pevzner. Nature Biotechnology, 2018

4,871 citations recorded by the source corpus.

Accurate genome assembly is hampered by repetitive regions. Although long single molecule sequencing reads are better able to resolve genomic repeats than short-read data, most long-read assembly algorithms do not provide the repeat characterization necessary for producing optimal assemblies. Here, we present Flye, a long-read assembly algorithm that generates arbitrary paths in an unknown repeat graph, called disjointigs, and constructs an accurate repeat graph from these error-riddled disjointigs. We benchmark Flye against five state-of-the-art assemblers and show that it generates better or comparable assemblies, while being an order of magnitude faster. Flye nearly doubled the contiguity of the human genome assembly (as measured by the NGA50 assembly quality metric) compared with existing assemblers. Flye improves the speed and accuracy of genome assembly by using repeat graphs to resolve repeat regions.

Subfields: Molecular Biology, Plant Science

View Paper: https://www.semanticscholar.org/paper/e0f860a608ecfb4ac6d0010e16db5c13cca14da1

How researchers see this paper

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

In Molecular Biology

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

In Plant Science

  1. Heng Li
  2. Sergey Koren
  3. Adam M. Phillippy
  4. Mihai Pop
  5. Steven L. Salzberg
  6. Michael C. Schatz
  7. Pavel A. Pevzner
  8. Brian Walenz

Citations in the corpus