Sequence alignment with k-bounded matching statistics
Tommi Mäklin, Jarno Alanko, Elena Biagi, Simon J. Puglisi
This paper introduces a novel algorithm for approximate local alignment search using k-bounded matching statistics, showing it is as fast and accurate as state-of-the-art tools in bacterial genomics tasks.
bioRxiv · May 19, 2025 · PreprintBioinformatics