Parallelizing Big De Bruijn Graph Traversal for Genome Assembly on GPU Clusters

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

De Bruijn graph traversal is a critical step in de novo assemblers. It uses the graph structure to analyze genome sequences and is both memory space intensive and time consuming. To improve the efficiency, we develop ParaGraph, which parallelizes De Bruijn graph traversal on a cluster of GPU-equipped computer nodes. With effective vertex partitioning and fine-grained parallel algorithms, ParaGraph utilizes all cores of each CPU and GPU, all CPUs and GPUs in a computer node, and all computer nodes of a cluster. Our results show that ParaGraph is able to traverse billion-node graphs within three minutes on a cluster of six GPU-equipped computer nodes. It is an order of magnitude faster than the state-of-the-art shared memory based assemblers, and more than five times faster than the current distributed assemblers.

Cite

CITATION STYLE

APA

Qiu, S., Feng, Z., & Luo, Q. (2019). Parallelizing Big De Bruijn Graph Traversal for Genome Assembly on GPU Clusters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11448 LNCS, pp. 466–470). Springer Verlag. https://doi.org/10.1007/978-3-030-18590-9_68

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free