Small World Asynchronous Parallel Model for Genome Assembly - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Small World Asynchronous Parallel Model for Genome Assembly


Large de bruijn graph based algorithm is widely used in genome assembly and metagenetic assembly. The scale of this kind of graphs - in some cases billions of vertices and edges - poses challenges to genome assembly problem. In this paper, a one-step bi-directed graph is used to abstract the problem of genome assembly. After that small world asynchronous parallel model (SWAP) is proposed to handle the edge merging operation predefined in the graph. SWAP aims at making use of the locality of computing and communication to explore parallelism for graph algorithm. Based on the above graph abstraction and SWAP model, an assembler is developed, and experiment results shows that a factor of 20 times speedup is achieved when the number of processors scales from 10 to 640 when testing on processing C.elegans data.
Fichier principal
Vignette du fichier
978-3-642-35606-3_17_Chapter.pdf (384.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01551319 , version 1 (30-06-2017)





Jintao Meng, Jianrui Yuan, Jiefeng Cheng, Yanjie Wei, Shengzhong Feng. Small World Asynchronous Parallel Model for Genome Assembly. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.145-155, ⟨10.1007/978-3-642-35606-3_17⟩. ⟨hal-01551319⟩
34 View
67 Download



Gmail Facebook Twitter LinkedIn More