Based on the analyzing BM algorithm and some important improved algorithms, according to the characteristics of the first character only put forward a new pattern matching algorithm--BMX algorithm. The algorithm uses the uniqueness of the first character of pattern string, determine whether the next character in the pattern string and comparing the character and the first character of pattern string. The proposed algorithm makes the maximum displacement enhance to , the occurrence probability significantly improved. The results show that BMX algorithm can maximize the skip the bad character,greatly reduces the number of matching and compare the number of the characters, matching speed and efficiency is better than BM, BMH and BMHS algorithm.%在分析了经典的BM算法以及一些重要的改进算法的基础上，根据首字符唯一的特点提出了一种新的模式匹配算法--BMX算法。该算法利用模式串首字符的唯一性，通过判断文本串后一位是否在模式串中出现以及下一位字符和模式串首字符的比较，能使最大位移量提升到，出现概率也显著提高。实验结果表明，BMX算法能够最大限度地跳过坏字符，大大减少了匹配次数和字符的比较个数，加快了匹配速度，效率优于BM、BMH、BMHS等算法。
展开▼
