Compact Data Structures for Shortest Unique Substring Queries.
Takuya Mieno|Dominik Köppl|Yuto Nakashima|Shunsuke Inenaga|Hideo Bannai|Masayuki Takeda
| Anthology ID: | DBLP:conf/spire/MienoKNIBT19 |
|---|---|
| Volume: | String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings |
| Year: | 2019 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 107-123 |
| URL: | https://doi.org/10.1007/978-3-030-32686-9_8 |
| DOI: | https://doi.org/10.1007/978-3-030-32686-9_8 |
| DBLP: | conf/spire/MienoKNIBT19 |
| BibTeX: |
@inproceedings{mieno-2019-compact,
author = {Takuya Mieno and
Dominik K\"{o}ppl and
Yuto Nakashima and
Shunsuke Inenaga and
Hideo Bannai and
Masayuki Takeda},
editor = {Nieves R. Brisaboa and
Simon J. Puglisi},
title = {{Compact Data Structures for Shortest Unique Substring Queries}},
booktitle = {{String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {11811},
pages = {107--123},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-32686-9_8},
doi = {https://doi.org/10.1007/978-3-030-32686-9_8}
}