Optimal Parallel Suffix Tree Construction

Journal of Computer and System Sciences

Volumn 55, Issue 1, 1997, Pages 44-69

  Hariharan, Ramesh ^a,b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATIONS; MATHEMATICAL TECHNIQUES; PARALLEL ALGORITHMS; TREES (MATHEMATICS);

CREW-PRAM MODEL; PARALLEL SUFFIX FREE CONSTRUCTION;

COMPUTER SCIENCE;

EID: 0031213340     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1496     Document Type: Article

References (22)

1. A. Apostolico, The myriad virtues of sub-word trees, in "Combinatorial Algorithms on Words" (A. Apostilico and Z. Galil, Eds.), NATO-ASI Ser. F, Computer and System Sciences, Vol. 12, pp. 85-96, Springer-Verlag, New York/ Berlin, 1985.
2. A. Apostolico, C. Iliopoulos, G. Landau, B. Schieber, and U. Vishkin, Parallel construction of a suffix tree with application, Algorithmica 3 (1988), 347-365.
3. A. Apostolico and F. Preparata, Optimal off-line detection of repetitions in a string, Theor. Comput. Sci. 22 (1983), 297-315.
4. A. Apostolico and F. Preparata, Structural properties of the string statistics problem, J. Comput. System Sci. 31 (1985), 394-411.
5. P. C. P Bhatt, K. Diks, T. Hagerup, V. C. Prasad, T. Radzik, and S. Saksena, Improved deterministic parallel integer sorting, Inform. and Comput. 94 (1991), 29-47.
6. B. Clift, D. Haussler, R. McConnell, T. D. Schneider, and G. D. Stormo, Sequence Landscapes, Nucleic Acids Research 4, No. 1 (1986), 141-158.
7. R. Cole, Parallel merge sort, SIAM J. Comput. 17 (1988), 770-785.
8. R. Cole and U. Vishkin, Deterministic coin tossing and accelering cascades: micro and macro techniques for designing parallel algorithms, in "Proceedings, 18th ACM Symposium on Theory of Computing, 1986," pp. 206-219.
9. M. Farach and S. Muthukrishnan, Optimal parallel randomized suffix tree construction, private communication, 1994.
10. L. Ga̧sieniec, private communication, 1993.
11. D. Harel and R. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM Journal on Computing 13 (1984), 338-355.
12. Z. Kedem, G. Landau, and K. Palem, Optimal parallel suffix-prefix matching algorithm and application, in "Proceedings, 1st ACM Symposium on Parallel Algorithms and Architectures, 1989," pp. 388-398.
13. R. Karp, R. E. Miller, and A. L. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, in "Proceedings, 4th ACM Symposium on Theory of Computing, 1972," pp. 125-136.
14. G. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching, in "Proceedings, 18th ACM Symposium on Theory of Computing, 1986," pp. 220-230.
15. P in a free group, Michigan Math. J. 9 (1962), 289-298.
16. E. McCreight, A space economical suffix tree construction algorithm, Assoc. Comput. Mach. 23 (1976), 262-272.
17. S. Muthukrishnan and K. Palem, Highly efficient parallel dictionary matching, in "Proceedings, 5th ACM Symposium on Parallel Algorithms and Architecture, 1993."
18. M. Rodeh, V. R. Pratt, and S. Even, Linear algorithm for data compression via string matching, J. Assoc. Comput. Mach. 28 (1981), 16-24.
19. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17 (1988), 1253-1262.
20. S. J. Sahinalp and U. Vishkin, Symmetry breaking for suffix tree construction, in "Proceedings, 26th ACM Symposium on Theory of Computing, 1994."
21. R. Tarjan and U. Vishkin, Finding bi-connected components and computing tree functions in polylogarithmic parallel time, in "Proceedings, 25th IEEE Symposium on Foundations of Computer Science, 1984," pp. 12-20.
22. P. Weiner, Linear pattern matching algorithm, in "Proceedings, 14th IEEE Symposium on Switching and Automata Theory, 1973," pp. 1-11.