Main menu

Assembly of long, error-prone reads using repeat graphs


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.

Authors: Mikhail Kolmogorov, Jeffrey Yuan, Yu Lin, Pavel A. Pevzner

入门指南

购买 MinION 启动包 Nanopore 商城 测序服务提供商 全球代理商

联系我们

Intellectual property Cookie policy Corporate reporting Privacy policy Terms & conditions Accessibility

关于 Oxford Nanopore

Contact us 领导团队 媒体资源和联系方式 投资者 在 Oxford Nanopore 工作 BSI 27001 accreditationBSI 90001 accreditationBSI mark of trust
Chinese flag