Improved Pattern Matching Algorithm of BMHS

Based on the discussion and comparison of BMH, BMHS string matching algorithm, The optimum choice of which BMHS algorithm is improved, BMHS algorithm for the shortcomings, That is the algorithm fails in matching text strings match´s last bit characters to participate in the next match, in the case of a series of characters appearing, It cann´t achieve a maximum moving distance m+1.An improved algorithm of BMHS2 is proposed. In most cases, The paper proposed an improved algorithm of BMHS2 which can achieve maximum moving distance m+1 .Simulation results showed its efficiency.