AN IMPROVED BM ALGORITHM FOR PATTERN MATCHING IN STRINGS

An improved BM algorithm is presented. It matchs patterns after they are separated into two substrings under certain conditions by utilizing the feature of right shift distance by d function in BM algorithm. It controls pattern matching process according to the respective characteristics of substrings and the relation betwen them. It raises matching efficiency by reducing the times of repetitive comparisons.