Faster suffix tree construction with missing suffix links

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 407-415

  Cole, Richard ^a   Hariharan, Ramesh ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

GENERAL SITUATION; HIGH PROBABILITY; LINEAR-TIME ALGORITHMS; NODE DEGREE; PARAMETERIZED; PERFECT HASHING; SUFFIX LINK; SUFFIX-TREES; SUFFIX TREE CONSTRUCTION;

BACKPROPAGATION ALGORITHMS; COMPUTATION THEORY; ALGORITHMS; BACKPROPAGATION; PROBABILITY;

FORESTRY; TREES (MATHEMATICS);

EID: 0033690736     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335352     Document Type: Conference Paper

References (13)

1. B. Baker. A theory of parameterized pattern matching: Algorithms and applications. Proceedings of the 25th ACM Symposium on Theory of Computing, 1993, 71-80.
2. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F.M. auf der Heide, H. Rohnert, and R.E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. SIAM Journal on Computing, 23, 1994, 738-761.
3. M. Farach. Optimal suffix tree construction with large alphabets, Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, 1997, 137-143.
4. M.L. Fredman, J. Komlos and E. Szemeredi. Storing a sparse table with O(1) worst case access time, Journal of the ACM, 31, 1984, 538-544. (Pubitemid 15563701)
5. R. Giancarlo. A generalization of suffix trees to square matrices with applications, SIAM Journal of Computing, 1995, 520-562.
6. D. Gusfield. Algorithms on strings, trees and sequences. Cambridge University Press, 1997.
7. R. Karp and M. Rabin. Efficient Randomized Pattern Matching, IBM Journal of Research and Development, 1987.
8. D.K. Kim and K. Park. Linear time construction of 2-D suffix trees. Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, 1999.
9. E.M. McCreight. A space economical suffix tree construction algorithm, Journal of the Association of Computing Machinery, 2, 1976, 262-272.
10. A. Siegel. On universal classes of fast high performance hash functions, their time space trade-off, and their applications, Proceedings of the 30th IEEE Annual Symposium on Foundations of Computer Science, 1989, 20-25.
11. D. Sleator, R. Tarjan. A Data Structure for Dynamic Trees, Journal of Computer and System Sciences, 26, 1983, 362-391.
12. E. Ukkonen. Constructing suffix trees on-line in linear time, Proceedings of the IFIP 12th World Computer Congress, 1992, 484-492.
13. P. Weiner. Linear pattern matching algorithms, Proceedings of the 4th IEEE Annual Symposium on Switching and Automata Theory, 1973, 1-11.