Efficient Computation of Closed Substrings.
Samkith K. Jain|Neerja Mhaskar
| Anthology ID: | DBLP:conf/spire/JainM25 |
|---|---|
| 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: | 172-187 |
| URL: | https://doi.org/10.1007/978-3-032-05228-5_15 |
| DOI: | https://doi.org/10.1007/978-3-032-05228-5_15 |
| DBLP: | conf/spire/JainM25 |
| BibTeX: |
@inproceedings{jain-2025-efficient,
author = {Samkith K. Jain and
Neerja Mhaskar},
editor = {Golnaz Badkobeh and
Jakub Radoszewski and
Nicola Tonellotto and
Ricardo Baeza-Yates},
title = {{Efficient Computation of Closed Substrings}},
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 = {172--187},
publisher = {Springer},
year = {2025},
url = {https://doi.org/10.1007/978-3-032-05228-5_15},
doi = {https://doi.org/10.1007/978-3-032-05228-5_15}
}