On the Computation of Longest Previous Non-overlapping Factors.
| Anthology ID: | DBLP:conf/spire/OhlebuschW19 |
|---|---|
| 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: | 372-381 |
| URL: | https://doi.org/10.1007/978-3-030-32686-9_26 |
| DOI: | https://doi.org/10.1007/978-3-030-32686-9_26 |
| DBLP: | conf/spire/OhlebuschW19 |
| BibTeX: |
@inproceedings{ohlebusch-2019-computation,
author = {Enno Ohlebusch and
Pascal Weber},
editor = {Nieves R. Brisaboa and
Simon J. Puglisi},
title = {{On the Computation of Longest Previous Non-overlapping Factors}},
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 = {372--381},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-32686-9_26},
doi = {https://doi.org/10.1007/978-3-030-32686-9_26}
}