Optimal parallel suffix tree construction

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 290-299

  Hariharan, Ramesh ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; FORESTRY; ALGORITHMS; CHARACTER SETS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; MATHEMATICAL MODELS; OPTIMIZATION; STATE SPACE METHODS; STATISTICS;

PRAM ALGORITHMS; PRAM MODELS; SPACE BOUNDS; SUFFIX-TREES;

TREES (MATHEMATICS);

STRING PROCESSING ALGORITHMS; SUFFIX TREE; TREE CONSTRUCTION;

EID: 0028123961     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195162     Document Type: Conference Paper

References (16)

1. [A85] A. Apostolico. The myriad virtues of sub- word trees. Combinatorial Algorithms on Words, Editors: A. Apostilico and Z. Galil, NATO-ASI series F: Computer and System Sciences, Vol. 12, Springer-Verlag, 1985, pp. 85-96.
2. [AILSV86] A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3, 1988, pp. 347-365.
3. [AP83] A. Apostolico, F. Preparata. Optimal offline detection of repetitions in a string. The-oretical Computer Science, 22, 1983, pp. 297-315 .
4. [AP85] A. Apostolico, F. Preparata. Structural properties of the string statistics problem, Journal of Computer and System Sciences, 31, 1985, pp. 394-411.
5. [CHM86] B. Clift, D. Haussler, R. McConnell, T.D. Schneider, G.D. Stormo. Sequence Land-scapes. Nucleic Acids Research 4, 1, 1986, pp. 141-158.
6. [C88] R. Cole. Parallel merge sort. SIAM Journal on Computing, 17, 1988, pp. 770-785.
7. [FHM93] M. Farach, R. Hariharan, S. Muthukrishnan. Optimal parallel randomized suffix tree construction, Work in progress.
8. [KLP89] Z. Kedem, G. Landau, K. Palem. Optimal parallel suffix-prefix matching algorithm and application. Proc. of the 1st ACM Symposium on Parallel Algorithms and Architectures, 1989, pp. 388-398.
9. [KMR72] R. Karp, R.E. Miller, A.L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. Proc. of the ^th ACM Symposium on Theory of Computing, 1972, pp. 125-136.
10. [LV86] G. Landau, U. Vishkin. Introducing efficient parallelism into approximate string match-ing. Proc. of the 18th ACM Symposium on Theory of Computing, 1986, pp. 220-230.
11. [M76] E. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23, 1976, pp. 262-272.
12. [MP93] S. Muthukrishnan, K. Palem. Highly efficient parallel dictionary matching. Proc. of the 5th ACM Symposium on Parallel Algorithms and Architechture, 1993.
13. [RPE81] M. Rodeh, V.R. Pratt, S. Even. Linear algorithm for data compression via string match-ing. Journal of the ACM, 28, 1981, pp. 1624.
14. [SV88] B. Schieber, U. Vishkin. On finding lowest common ancestors: simplification and paral- lelization. SIAM Journal on Computing, 17, 1988, pp. 1253-1262.
15. [SV93] S.J. Sahinalp, U. Vishkin. Symmetry breaking for suffix tree construction. Proc. of the 26th ACM Symposium on Theory of Computing, 1994.
16. [W73] P. Weiner. Linear pattern matching algorithm. Proc. of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11.