摘要 We describe a new approach to assemble 基因組s from

本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。

原文連結

• SFI 頁面
• DOI

論文資訊

• 類型：已發表論文
• 日期：2020-02-08

摘要

We describe a new approach to assemble 基因組s from a combination of low-coverage short and long reads. LazyBastard starts from a bipartite overlap graph between long reads and restrictively filtered short-read unitigs, which are then reduced to a long-read overlap graph G. Edges are removed from G to obtain first a consistent orientation and then a DAG. Using heuristics based on properties of proper interval graphs, contigs are extracted as maximum weight paths. These are translated into genomic sequence only in the final step. A prototype implementation of LazyBastard, entirely written in Python, not only yields significantly more accurate assemblies of the yeast and fruit fly 基因組s compared to state-of-the-art pipelines but also requires much less 計算 effort.

※ 此為已發表論文，全文需透過期刊付費取得