skip to main content
article
Free Access

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

Published:01 September 1979Publication History
Skip Abstract Section

Abstract

It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear even when multiple occurrences of the pattern are present in the text.

References

  1. 1 Boyer, R.S., and Moore, J.S. A fast string searching algorithm. Comm. ACM 20, 10 (Oct. 1977), 762-772. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 Guibas, L.J., and Odlyzko, A.M. A new proof of the linearity of the Boyer-Moore string searching algorithms. Proc. 18th Ann. 1EEE Symp. Foundations ofComptr. Sci., 1977, pp. 189-195.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Knuth, D.E., Morris, Jr., J.H., and Pratt, V.B. Fast pattern matching in strings. SlAM J. Comping. 6, 2 (1977), 323-350.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4 Lyndon, R.C., and Schutzenberger, M.P. The equation a M = bNc P in a free group. Michigan Math. J. 9 (1962), 289-298.Google ScholarGoogle ScholarCross RefCross Ref
  5. 5 McCreight, E.M. A space economical suffix tree construction algorithm. J. ACM 23, 2 (April 1976), 262-272. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Weiner, P. Linear pattern matching algorithm. Proc. 14th Ann. IEEE Symp. Switching and Automata Theory, 1973, pp. 1-11.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Yao, A.C.C. The complexity of pattern matching for a random string. Mss., Comptr. Sci. Dept., Stanford U., Stanford, Calif., 1977.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 22, Issue 9
    Sept. 1979
    47 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/359146
    Issue’s Table of Contents

    Copyright © 1979 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 1 September 1979

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader