Improved Algorithm of Pattern Matching for Intrusion Detection
Zhen Liu, Su Xiu Xu, Jue Zhang
Abstract
Zhen Liu, Su Xiu Xu, Jue Zhang
Abstract
Firstly pattern matching is briefly introduced in this paper, followed by the analysis of some typical algorithms just as BM algorithm, BMH algorithm, BMHS algorithm. Based on these analyses, a new improved algorithm is presented. The algorithm uses a matching way that is from two ends to the middle, and finds a character which can make a rightward shift larger, also can decrease the times of comparing and enhance the matching speed effectively. Experiments show that the algorithm is more effective when the pattern string is long.
OpenAlex reports 5 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.
Firstly pattern matching is briefly introduced in this paper, followed by the analysis of some typical algorithms just as BM algorithm, BMH algorithm, BMHS algorithm. Based on these analyses, a new improved algorithm is presented. The algorithm uses a matching way that is from two ends to the middle, and finds a character which can make a rightward shift larger, also can decrease the times of comparing and enhance the matching speed effectively. Experiments show that the algorithm is more effective when the pattern string is long.
Key concepts: String searching algorithm, Pattern matching, Algorithm, Matching (statistics), Intrusion detection system, Computer science, Character (mathematics), Commentz-Walter algorithm