一种改进的串的模式匹配算法的探讨

Pattern matching algorithms of strings has always been the focus of researches in the field of sscomputer science. This paper first analyzes the BF, KMP, BM algorithms and,then brings up an improved Sundaynew algorithm, and give detail process of the improved Sundaynew algorithm. This algorithm can jump over more characters to do next matching when this matching is lost. At the same,the matching times decreases sharply. In this case, it improves the matching efficiency. In the end, the analysis of this algorithm`s performance and the comparisons of the testing results several matching algorithms are given.