Author:
Mondal Kartick Chandra,Ankur Paul ,Anindita Sarkar
Reference16 articles.
1. M. Kay, Suffix Trees, Stanford University, 2004.
2. P. Weiner, Linear Pattern Matching Algorithms, SWAT 73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory, Pages: 1–11, 1973.
3. R. Giegerich and S. Kurtz, From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction, Algorithmica 19, Pages: 331–353, 1997.
4. L. M. S. Russo, G. Navarro and A. L. Oliveira, Fully-Compressed Suffix Trees, LATIN, Vol. 4957, LNCS, Pages: 362–373, 2008.
5. L. Colussi and A. De Col, A time and space efficient data structure for string searching on large texts, Inf. Process. Lett. 58(5), Pages: 217–222, 1996.