Computing the Longest Unbordered Substring.

Pawel Gawrychowski|Gregory Kucherov|Benjamin Sach|Tatiana Starikovskaya


Anthology ID:DBLP:conf/spire/GawrychowskiKSS15
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:246-257
URL:https://doi.org/10.1007/978-3-319-23826-5_24
DOI:https://doi.org/10.1007/978-3-319-23826-5_24
DBLP:conf/spire/GawrychowskiKSS15
BibTeX:
@inproceedings{gawrychowski-2015-computing, author = {Pawel Gawrychowski and Gregory Kucherov and Benjamin Sach and Tatiana Starikovskaya}, editor = {Costas S. Iliopoulos and Simon J. Puglisi and Emine Yilmaz}, title = {{Computing the Longest Unbordered Substring}}, 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 = {246--257}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-23826-5_24}, doi = {https://doi.org/10.1007/978-3-319-23826-5_24} }