Tight Bound for the Number of Distinct Palindromes in a Tree.
Pawel Gawrychowski|Tomasz Kociumaka|Wojciech Rytter|Tomasz Walen
| Anthology ID: | DBLP:conf/spire/GawrychowskiKRW15 |
|---|---|
| Volume: | String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings |
| Year: | 2015 |
| Venue: | Symposium on String Processing and Information Retrieval (SPIRE) |
| Publisher: | Springer |
| Pages: | 270-276 |
| URL: | https://doi.org/10.1007/978-3-319-23826-5_26 |
| DOI: | https://doi.org/10.1007/978-3-319-23826-5_26 |
| DBLP: | conf/spire/GawrychowskiKRW15 |
| BibTeX: |
@inproceedings{gawrychowski-2015-tight,
author = {Pawel Gawrychowski and
Tomasz Kociumaka and
Wojciech Rytter and
Tomasz Walen},
editor = {Costas S. Iliopoulos and
Simon J. Puglisi and
Emine Yilmaz},
title = {{Tight Bound for the Number of Distinct Palindromes in a Tree}},
booktitle = {{String Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, Proceedings}},
series = {Lecture Notes in Computer Science},
volume = {9309},
pages = {270--276},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-23826-5_26},
doi = {https://doi.org/10.1007/978-3-319-23826-5_26}
}