b-move: faster lossless approximate pattern matching in a run-length compressed index
b-move proves practical and scalable for pan-genome indexing and querying. We provide a C++ implementation of b-move, supporting efficient lossless approximate pattern matching including locate functionality, available at https://github.com/biointec/b-move under the AGPL-3.0 license.
Authors
- Luca Renders (ORCID: https://orcid.org/0000-0002-2244-1427)
- Travis Gagie (ORCID: https://orcid.org/0000-0003-3689-327X)
- Jan Fostier (ORCID: https://orcid.org/0000-0002-9994-8269)
- Lore Depuydt (ORCID: https://orcid.org/0000-0001-8517-0479)
- Simon Van de Vyver (ORCID: https://orcid.org/0009-0009-7810-2174)
- Lennart Veys
Institutions
- HOGENT University of Applied Sciences and Arts (BE)
- Dalhousie University (CA)
- Ghent University (BE)
Publication Details
- Journal
- Algorithms for Molecular Biology
- Published
- 2025-08-12
- DOI
- https://doi.org/10.1186/s13015-025-00281-x
- Citations
- 1
- Primary Topic
- Algorithms and Data Compression
- Type
- article
- Field-Weighted Citation Impact
- 2.48
Funders
- Fonds Wetenschappelijk Onderzoek
- Vlaamse regering
- National Institutes of Health
- Natural Sciences and Engineering Research Council of Canada