Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time.
| Anthology ID: | DBLP:conf/spire/OhlebuschB14 |
|---|---|
| Volume: | String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings |
| Year: | 2014 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 117-128 |
| URL: | https://doi.org/10.1007/978-3-319-11918-2_12 |
| DOI: | https://doi.org/10.1007/978-3-319-11918-2_12 |
| DBLP: | conf/spire/OhlebuschB14 |
| BibTeX: |
@inproceedings{ohlebusch-2014-alphabetindependent,
author = {Enno Ohlebusch and
Timo Beller},
editor = {Edleno Silva de Moura and
Maxime Crochemore},
title = {{Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time}},
booktitle = {{String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {8799},
pages = {117--128},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-11918-2_12},
doi = {https://doi.org/10.1007/978-3-319-11918-2_12}
}