b-move: faster lossless approximate pattern matching in a run-length compressed index

b-move: faster lossless approximate pattern matching in a run-length compressed index

Abstract Background Due to the increasing availability of high-quality genome sequences, pan-genomes are gradually replacing single consensus reference genomes in many bioinformatics pipelines to better capture genetic diversity. Traditional bioinformatics tools using the FM-index face memory limita...

Full description

Saved in:
Bibliographic Details
Main Authors: Lore Depuydt, Luca Renders, Simon Van de Vyver, Lennart Veys, Travis Gagie, Jan Fostier
Format: Article
Language:English
Published: BMC 2025-08-01
Series:Algorithms for Molecular Biology
Subjects:
Pan-genomics
FM-index
r-index
Move structure
Bidirectional search
Approximate pattern matching
Online Access:https://doi.org/10.1186/s13015-025-00281-x
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://doi.org/10.1186/s13015-025-00281-x

Similar Items