一种基于统计特征的模式匹配算法

he difference to the traditional Algorithm of String-Matching is :this algorithm uses the statistic characteristic of the position and frequency of the char to build a new matching list. During the process of the matching, this algorithm will try its best to use this characteristic to skip much more chars to improve the efficiency of the matching. Another characteristic of this Algorithm is it can successfully finish without comparing all chars in the Text. Comparing with the Algorithm before, like KMP,BM, this Algorithm’s average complication of time reaches then best condition of these.