Optimal logarithmic time randomized suffix tree construction

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

Volumn 1099, Issue , 1996, Pages 550-561

  Farach, Martin ^a   Muthukrishnant, S ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; BINARY TREES; FORESTRY; PATTERN MATCHING;

BINARY ALPHABETS; BINARY STRING; COMBINATORIAL PATTERN MATCHING; HIGH PROBABILITY; LOGARITHMIC TIME; PRAM ALGORITHMS; SEQUENTIAL ALGORITHM; WORK-OPTIMAL ALGORITHM;

TREES (MATHEMATICS);

EID: 84947716322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_158     Document Type: Conference Paper

References (15)

1. A. Apostolico, С. Iliopoulos, G.M. Landau, B. Scieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.
2. Alberto Apostolico. The myriad virtues of subword trees. In A. Apos-tolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 85-96. Springer-Verlag, Berlin, 1984.
3. Μ. T. Chen and J. Seiferas. Efficient and elegant subword tree construction. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, chapter 12, pages 97-107. NATO ASI Series F: Computer and System Sciences, 1985.
4. A. Delcher and S. Kosaraju. Large-scale assembly of dna strings and space-efficient construction of suffix trees. Proc. of the 27th Ann. ACM Symp. on Theory of Computing, 1995.
5. M. Farach and S. Muthukrishnan. Optimal parallel dictionary matching and compression. 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995.
6. M. Farach and S. Muthukrishnan. Optimal logarithmic time randomized suffix tree construction. Technical Report, DIMACS, 1996.
7. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. Proc. of the 32nd IEEE Annual Symp. on Foundation of Computer Science, pages 698-710, 1991.
8. R. Hariharan. Optimal parallel suffix tree construction. Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 1994.
9. S. Kosaraju. Real-time suffix tree construction. Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 1994.
10. R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31:249-260, 1987.
11. Ε. M. McCreight. A space-economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
12. W. Paul, U. Vishkin, and H. Wagener. Parallel computation on 2-3 trees. Technical Report TR-70, Courant Institue, NYU, 1983.
13. Rüdiger Reischuk. A fast probabilistic parallel sorting algorithm. In Proc. of the 22nd IEEE Annual Symp. on Foundation of Computer Science, pages 212-219, 1981.
14. S. C. Sahinalp and U. Vishkin. Symmetry breaking for suffix tree construction. Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 1994.
15. P. Weiner. Linear pattern matching algorithm. Proc. II IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.