On a parallel-algorithms method for string matching problems (overview)

  • Suleyman Cenk Sahinalp
  • Uzi Vishkin
Invited Presentations

DOI: 10.1007/3-540-57811-0_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 778)
Cite this paper as:
Sahinalp S.C., Vishkin U. (1994) On a parallel-algorithms method for string matching problems (overview). In: Bonuccelli M., Crescenzi P., Petreschi R. (eds) Algorithms and Complexity. CIAC 1994. Lecture Notes in Computer Science, vol 778. Springer, Berlin, Heidelberg


Suffix trees are the main data-structure in string matching algorithmes. There are several serial algorithms for suffix tree construction which run in linear time, but the number of operations in the only parallel algorithm available, due to Apostolico, Iliopoulos, Landau, Schieber and Vishkin, is proportional to n log n. The algorithm is based on labeling substrings, similar to a classical serial algorithm, with the same operations bound, by Karp, Miller and Rosenberg. We show how to break symmetries that occur in the process of assigning labels using the Deterministic Coin Tossing (DCT) technique, and thereby reduce the number of labeled substrings to linear.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Suleyman Cenk Sahinalp
    • 1
  • Uzi Vishkin
    • 2
    • 3
  1. 1.Department of Computer ScienceUniversity of Maryland at College ParkUSA
  2. 2.University of Maryland Institute for Advanced Computer StudiesCollege Park
  3. 3.Dept. of Computer ScienceTel Aviv UniversityTel AvivIsrael

Personalised recommendations