Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Parallel construction of a suffix tree

Extended abstract

  • Parallel And Distributed Computing
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 267))

Included in the following conference series:

Abstract

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.

The research of this author was supported by NSF grant NSF-CCR-8615337 and ONR grant N00014-85-K-0046.

The research of these authors was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U. S. Department of Energy under contract number DE-AC02-76ER03077.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. A. Apostolico and C. Iliopoulos, "Parallel log-time construction of suffix trees", preprint, Dept. of Computer Science, Purdue University, Oct. 1986.

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. 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. 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. M. Fisher and L. Ladner, "Parallel Prefix Computation", Journal of the ACM, 27 (1980), 831–838.

    Google Scholar 

  8. 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. C.P. Kruskal, "Searching, merging and sorting in parallel computation", IEEE Trans. Computers, c-32 (1983), 942–946.

    Google Scholar 

  10. 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. 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. E.M. McCreight, "A space-economical suffix tree construction algorithm", Journal of the ACM, 23 (1976), 262–272.

    Article  Google Scholar 

  13. A.O. Slisenko, "Detection of periodicities and string matching in real time", Journal of Soviet Mathematics, 23 (1983), 1316–1387.

    Google Scholar 

  14. Y. Shiloach and U. Vishkin, "Finding the maximum, merging and sorting in a parallel model of computation", Journal of Algorithms, 2 (1981), 88–102.

    Article  Google Scholar 

  15. 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. L.G. Valiant, "Parallelism in comparison problems", SIAM J. Comput., 4 (1975), 348–355.

    Article  Google Scholar 

  17. U. Vishkin, "Synchronous parallel computation — a survey", TR-71, Dept. of Computer Science, Courant Institute, NYU, 1983.

    Google Scholar 

  18. U. Vishkin, "Randomized speed-ups in parallel computation", Proc. 16th ACM Symposium on Theory of Computing, 1984, 230–239.

    Google Scholar 

  19. P. Weiner "Linear Pattern Matching Algorithm", Proc. 14th IEEE Symposium on Switching and Automata Theory, 1973, 1–11.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science School of Mathematical Sciences, Tel Aviv University, 69978, Tel Aviv, Israel

    Gad M. Landau, Baruch Schieber & Uzi Vishkin

  2. Department of Computer Science Courant Institute of Mathematical Sciences, New York University, 251 Mercer St., 10012, New York, N.Y.

    Gad M. Landau, Baruch Schieber & Uzi Vishkin

Authors
  1. Gad M. Landau
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Baruch Schieber
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Uzi Vishkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Thomas Ottmann

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Landau, G.M., Schieber, B., Vishkin, U. (1987). Parallel construction of a suffix tree. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-18088-5_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18088-3

  • Online ISBN: 978-3-540-47747-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation