The suffix tree of a tree and minimizing sequential transducers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1075, Issue , 1996, Pages 116-129

  Breslauer, Dany ^a  

^a AALBORG UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLUSTERING ALGORITHMS; FORESTRY; PATTERN MATCHING; TRANSDUCERS;

LINEAR-TIME ALGORITHMS; SEQUENTIAL TRANSDUCERS; SUFFIX-TREES;

TREES (MATHEMATICS);

EID: 0347431992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_10     Document Type: Conference Paper

References (19)

1. A. V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974.
2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows. Prentice Hall, Englewood Cliffs, NJ, 1993.
3. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, and R.E. Tarjan. Faster Algorithms for the Shortest Path Problem. J. Assoc. Comput. Mach., 37(2):213-223, 1990.
4. A. Amir, M. Farach, R.M. Idury, J.A. La Poutré, and A.A. Schäffer. Improved Dynamic Dictionary-Matching. In Proc. 4th ACM-SIAM Symp. on Discrete Algorithms, pages 392-401, 1993.
5. A. Apostolico. The Myriad Virtues of Subword Trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO ASI Series F, pages 85-96. Springer-Verlag, Berlin, Germany, 1985.
6. O. Berkman and U. Vishkin. Finding Level-Ancestors in Trees. J. Comput. System Sci., 48:214-230, 1994.
7. M.T. Chen and J. Seiferas. Efficient and elegant subword-tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume 12 of NATO ASI Series F, pages 97-107. Springer-Verlag, Berlin, Germany, 1985.
8. R. Dial. Algorithm 360: Shortest path forest with topological ordering. Comm, of the ACM, 12:632-633, 1969.
9. R. Grossi and G.F. Italiano. Suffix Trees and their Applications in String Algorithms. Manuscript, 1995.
10. D. Harel and R.E. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM J. Comput., 13:338-355, 1984.
11. M. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, MA, U.S.A., 1978.
12. J.E. Hopcroft. An nlogn algorithm for minimizing states in a finite automaton. In Z. Kohavi and A. Paz, editors, Theory of Machines and Computation, pages 189-196. Academic Press, New York, U.S.A., 1971.
13. S.R. Kosaraju. Fast Pattern Matching in Trees. In Proc. 30th IEEE Symp. on Foundations of Computer Science, pages 178-183, 1989.
14. E.M. McCreight. A space economical suffix tree construction algorithm. J. Assoc. Comput. Mach., 23:262-272, 1976.
15. M. Mohri. Minimization of Sequential Transducers. In Proc. 5th Symp. on Combinatorial Pattern Matching, number 807 in Lecture Notes in Computer Science, pages 151-163. Springer-Verlag, Berlin, Germany, 1994.
16. B. Schieber and U. Vishkin. On finding Lowest common ancestors: simplification and parallelization. SIAM J. Comput., 17(6):1253-1262, 1988.
17. M. Thorup. An O(loglogn) Priority Queue. Manuscript, 1995.
18. P. Weiner. Linear pattern matching algorithms. In Proc. 14th Symposium on Switching and Automata Theory, pages 1-11, 1973.
19. J. Westbrook. Fast Incremental Planarity Testing. In Proc. 19th International Colloquium on Automata, Languages, and Programming, number 623 in Lecture Notes in Computer Science, pages 342-353. Springer-Verlag, Berlin, Germany, 1992.