A fast improved BM algorithm for pattern matching in strings
Hou Zheng-feng · Journal of Hefei University of Technology · 2006
The Boyer-Moore(BM) algorithm and its important improvement algorithms,such as the Boyer-Moore-Horspool(BMH) algorithm,the BoyerMoore-Horspool-Sunday(BMHS) algorithm,are described.Then a new improved algorithm,the BMG algorithm is introduced.The new algorithm combines the merits of the BMH and BMHS algorithms and the uniqueness of the next character is taken into account.This new algorithm greatly enhances the probability of occurrence of the largest right shift m+1,thus improving the matching speed effectively.