DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI

被引:33
作者
Liu, Yongchao [1 ]
Schmidt, Bertil [1 ]
Maskell, Douglas L. [1 ]
机构
[1] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
关键词
SHORT DNA-SEQUENCES; ALGORITHM;
D O I
10.1186/1471-2105-12-85
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Next-generation sequencing technologies have led to the high-throughput production of sequence data (reads) at low cost. However, these reads are significantly shorter and more error-prone than conventional Sanger shotgun reads. This poses a challenge for the de novo assembly in terms of assembly quality and scalability for large-scale short read datasets. Results: We present DecGPU, the first parallel and distributed error correction algorithm for high-throughput short reads (HTSRs) using a hybrid combination of CUDA and MPI parallel programming models. DecGPU provides CPU-based and GPU-based versions, where the CPU-based version employs coarse-grained and fine-grained parallelism using the MPI and OpenMP parallel programming models, and the GPU-based version takes advantage of the CUDA and MPI parallel programming models and employs a hybrid CPU+GPU computing model to maximize the performance by overlapping the CPU and GPU computation. The distributed feature of our algorithm makes it feasible and flexible for the error correction of large-scale HTSR datasets. Using simulated and real datasets, our algorithm demonstrates superior performance, in terms of error correction quality and execution speed, to the existing error correction algorithms. Furthermore, when combined with Velvet and ABySS, the resulting DecGPU-Velvet and DecGPU-ABySS assemblers demonstrate the potential of our algorithm to improve de novo assembly quality for de-Bruijn-graph-based assemblers. Conclusions: DecGPU is publicly available open-source software, written in CUDA C++ and MPI. The experimental results suggest that DecGPU is an effective and feasible error correction algorithm to tackle the flood of short reads produced by next-generation sequencing technologies.
引用
收藏
页数:13
相关论文
共 30 条
[1]  
[Anonymous], OPENMP TUTORIAL
[2]  
[Anonymous], The message passing interface MPI standard
[3]  
Batzoglou S, 2002, GENOME RES, V12, P177, DOI 10.1101/gr.208902
[4]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[5]   ALLPATHS: De novo assembly of whole-genome shotgun microreads [J].
Butler, Jonathan ;
MacCallum, Iain ;
Kleber, Michael ;
Shlyakhter, Ilya A. ;
Belmonte, Matthew K. ;
Lander, Eric S. ;
Nusbaum, Chad ;
Jaffe, David B. .
GENOME RESEARCH, 2008, 18 (05) :810-820
[6]   Short read fragment assembly of bacterial genomes [J].
Chaisson, Mark J. ;
Pevzner, Pavel A. .
GENOME RESEARCH, 2008, 18 (02) :324-330
[7]   SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing [J].
Dohm, Juliane C. ;
Lottaz, Claudio ;
Borodina, Tatiana ;
Himmelbauer, Heinz .
GENOME RESEARCH, 2007, 17 (11) :1697-1706
[8]   Summary cache: A scalable wide-area Web cache sharing protocol [J].
Fan, L ;
Cao, P ;
Almeida, J ;
Broder, AZ .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2000, 8 (03) :281-293
[9]   The atlas genome assembly system [J].
Havlak, P ;
Chen, R ;
Durbin, KJ ;
Egan, A ;
Ren, YR ;
Song, XZ ;
Weinstock, GM ;
Gibbs, RA .
GENOME RESEARCH, 2004, 14 (04) :721-732
[10]   PCAP: A whole-genome assembly program [J].
Huang, XQ ;
Wang, JM ;
Aluru, S ;
Yang, SP ;
Hillier, L .
GENOME RESEARCH, 2003, 13 (09) :2164-2170