b-move: faster lossless approximate pattern matching in a run-length compressed index.
Saved in:
| Title: | b-move: faster lossless approximate pattern matching in a run-length compressed index. |
|---|---|
| Authors: | Depuydt, Lore1 (AUTHOR) Lore.Depuydt@UGent.be, Renders, Luca1 (AUTHOR) Luca.Renders@UGent.be, Van de Vyver, Simon2 (AUTHOR) simon.vandevyver@ugent.be, Veys, Lennart2 (AUTHOR) lennart.veys@ugent.be, Gagie, Travis3 (AUTHOR) travis.gagie@gmail.com, Fostier, Jan1 (AUTHOR) Jan.Fostier@UGent.be |
| Source: | Algorithms for Molecular Biology. 8/12/2025, Vol. 20 Issue 1, p1-19. 19p. |
| Database: | Academic Search Ultimate |
|
Full text is not displayed to guests.
Login for full access.
|
|
| ISSN: | 17487188 |
|---|---|
| DOI: | 10.1186/s13015-025-00281-x |