Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)
On improving the worst case running time of the Boyer-Moore string matching algorithm
It is shown how to modify the Boyer-Moore string matching algorithm so that its worst case running time is linear.
KeywordsString 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.
Unable to display preview. Download preview PDF.
- 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
- Weiner P., "Linear pattern matching algorithm," Proceedings 14th Annual IEEE Symposium in Switching and Automata Theory (1973), 1–11.Google Scholar
- Yao A.C.C., "The complexity of pattern matching for a random string," manuscript; Computer Science Department, Stanford University, Stanford, Calif. (1977).Google Scholar
© Springer-Verlag Berlin Heidelberg 1978