Smallest Suffixient Sets as a Repetitiveness Measure.
Gonzalo Navarro|Giuseppe Romana|Cristian Urbina
| Anthology ID: | DBLP:conf/spire/NavarroRU25 |
|---|---|
| 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: | 217-232 |
| URL: | https://doi.org/10.1007/978-3-032-05228-5_18 |
| DOI: | https://doi.org/10.1007/978-3-032-05228-5_18 |
| DBLP: | conf/spire/NavarroRU25 |
| BibTeX: |
@inproceedings{navarro-2025-smallest,
author = {Gonzalo Navarro and
Giuseppe Romana and
Cristian Urbina},
editor = {Golnaz Badkobeh and
Jakub Radoszewski and
Nicola Tonellotto and
Ricardo Baeza-Yates},
title = {{Smallest Suffixient Sets as a Repetitiveness Measure}},
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 = {217--232},
publisher = {Springer},
year = {2025},
url = {https://doi.org/10.1007/978-3-032-05228-5_18},
doi = {https://doi.org/10.1007/978-3-032-05228-5_18}
}