Constructing the Suffix Tree of a Tree with a Large Alphabet

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 5, 2003, Pages 1061-1066

  Shibuya, Tetsuo ^a  

^a IBM RESEARCH TOKYO   (Japan)

Author keywords

Algorithm; Common suffix tree; Integer alphabet; Suffix tree; Tree pattern matching

Indexed keywords

ALGORITHMS; DATA STRUCTURES; TRANSDUCERS;

SUFFIX TREES;

TREES (MATHEMATICS);

EID: 0142007208     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. A. Apostolico and Z. Galil, eds., Pattern Matching Algorithms, Oxford University Press, New York, 1997.
2. S. Alstrup and J. Holm, "Improved algorithms for finding level ancestors in dynamic trees," Proc. 27th International Colloquium on Automata, Languages, and Programming, LNCS 1853, pp.73-84, 2000.
3. O. Berkman and U. Vishkin, "Finding level-ancestors in trees," J. Comput. Syst. Sci., vol.48, pp.214-230, 1994.
4. D. Breslauer, "The suffix tree of a tree and minimizing sequential transducers," Theoretical Computer Science, vol.191, pp.131-144, 1998.
5. M.T. Chen and J. Seiferas, "Efficient and elegant subword tree construction," in Combinatorial Algorithms on Words, ed. A. Apostolico and Z. Galil, Chapter 12, pp.97-107, NATO ASI Series F: Computer and System Sciences, 1985.
6. 3 n)-time," Proc. 4th Symposium on Discrete Algorithms, pp.245-254, 1999.
7. P. Dietz, "Finding level-ancestors in dynamic trees," Proc. 2nd Workshop on Algorithms and Data Structures, LNCS 1097, pp.32-40, 1991.
8. M. Farach, "Optimal suffix tree construction with large alphabets," Proc. 38th IEEE Symp. Foundations of Computer Science, pp.137-143, 1997.
9. M. Farach and S. Muthukrishnan, "Optimal logarithmic time randomized suffix tree construction," Proc. 23rd International Colloquium on Automata, Languages, and Programming, pp.550-561, 1996.
10. R. Giancarlo, "The suffix tree of a square matrix, with applications," Proc. 4th Symposium on Discrete Algorithms, pp.402-411, 1993.
11. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology, Cambridge University Press, 1997.
12. D. Harel and R.R. Tarjan, "Fast algorithms for finding nearest common ancestors," SIAM J. Comput., vol.13, pp.338-355, 1984.
13. D.K. Kim and K. Park, "Linear time construction of 2-D suffix trees," Proc. 26th International Colloquium on Automata, Languages, and Programming, pp.463-472, 1999.
14. S.R. Kosaraju, "Efficient tree pattern matching," Proc. 30th IEEE Symp. Foundations of Computer Science, pp. 178-183, 1989.
15. E.M. McCreight, "A space-economical suffix tree construction algorithm," J. ACM, vol.23, pp.262-272, 1976.
16. T. Shibuya, "Constructing the suffix tree of a tree with a large alphabet," Proc. 10th Annual International Symposium on Algorithms and Computation, LNCS 1741, pp.225-236, 1999.
17. E. Ukkonen, "On-line construction of suffix-trees," Algorithmica, vol.14, pp.249-260, 1995.
18. P. Weiner, "Linear pattern matching algorithms," Proc. 14th Symposium on Switching and Automata Theory, pp.1-11, 1973.