|
计算机应用研究 2009
Improved algorithm for BM string matching
|
Abstract:
This paper researched algorithm for BM string matching. Analyzed kinds of improved algorithms. On the basis of the advantage of these algorithms, the first position, judged the existence and the uniqueness of the neighbor character of the end character or the bad character of the string. By the result of these judges, increased the new shift distance, reduced the times of the match, and enhanced the efficiency of string matching.