Improvement of BM pattern matching algorithm
Shunli Ding
Abstract
Shunli Ding
Abstract
Pattern matching algorithm is an important algorithm,used by most of Intrusion Detection System.On the base of analyzing BM algorithm and other algorithms,a new improved pattern matching algorithm—BMI algorithm is presented.The algorithm makes reference to the idea of BM algorithm and makes use of singleness and combination of the last character and next character of string,increasing the probability of maximum displacement effectively.Test results show that the algorithm can effectively improve the efficiency of the matching process.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Pattern matching algorithm is an important algorithm,used by most of Intrusion Detection System.On the base of analyzing BM algorithm and other algorithms,a new improved pattern matching algorithm—BMI algorithm is presented.The algorithm makes reference to the idea of BM algorithm and makes use of singleness and combination of the last character and next character of string,increasing the probability of maximum displacement effectively.Test results show that the algorithm can effectively improve the efficiency of the matching process.
Key concepts: String searching algorithm, Algorithm, Computer science, Matching (statistics), Character (mathematics), Pattern matching, Blossom algorithm, Commentz-Walter algorithm