Faster suffix tree construction with missing suffix links

SIAM Journal on Computing

Volumn 33, Issue 1, 2003, Pages 26-42

  Cole, Richard ^a   Hariharan, Ramesh ^b  

^a NEW YORK UNIVERSITY   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Dynamic perfect hashing; Parameterized strings; Suffix tree; Two dimensional suffix trees

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PARAMETER ESTIMATION; PROBABILITY; RANDOM PROCESSES; THEOREM PROVING;

DYNAMIC PERFECT HASHING; PARAMETERIZED STRINGS; SUFFIX LINKS; SUFFIX TREE;

DATA STRUCTURES;

EID: 1842459453     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701424465     Document Type: Article

References (16)

1. B. Baker, Parameterized pattern matching: Algorithms and applications, J. Comput. System Sci., 52 (1996), pp. 28-42.
2. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics, 23 (1952), pp. 493-507.
3. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, Dynamic perfect hashing: Upper and lower bounds, SIAM J. Comput., 23 (1994), pp. 738-761.
4. M. Dietzfelbinger and F. Meyer auf der Heide, A new universal class of hash functions and dynamic hashing in real time, in Proceedings of the 17th International Colloquium on Automata, Languages, and Programming, Warwick, England, 1990, pp. 6-19.
5. M. Farach, Optimal suffix tree construction with lage alphabets, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, FL, 1997, pp. 137-143.
6. M. L. Fredman, J. Komlos, and E. Szemerédi, Storing a sparse table with O(1) worst case access time, J. Assoc. Comput. Mach., 31 (1984), pp. 538-544.
7. R. Giancarlo, A generalization of the suffix tree to square matrices, with applications, SIAM J. Comput., 24 (1995), pp. 520-562.
8. D. Gusfield, Algorithms on Strings, Trees and Sequences, Cambridge University Press, Cambridge, UK, 1997.
9. R. Karp and M. Rabin, Efficient randomized pattern-matching algorithms, IBM J. Res. Develop., 31 (1987), pp. 249-260.
10. D. K. Kim and K. Park, Linear time construction of 2-d suffix trees. in Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, 1999, pp. 463-472.
11. S. R. Kosaraju, Faster algorithms for the construction of parameterized suffix trees, in Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 631-637.
12. E. M. McCreight, A space economical suffix tree construction algorithm. J. Assoc. Comput. Mach., 23 (1976), pp. 262-272.
13. A. Siegel, On universal classes of fast high performance hash functions, their time space trade-off, and their applications, in Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 20-25.
14. D. Sleator and R. Tarjan, A data structure for dynamic trees, J. Comput. System Sci., 26 (1983), pp. 362-391.
15. E. Ukkonen, On-line construction of suffix trees, Algorithmica, 14 (1995), pp. 249-260.
16. P. Weiner, Linear pattern matching algorithms, in Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Iowa City, IA, 1973, pp. 1-11.