BioinformaticsBioinformaticsPeer-reviewed journal article
BIMSA: Accelerating Long Sequence Alignment Using Processing-In-Memory
Alejandro Alonso-MaríniD, Ivan FernandeziD, Quim Aguado-PuigiD, Juan Gómez-LunaiD, Santiago Marco‐SolaiD, Onur MutluiD, Miquel MoretóiD
Abstract
MotivationRecent advances in sequencing technologies have stressed the critical role of sequence analysis algorithms and tools in genomics and healthcare research. In particular, sequence alignment is a fundamental building block in many sequence analysis pipelines and is frequently a performance bottleneck both in terms of execution time and memory usage. Classical sequence alignment algorithms are based on dynamic programming and often require quadratic time and memory with respect to the sequence length. As a result, classical sequence alignment algorithms fail to scale with increasing sequence lengths and quickly become memory-bound due to data-movement penalties. ResultsProcessing-In-Memory (PIM) is an emerging architectural paradigm that seeks to accelerate memory-bound algorithms by bringing computation closer to the data to mitigate data-movement penalties. This work presents BIMSA (Bidirectional In-Memory Sequence Alignment), a PIM design and implementation for the state-of-the-art sequence alignment algorithm BiWFA (Bidirectional Wavefront Alignment), incorporating new hardware-aware optimizations for a production-ready PIM architecture (UPMEM). BIMSA supports aligning sequences up to 100K bases, exceeding the limitations of state-of-the-art PIM implementations. First, BIMSA achieves speedups up to 22.24x (11.95x on average) compared to state-of-the-art PIM-enabled implementations of sequence alignment algorithms. Second, achieves speedups up to 5.84x (2.83x on average) compared to the highest-performance multicore CPU implementation of BiWFA. Third, BIMSA exhibits linear scalability with the number of compute units in memory, enabling further performance improvements with upcoming PIM architectures equipped with more compute units and achieving speedups up to 9.56x (4.7x on average). AvailabilityCode and documentation are publicly available at https://github.com/AlejandroAMarin/BIMSA. Contactalejandro.alonso1@bsc.es
- Citations
- 14
- FWCI
- 4.34
- Field percentile
- top 5%
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
- QuickEd: High-performance exact sequence alignment based on bound-and-align
Max Doblas, Oscar Lostes-Cazorla, … Santiago Marco‐Sola·BioinformaticsPeer-reviewed·Mar 1, 2025
- BSAlign: a library for nucleotide sequence alignment
Haojing Shao, Jue Ruan·Genomics Proteomics & BioinformaticsPeer-reviewed·Mar 14, 2024
- 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
- BWA-MEME: BWA-MEM emulated with a machine learning approach
Youngmok Jung, Dongsu Han·BioinformaticsPeer-reviewed·Mar 3, 2022
- Sequence Alignment Through the Looking Glass
Raja Appuswamy, Jacques Fellay, Nimisha Chaturvedi·bioRxiv·Apr 11, 2018
- Optimal gap-affine alignment in O(s) space
Santiago Marco‐Sola, Jordan M. Eizenga, … Miquel Moretó·BioinformaticsPeer-reviewed·Feb 1, 2023