A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings.
Travis Gagie|Sana Kashgouli|Gonzalo Navarro
| Anthology ID: | DBLP:conf/spire/GagieKN23 |
|---|---|
| Volume: | String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings |
| Year: | 2023 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 246-252 |
| URL: | https://doi.org/10.1007/978-3-031-43980-3_19 |
| DOI: | https://doi.org/10.1007/978-3-031-43980-3_19 |
| DBLP: | conf/spire/GagieKN23 |
| BibTeX: |
@inproceedings{gagie-2023-simple,
author = {Travis Gagie and
Sana Kashgouli and
Gonzalo Navarro},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {{A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings}},
booktitle = {{String Processing and Information Retrieval - 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {14240},
pages = {246--252},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3_19},
doi = {https://doi.org/10.1007/978-3-031-43980-3_19}
}