Advertisement

Efficient text searching of regular expressions

  • Ricardo A. Baeza-Yates
  • Gaston H. Gonnet
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 382)

Abstract

We present algorithms for efficient searching of regular expressions on preprocessed text, using a Patricia tree as index. We obtain searching algorithms with logarithmic expected time in the size of the text for a wide subclass of regular expressions, and sublinear expected time for any regular expression. These are the first known algorithms to achieve these time complexities.

References

  1. [BY89]
    R.A. Baeza-Yates. Efficient Text Searching. PhD thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Research Report CS-89-17.Google Scholar
  2. [BYG89a]
    R. Baeza-Yates and G.H. Gonnet. Efficient text searching of regular expressions. In ICALP'89, Stresa, Italy, July 1989. Also as UW Centre for the New OED Report, OED-89-01, Univ. of Waterloo, April, 1989.Google Scholar
  3. [BYG89b]
    R.A. Baeza-Yates and G.H. Gonnet. Solving matrix recurrences with applications. Technical Report CS-89-16, Department of Computer Science, University of Waterloo, May 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Ricardo A. Baeza-Yates
    • 1
  • Gaston H. Gonnet
    • 1
  1. 1.Centre for the New O.E.D. & Data Structuring Group Department of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations