Application of Improved BM Algorithm in String Approximate Matching
Ying Duan, Hua Long, Yu Quan Qu · Procedia Computer Science · 2020
In the paper, we will propose a new algorithm to improve the error tolerance and flexibility of the exact matching by combining the bad characters and good suffix rules in Boyer-Moore algorithm. First of all, using the binary sequence function to control the output range of the target segment; secondly, matching the target segment with partial similar features. The experimental results show that the improved algorithm can improve the accuracy of the target segment and the number of segments matched can be increased to more than 7 times of the exact matching segment.