Sign in
BioinformaticsbioRxiv

Assembly of Long Error-Prone Reads Using de Bruijn Graphs

Yu LiniD, Jeffrey YuaniD, Mikhail KolmogoroviD, Max W. Shen, Pavel A. PevzneriD

Abstract

The recent breakthroughs in assembling long error-prone reads (such as reads generated by Single Molecule Real Time technology) were based on the overlap-layout-consensus approach and did not utilize the strengths of the alternative de Bruijn graph approach to genome assembly. Moreover, these studies often assume that applications of the de Bruijn graph approach are limited to short and accurate reads and that the overlap-layout-consensus approach is the only practical paradigm for assembling long error-prone reads. Below we show how to generalize de Bruijn graphs to assemble long error-prone reads and describe the ABruijn assembler, which results in more accurate genome reconstructions than the existing state-of-the-art algorithms.

02 /Specification & Classification

Click any tag to browse matching papers

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISKolmogorov '19Bankevich '22Prybol '24Tischler '17Turner '18Alipanahi '16
84% semantic matchBioinformatics
Mikhail Kolmogorov, Jeffrey Yuan, Yu Lin+1 more·Nature Biotechnology·Apr 1, 2019· 5,984 citations