Persistency in Suffix Trees with Applications to String Interval Problems.

@inproceedings{kopelowitz-2011-persistency, author = {Tsvi Kopelowitz and Moshe Lewenstein and Ely Porat}, editor = {Roberto Grossi and Fabrizio Sebastiani and Fabrizio Silvestri}, title = {{Persistency in Suffix Trees with Applications to String Interval Problems}}, booktitle = {{String Processing and Information Retrieval, 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings}}, series = {Lecture Notes in Computer Science}, volume = {7024}, pages = {67--80}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-24583-1_8}, doi = {https://doi.org/10.1007/978-3-642-24583-1_8} }