KeBaB: k-mer Based Breaking for Finding Long MEMs.

Nathaniel K. Brown|Lore Depuydt|Mohsen Zakeri|Anas Alhadi|Nour Allam|Dove Begleiter|Nithin Bharathi Kabilan Karpagavalli|Suchith Sridhar Khajjayam|Hamza Wahed|Travis Gagie|Ben Langmead


Anthology ID:DBLP:conf/spire/BrownDZAABKKWGL25
Volume:String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings
Year:2025
Venue:Symposium on String Processing and Information Retrieval (SPIRE)
Publisher:Springer
Pages:10-17
URL:https://doi.org/10.1007/978-3-032-05228-5_2
DOI:https://doi.org/10.1007/978-3-032-05228-5_2
DBLP:conf/spire/BrownDZAABKKWGL25
BibTeX:
@inproceedings{brown-2025-kebab, author = {Nathaniel K. Brown and Lore Depuydt and Mohsen Zakeri and Anas Alhadi and Nour Allam and Dove Begleiter and Nithin Bharathi Kabilan Karpagavalli and Suchith Sridhar Khajjayam and Hamza Wahed and Travis Gagie and Ben Langmead}, editor = {Golnaz Badkobeh and Jakub Radoszewski and Nicola Tonellotto and Ricardo Baeza-Yates}, title = {{KeBaB: k-mer Based Breaking for Finding Long MEMs}}, booktitle = {{String Processing and Information Retrieval - 32nd International Symposium, SPIRE 2025, London, UK, September 8-11, 2025, Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {16073}, pages = {10--17}, publisher = {Springer}, year = {2025}, url = {https://doi.org/10.1007/978-3-032-05228-5_2}, doi = {https://doi.org/10.1007/978-3-032-05228-5_2} }