ArticleBioinformatics (Oxford, England)2023
WFA-GPU: gap-affine pairwise read-alignment using GPUs.
Article in Bioinformatics (Oxford, England), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
11 citing papers in PubMed.
- Theseus: fast and optimal affine-gap sequence-to-graph alignment.Bioinformatics (Oxford, England) · 2026Article
- Accelign: a GPU-based library for accelerating pairwise sequence alignment.BMC bioinformatics · 2026Article
- Computational Tools and Resources for Long-read Metagenomic Sequencing Using Nanopore and PacBio.Genomics, proteomics & bioinformatics · 2025Review
- GPU-Accelerated Artificial Intelligence Applications in Cancer Diagnosis, Imaging, and Treatment Planning.Asian Pacific journal of cancer prevention : APJCP · 2025Review
- Fast noisy long read alignment with multi-level parallelism.BMC bioinformatics · 2025Article
- QuickEd: high-performance exact sequence alignment based on bound-and-align.Bioinformatics (Oxford, England) · 2025Article
- Taming large-scale genomic analyses via sparsified genomics.Nature communications · 2025Article
- BIMSA: accelerating long sequence alignment using processing-in-memory.Bioinformatics (Oxford, England) · 2024Article
- PROTAX-GPU: a scalable probabilistic taxonomic classification system for DNA barcodes.Philosophical transactions of the Royal Society of London. Series B, Biological sciences · 2024Article
- A survey of mapping algorithms in the long-reads era.Genome biology · 2023Review
- A framework for high-throughput sequence alignment using real processing-in-memory systems.Bioinformatics (Oxford, England) · 2023Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
7 authors.
Funding
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 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.
resultsThis 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.3× and up to 18.2× 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 29× 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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.