Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries.
Maxime Crochemore|Costas S. Iliopoulos|Tomasz Kociumaka|Ritu Kundu|Solon P. Pissis|Jakub Radoszewski|Wojciech Rytter|Tomasz Walen
| Anthology ID: | DBLP:conf/spire/CrochemoreIKKPR16 |
|---|---|
| Volume: | String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings |
| Year: | 2016 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Pages: | 22-34 |
| URL: | https://doi.org/10.1007/978-3-319-46049-9_3 |
| DOI: | https://doi.org/10.1007/978-3-319-46049-9_3 |
| DBLP: | conf/spire/CrochemoreIKKPR16 |
| BibTeX: |
@inproceedings{crochemore-2016-nearoptimal,
author = {Maxime Crochemore and
Costas S. Iliopoulos and
Tomasz Kociumaka and
Ritu Kundu and
Solon P. Pissis and
Jakub Radoszewski and
Wojciech Rytter and
Tomasz Walen},
editor = {Shunsuke Inenaga and
Kunihiko Sadakane and
Tetsuya Sakai},
title = {{Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries}},
booktitle = {{String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {9954},
pages = {22--34},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-46049-9_3},
doi = {https://doi.org/10.1007/978-3-319-46049-9_3}
}