Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph.
Hiroki Arimura|Shunsuke Inenaga|Yasuaki Kobayashi|Yuto Nakashima|Mizuki Sue
| Anthology ID: | DBLP:conf/spire/ArimuraIKNS23 |
|---|---|
| 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: | 28-34 |
| URL: | https://doi.org/10.1007/978-3-031-43980-3_3 |
| DOI: | https://doi.org/10.1007/978-3-031-43980-3_3 |
| DBLP: | conf/spire/ArimuraIKNS23 |
| BibTeX: |
@inproceedings{arimura-2023-optimally,
author = {Hiroki Arimura and
Shunsuke Inenaga and
Yasuaki Kobayashi and
Yuto Nakashima and
Mizuki Sue},
editor = {Franco Maria Nardini and
Nadia Pisanti and
Rossano Venturini},
title = {{Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph}},
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 = {28--34},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-43980-3_3},
doi = {https://doi.org/10.1007/978-3-031-43980-3_3}
}