The Research of Improved Matching Algorithm of String Pattern
Lili Jiang
Abstract
Lili Jiang
Abstract
String pattern matching is an important algorithm in Intrusion Detection System.Based on the analyzing of KMP and BM algorithms,and of the other improved algorithms,an improved string matching algorithm which is simple,practical and easy to understand is proposed.The experimental results show that the algorithm can reduce the number of times of attempts and comparisons of pattern matching and so improve the efficiency of it.
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.
String pattern matching is an important algorithm in Intrusion Detection System.Based on the analyzing of KMP and BM algorithms,and of the other improved algorithms,an improved string matching algorithm which is simple,practical and easy to understand is proposed.The experimental results show that the algorithm can reduce the number of times of attempts and comparisons of pattern matching and so improve the efficiency of it.
Key concepts: String searching algorithm, Computer science, Commentz-Walter algorithm, Pattern matching, Boyer–Moore string search algorithm, Approximate string matching, Algorithm, Intrusion detection system