Persistency in Suffix Trees with Applications to String Interval Problems

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.