Improved Algorithm for BM String Matching Based on Prefix Substring
Pang Shan-chen · 2004
Using the technology for finding the longest prefix substring of pattern in [11], an improved BM-algorithm is presented. The time complexity of the improved algorithm under the worst condition is O(m*n/k),so it reduces the times of matching efficiently.