@InProceedings{tatarnikov_et_al:LIPIcs.CPM.2023.26,
author = {Tatarnikov, Igor and Shahrabi Farahani, Ardavan and Kashgouli, Sana and Gagie, Travis},
title = {{MONI Can Find k-MEMs}},
booktitle = {34th Annual Symposium on Combinatorial Pattern Matching (CPM 2023)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-276-1},
ISSN = {1868-8969},
year = {2023},
volume = {259},
editor = {Bulteau, Laurent and Lipt\'{a}k, Zsuzsanna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2023.26},
URN = {urn:nbn:de:0030-drops-179802},
doi = {10.4230/LIPIcs.CPM.2023.26},
annote = {Keywords: Compact data structures, Burrows-Wheeler Transform, run-length compression, maximal exact matches}
}