An Improved Character String Pattern Matching Algorithm

By analyzing a variety of improved pattern matching algorithms,an pattern matching algorithm is improved. Firstly,the text string is preprocessed. Two kinds of characters are made up. One does not exist in the pattern string,and the other is the characters that appear the least. Secondly,through matching both the first character and the last character of the pattern string,the number of the marked characters which appear the least is reduced. If the matching fails,the pattern string directly slides to the next marked character which appears the least. Finally,experimental results show that the frequencies of the movement and the comparison decreased greatly by the improved algorithm,and the additional cost of space is less than the length of the pattern string. Moreover,the efficiency of the pattern matching is improved.