TY - JOUR T1 - Assembly of Long Error-Prone Reads Using de Bruijn Graphs JF - bioRxiv DO - 10.1101/048413 SP - 048413 AU - Yu Lin AU - Jeffrey Yuan AU - Mikhail Kolmogorov AU - Max W. Shen AU - Pavel A. Pevzner Y1 - 2016/01/01 UR - http://biorxiv.org/content/early/2016/04/13/048413.abstract N2 - 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. ER -