Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat. Persistency in Suffix Trees with Applications to String Interval Problems. In Roberto Grossi, Fabrizio Sebastiani 0001, Fabrizio Silvestri, editors, String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Volume 7024 of Lecture Notes in Computer Science, pages 67-80, Springer, 2011. [doi]
@inproceedings{KopelowitzLP11,
title = {Persistency in Suffix Trees with Applications to String Interval Problems},
author = {Tsvi Kopelowitz and Moshe Lewenstein and Ely Porat},
year = {2011},
doi = {10.1007/978-3-642-24583-1_8},
url = {http://dx.doi.org/10.1007/978-3-642-24583-1_8},
researchr = {https://researchr.org/publication/KopelowitzLP11},
cites = {0},
citedby = {0},
pages = {67-80},
booktitle = {String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings},
editor = {Roberto Grossi and Fabrizio Sebastiani 0001 and Fabrizio Silvestri},
volume = {7024},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-24582-4},
}