Modern genome assembly projects are often based on long reads in an attempt to

bridge longer repeats. However, due to the higher error rate of the currentlong read sequencers, assemblers based on de Bruijn graphs do not work well inthis setting, and the approaches that do work are slower.

In this episode, Mikhail Kolmogorov from

Pavel Pevzner’s lab joins us to talk about some of the ideas developed in thelab that made it possible to build a de Bruijn-like assembly graph from noisyreads. These ideas are now implemented in the Flye assembler, which performsmuch faster than the existing long read assemblers without sacrificing thequality of the assembly.

Links:

• Assembly of Long Error-Prone Reads Using Repeat Graphs (Mikhail Kolmogorov,
  Jeffrey Yuan, Yu Lin, Pavel. A. Pevzner.
  Nature Biotechnology
  (paywalled),
  bioRxiv
• Flye on GitHub