Advertisement

On improving the worst case running time of the Boyer-Moore string matching algorithm

  • Zvi Galil
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)

Abstract

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear.

Keywords

String Match Suffix Tree Alphabet Size Pattern Length Annual IEEE SymposiUm 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Boyer R.S. and Moore J.S., "A fast string searching algorithm," Communication of the ACM, Vol. 20, No. 10 (1977), 262–272.CrossRefGoogle Scholar
  2. [2]
    Guibas L.J. and Odlyzko A.M., "A new proof of the linearity of the Boyer-Moore string searching algorithms," Proceedings 18th Annual IEEE Symposium on Foundations of Computer Science (1977), 189–195.Google Scholar
  3. [3]
    Knuth D.E., Morris Jr. J.H. and Pratt V.B., "Fast pattern matching in strings", SIAM J. on Computing, Vol. 6, No. 2, (1977), 323–350.CrossRefGoogle Scholar
  4. [4]
    Lyndon R.C. and Schutzenberger M.P., "The equation aM=bNcP in a free group," Michigan Math. J., 9 (1962), 289–298.CrossRefGoogle Scholar
  5. [5]
    McCreight E.M., "A space economical suffix tree construction algorithm," Journal of the ACM, Vol. 23, No. 2 (1976), 262–272.CrossRefGoogle Scholar
  6. [6]
    Weiner P., "Linear pattern matching algorithm," Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory (1973), 1–11.Google Scholar
  7. [7]
    Yao A.C.C., "The complexity of pattern matching for a random string," manuscript; Computer Science Department, Stanford University, Stanford, Calif. (1977).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Zvi Galil
    • 1
  1. 1.Department of Mathematical Sciences Computer Science DivisionTel-Aviv University Ramat-AvivTel-AvivIsrael

Personalised recommendations