WFA-GPU: gap-affine pairwise read-alignment using GPUs

被引:13
作者
Aguado-Puig, Quim [1 ]
Doblas, Max [2 ]
Matzoros, Christos [2 ]
Espinosa, Antonio [1 ]
Moure, Juan Carlos [1 ]
Marco-Sola, Santiago [2 ,3 ]
Moreto, Miquel [2 ,3 ]
机构
[1] Univ Autonoma Barcelona, Dept Arquitectura Comp & Sist Operatius, Barcelona 08193, Spain
[2] Barcelona Supercomp Ctr, Comp Sci Dept, Barcelona 08034, Spain
[3] Univ Politecn Cataluna, Dept Arquitectura Comp, Barcelona 08034, Spain
关键词
SPEED-UP; SEQUENCE; ALGORITHM; ACCURATE;
D O I
10.1093/bioinformatics/btad701
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation Advances in genomics and sequencing technologies demand faster and more scalable analysis methods that can process longer sequences with higher accuracy. However, classical pairwise alignment methods, based on dynamic programming (DP), impose impractical computational requirements to align long and noisy sequences like those produced by PacBio and Nanopore technologies. The recently proposed wavefront alignment (WFA) algorithm paves the way for more efficient alignment tools, improving time and memory complexity over previous methods. However, high-performance computing (HPC) platforms require efficient parallel algorithms and tools to exploit the computing resources available on modern accelerator-based architectures.Results This paper presents WFA-GPU, a GPU (graphics processing unit)-accelerated tool to compute exact gap-affine alignments based on the WFA algorithm. We present the algorithmic adaptations and performance optimizations that allow exploiting the massively parallel capabilities of modern GPU devices to accelerate the alignment computations. In particular, we propose a CPU-GPU co-design capable of performing inter-sequence and intra-sequence parallel sequence alignment, combining a succinct WFA-data representation with an efficient GPU implementation. As a result, we demonstrate that our implementation outperforms the original multi-threaded WFA implementation by up to 4.3x and up to 18.2x when using heuristic methods on long and noisy sequences. Compared to other state-of-the-art tools and libraries, the WFA-GPU is up to 29x faster than other GPU implementations and up to four orders of magnitude faster than other CPU implementations. Furthermore, WFA-GPU is the only GPU solution capable of correctly aligning long reads using a commodity GPU.Availability and implementation WFA-GPU code and documentation are publicly available at https://github.com/quim0/WFA-GPU.
引用
收藏
页数:10
相关论文
共 42 条
[1]   GPU acceleration of Darwin read overlapper for de novo assembly of long DNA reads [J].
Ahmed, Nauman ;
Qiu, Tong Dong ;
Bertels, Koen ;
Al-Ars, Zaid .
BMC BIOINFORMATICS, 2020, 21 (Suppl 13)
[2]   GASAL2: a GPU accelerated sequence alignment library for high-throughput NGS data [J].
Ahmed, Nauman ;
Levy, Jonathan ;
Ren, Shanshan ;
Mushtaq, Hamid ;
Bertels, Koen ;
Al-Ars, Zaid .
BMC BIOINFORMATICS, 2019, 20 (01)
[3]   Shouji: a fast and efficient pre-alignment filter for sequence alignment [J].
Alser, Mohammed ;
Hassan, Hasan ;
Kumar, Akash ;
Mutlu, Onur ;
Alkan, Can .
BIOINFORMATICS, 2019, 35 (21) :4255-4263
[4]   GateKeeper: a new hardware architecture for accelerating pre-alignment in DNA short read mapping [J].
Alser, Mohammed ;
Hassan, Hasan ;
Xin, Hongyi ;
Ergin, Oguz ;
Mutlu, Onur ;
Alkan, Can .
BIOINFORMATICS, 2017, 33 (21) :3355-3363
[5]   ADEPT: a domain independent sequence alignment strategy for gpu architectures [J].
Awan, Muaaz G. ;
Deslippe, Jack ;
Buluc, Aydin ;
Selvitopi, Oguz ;
Hofmeyr, Steven ;
Oliker, Leonid ;
Yelick, Katherine .
BMC BIOINFORMATICS, 2020, 21 (01)
[6]  
Baeza-Yates R, 1989, Efficient text searching
[7]  
Baeza-Yates R. A., 1992, P IFIP 12 WORLD COMP, V1, P465
[8]   Thread-cooperative, Bit-parallel Computation of Levenshtein Distance on GPU [J].
Chacon, Alejandro ;
Marco-Sola, Santiago ;
Espinosa, Antonio ;
Ribeca, Paolo ;
Carlos Moure, Juan .
PROCEEDINGS OF THE 28TH ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, (ICS'14), 2014, :103-112
[9]   Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments [J].
Daily, Jeff .
BMC BIOINFORMATICS, 2016, 16
[10]   SeqAn An efficient, generic C++ library for sequence analysis [J].
Doering, Andreas ;
Weese, David ;
Rausch, Tobias ;
Reinert, Knut .
BMC BIOINFORMATICS, 2008, 9 (1)