The suffix binary search tree and suffix AVL tree

Journal of Discrete Algorithms

Volumn 1, Issue 5-6, 2003, Pages 387-408

  Irving, Robert W ^a   Love, Lorna ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

AVL tree; Binary search tree; String searching; Suffix array; Suffix tree

Indexed keywords

EID: 21144435627     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1570-8667(03)00034-0     Document Type: Article

References (11)

1. A. Andersson, N.J. Larsson, K. Swanson, Suffix trees on words, Algorithmica 23 (1999) 246-260.
2. A. Apostolico, The myriad virtues of subword trees, in: A. Apostolico, Z. Galil (Eds.), Combinatorial Algorithms on Words, in: NATO ASI Ser., Vol. F12, Springer, Berlin, 1985, pp. 85-96.
3. M. Farach, P. Ferragina, S. Muthukrishnan, On the sorting complexity of suffix tree construction, J. Assoc. Comput. Mach. 47 (6) (2000) 987-1011.
4. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Computer Science and Computational Biology, Cambridge University Press, Cambridge, 1997.
5. R.W. Irving, L. Love, The suffix binary search tree and suffix AVL tree, Technical Report, Computing Science Department, University of Glasgow, Technical Report TR-2000-54, 2000.
6. S. Kurtz, Reducing the space requirement of suffix trees, Software Practice Experience 29 (1999) 1149-1171.
7. U. Manber, G. Myers, Suffix arrays: A new method for on-line string searches, SIAM J. Comput. 22 (5) (1993) 935-948.
8. E. McCreight, A space-economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (2) (1976) 262-272.
9. E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (3) (1995) 249-260.
10. G. Adel'son Velskii, E. Landis, An algorithm for the organisation of information, Dokl. Akad. Nauk SSSR 146 (1962) 263-266; English translation in Soviet Math. Dokl. 3.
11. P. Weiner, Linear pattern matching algorithms, in: Proceedings of the IEEE 14th Annual Symposium on Switching and Automata Theory, 1973, pp. 1-11.