Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1978: Automata, Languages and Programming pp 241–250Cite as

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

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

The work of the author was supported in part by the Bat-Sheva Fund.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boyer R.S. and Moore J.S., "A fast string searching algorithm," Communication of the ACM, Vol. 20, No. 10 (1977), 262–272.

    Article  Google Scholar 

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

    Article  Google Scholar 

  4. Lyndon R.C. and Schutzenberger M.P., "The equation aM=bNcP in a free group," Michigan Math. J., 9 (1962), 289–298.

    Article  Google Scholar 

  5. McCreight E.M., "A space economical suffix tree construction algorithm," Journal of the ACM, Vol. 23, No. 2 (1976), 262–272.

    Article  Google Scholar 

  6. Weiner P., "Linear pattern matching algorithm," Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory (1973), 1–11.

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences Computer Science Division, Tel-Aviv University Ramat-Aviv, Tel-Aviv, Israel

    Zvi Galil

Authors
  1. Zvi Galil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galil, Z. (1978). On improving the worst case running time of the Boyer-Moore string matching algorithm. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation