Skip to main content
Conference Proceedings

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1978) 62 LNCS 241-250
DOI: 10.1007/3-540-08860-1_18
5Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Galil, Z. (1978). On improving the worst case running time of the Boyer-Moore string matching algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 62 LNCS, pp. 241–250). Springer Verlag. https://doi.org/10.1007/3-540-08860-1_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free