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 Starter Packを購入 ナノポア製品の販売 シークエンスサービスプロバイダー グローバルディストリビューター

ナノポア技術

ナノポアの最新ニュースを購読 リソースと発表文献 Nanopore Communityとは

Oxford Nanoporeについて

ニュース 会社沿革 持続可能性 経営陣 メディアリソース & お問い合わせ先 投資家向け パートナー向け Oxford Nanopore社で働く 現在の募集状況 営業上の情報 BSI 27001 accreditationBSI 90001 accreditationBSI mark of trust
Japanese flag