Parallel construction of a suffix tree

Extended abstract
  • Gad M. Landau
  • Baruch Schieber
  • Uzi Vishkin
Parallel And Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


Weiner's [We-73] suffix tree is known to be a powerful tool for string manipulations. We present a parallel algorithm for constructing a suffix tree. The algorithm runs in O(log n) time and uses n processors. We also present applications for designing efficient parallel algorithms for several string problems.


Parallel Algorithm Outgoing Edge Internal Vertex String Match Suffix Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ap-85]
    A. Apostolico, "The myriad virtues of subword trees", in A. Apostolico and Z. Galil (editors), Combinatorial Algorithms on Words, NATO ASI Series, Series F: Computer and System Sciences, Vol. 12, Springer-Verlag, 1985, 85–96.Google Scholar
  2. [AHU-74]
    A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.Google Scholar
  3. [AI-86]
    A. Apostolico and C. Iliopoulos, "Parallel log-time construction of suffix trees", preprint, Dept. of Computer Science, Purdue University, Oct. 1986.Google Scholar
  4. [BH-82]
    A. Borodin and J.E. Hopcroft, "Routing, merging and sorting on parallel models of computation", Journal of Computer and System Science, 30 (1985), 130–145.CrossRefGoogle Scholar
  5. [CV-86a]
    R. Cole and U. Vishkin, "Deterministic coin tossing with applications to optimal parallel list ranking", Information and Control 70 (1986), 32–53.Google Scholar
  6. [CV-86b]
    R. Cole and U. Vishkin, "Approximate and exact parallel scheduling with applications to list, tree and graph problems", Proc. 27th Annual Symp. on Foundations of Computer Science, 1986, 478–491.Google Scholar
  7. [FL-80]
    M. Fisher and L. Ladner, "Parallel Prefix Computation", Journal of the ACM, 27 (1980), 831–838.Google Scholar
  8. [KMR-72]
    R.M. Karp, R.E. Miller and A.L. Rosenberg, "Rapid identification of repeated patterns in strings, trees and arrays", Proc. 4th ACM Symposium on Theory of Computing, 1972, 125–136.Google Scholar
  9. [Kr-83]
    C.P. Kruskal, "Searching, merging and sorting in parallel computation", IEEE Trans. Computers, c-32 (1983), 942–946.Google Scholar
  10. [LV-86]
    G.M. Landau and U. Vishkin, "Introducing efficient parallelism into approximate string matching", Proc. 18th ACM Symposium on Theory of Computing, 1986, 220–230.Google Scholar
  11. [LSV-86]
    G.M. Landau, B. Schieber and U. Vishkin, "Parallel construction of a suffix tree". TR 53/86, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1986).Google Scholar
  12. [Mc-76]
    E.M. McCreight, "A space-economical suffix tree construction algorithm", Journal of the ACM, 23 (1976), 262–272.CrossRefGoogle Scholar
  13. [Sl-83]
    A.O. Slisenko, "Detection of periodicities and string matching in real time", Journal of Soviet Mathematics, 23 (1983), 1316–1387.Google Scholar
  14. [SV-81]
    Y. Shiloach and U. Vishkin, "Finding the maximum, merging and sorting in a parallel model of computation", Journal of Algorithms, 2 (1981), 88–102.CrossRefGoogle Scholar
  15. [ScV-87]
    B. Schieber and U. Vishkin, "On finding lowest common ancestors: simplification and parallelization", TR 63/87, The Moise and Frida Eskenasy Institute of Computer Science, Tel Aviv University (1987).Google Scholar
  16. [Va-75]
    L.G. Valiant, "Parallelism in comparison problems", SIAM J. Comput., 4 (1975), 348–355.CrossRefGoogle Scholar
  17. [Vi-83]
    U. Vishkin, "Synchronous parallel computation — a survey", TR-71, Dept. of Computer Science, Courant Institute, NYU, 1983.Google Scholar
  18. [Vi-84]
    U. Vishkin, "Randomized speed-ups in parallel computation", Proc. 16th ACM Symposium on Theory of Computing, 1984, 230–239.Google Scholar
  19. [We-73]
    P. Weiner "Linear Pattern Matching Algorithm", Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, 1–11.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Gad M. Landau
    • 1
    • 2
  • Baruch Schieber
    • 1
    • 2
  • Uzi Vishkin
    • 1
    • 2
  1. 1.Department of Computer Science School of Mathematical SciencesTel Aviv UniversityTel AvivIsrael
  2. 2.Department of Computer Science Courant Institute of Mathematical SciencesNew York UniversityNew York

Personalised recommendations