A Fast String Matching Algorithm
Yibin Hou · Mini-micro Systems · 2004
The technology of string matching is applied abroad in many fields. Based on the discussions of Brute-Force, Boyer-Moore algorithms and the most important improvements to these algorithms, a novel improved algorithm-BMH2C is presented. The algorithm computes the right shift using two characters and saves the shift in a two-dimension array, increases the shift, decreases the times of comparing and enhances the matching speed effectively. In the end, the comparisons of the testing results of these algorithms are given.