ACM

Communications of the ACM

Home/Magazine Archive/September 1979 (Vol. 22, No. 9)/On improving the worst case running time of the Boyer.../Abstract

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

By Zvi Galil
Communications of the ACM, September 1979, Vol. 22 No. 9, Pages 505-508
10.1145/359146.359148
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.