中文摘要：

KMP算法和BM算法是经典的单模式匹配算法,但KMP算法中文本指针i每次只能移动一个字符,整体的匹配效率并不高,结合KMP算法和BM算法的优点提出一种改进算法（KMPP）。算法的思想是模式串与文本在j处不匹配时,预算出模式串移动next[j]后末字符在文本中的位置,当该位置的文本字符与末字符不匹配时,则用该字符进行坏字符匹配,这两步的跳跃距离就是文本指针i移动的距离,从而使指针i每次移动的距离达到最大。实验结果表明,该算法匹配次数远低于KMP算法的匹配次数,提高了模式匹配的效率。

英文摘要：

KMP algorithm and BM algorithm are classical single pattern matching algorithms, because the pointer i in the text can only move one character at each time in KMP algorithm, the overall matching efficiency is not high, the improved algorithm（KMPP）accordingly to combine the advantages of the KMP algorithm with BM algorithm together is proposed.The core of KMPP algorithm is when a mismatch occurs at position j, it calculates the position in the text where the last character of pattern will align with after the pattern moving the value of next[ j]. If the last character of pattern does not match with the corresponding text position, the bad character rules are applied. The moving distance of pointer i in the text is a two-step jumping distance, thus the pointer can move farthest at each time. The experimental result shows that the comparison number of KMPP algorithm is far less than the KMP algorithm＇s number and it improves the efficiency of pattern matching algorithm.