On Improving the Average Case of the Boyer-Moore String Matching Algorithm
Search this Article
It is shown how to modify the Boyer-Moore string matching algorithm so that the number of characters actually inspected and the running time decrease sharply as the length of pattern gets longer.
- J. of Information Proc.
J. of Information Proc. 10,3, 173-177, 1988
Information Processing Society of Japan (IPSJ)