bioRxivBioinformaticsPreprint
WFA-GPU: Gap-affine pairwise alignment using GPUs
Quim Aguado-PuigiD, Max DoblasiD, Christos Matzoros, Antonio Espinosa, Juan Carlos MoureiD, Santiago Marco‐SolaiD, Miquel MoretóiD
Abstract
MotivationAdvances 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 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. ResultsThis paper presents the 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 between 1.5-7.7x and up to 17x 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. AvailabilityWFA-GPU code and documentation are publicly available at https://github.com/quim0/WFA-GPU. Contactquim.aguado@uab.cat
- assay: DNA methylation
- assay: whole-genome sequencing
- research focus: benchmarking
- research focus: software / tool
- approach: statistical model
- approach: experimental assay
- Citations
- 12
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Optimal gap-affine alignment in O(s) space
Santiago Marco‐Sola, Jordan M. Eizenga, … Miquel Moretó·BioinformaticsPeer-reviewed·Feb 1, 2023
- Accelign: a GPU-based Library for Accelerating Pairwise Sequence Alignment
Felix Kallenborn, Fawaz Dabbaghie, … Bertil Schmidt·BMC BioinformaticsPeer-reviewed·Jun 21, 2026
- Faster sequence alignment through GPU-accelerated restriction of the seed-and-extend search space
Richard Wilton, Tamas Budavari, … Alex Szalay·bioRxiv·Aug 1, 2014
- Singletrack: An Algorithm for Improving Memory Consumption and Performance of Gap-Affine Sequence Alignment
Lorién López‐Villellas, Cristian Iñiguez, … Santiago Marco‐Sola·BioinformaticsPeer-reviewed·Apr 10, 2026
- G-ALN: a GPU-accelerated BWA-aln algorithm for palaeogenomics
Muhammad Bilal Sharif, Krister Hedfors, … Love Dalén·bioRxiv·Oct 21, 2026
- Improving the time and space complexity of the WFA algorithm and generalizing its scoring
Jordan M. Eizenga, Benedict Paten·bioRxiv·Jan 12, 2022