.png){kind=icon}
返回
PaKman: A Scalable Algorithm for Generating Genomic Contigs on Distributed Memory Machines
.png){kind=icon}
OA
AI
DOI：10.1109/TPDS.2020.3043241.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
De novo genome assembly is a fundamental problem in the field of bioinformatics, that aims to assemble the DNA sequence of an unknown genome from numerous short DNA fragments (aka reads) obtained from it. With the advent of high-throughput sequencing technologies, billions of reads can be generated in a matter of hours, necessitating efficient parallelization of the assembly process. While multiple parallel solutions have been proposed in the past, conducting a large-scale assembly at scale remains a challenging problem because of the inherent complexities associated with data movement, and irregular access footprints of memory and I/O operations. In this article, we present a novel algorithm, called PaKman, to address the problem of performing large-scale genome assemblies on a distributed memory parallel computer. Our approach focuses on improving performance through a combination of novel data structures and algorithmic strategies for reducing the communication and I/O footprint during the assembly process. PaKman presents a solution for the two most time-consuming phases in the full genome assembly pipeline, namely, k-mer counting and contig generation. A key aspect of our algorithm is its graph data structure (PaK-Graph), which comprises fat nodes (or what we call macro-nodes) that reduce the communication burden during contig generation. We present an extensive performance and qualitative evaluation of our algorithm across a wide range of genomes (varying in both size and species group), including comparisons to other state-of-the-art parallel assemblers. Our results demonstrate the ability to achieve near-linear speedups on up to 16K cores (tested) on the NERSC Cori supercomputer; perform better than or comparable to other state-of-the-art distributed memory and shared memory tools in terms of performance while delivering comparable (if not better) quality; and reduce time to solution significantly. For instance, PaKman is able to generate a high-quality set of assembled contigs for complex genomes such as the human and bread wheat genomes in under a minute on 16K cores. In addition, PaKman was able to successfully process a 3.1 TB simulated dataset of one of the largest known genomes (to date)-Ambystoma mexicanum (the axolotl), in just over 200 seconds on 16K cores.
Keyword:
Genome assembly
distributed memory
de bruijn graphs
k-mer counting
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
分享收藏分享收藏De novo assembly of human genomes with massively parallel short read sequencing通过大规模并行短读段测序对人类基因组进行从头组装.png)
GENOME RESEARCHOAAI
GENOME RESEARCHIF5.5
OAAI分享收藏Velvet: Algorithms for de novo short read assembly using de Bruijn graphsVelvet: 使用de Bruijn图进行从头短读组装的算法GENOME RESEARCH
OAAI
GENOME RESEARCHIF5.5
OAAI分享收藏
查看更多内容