Improved algorithm of BM for pattern matching
Huang Jun
Abstract
Huang Jun
Abstract
Pattern matching is used in intrusion detection system widely.On the base of analyzing BM algorithm and other algorithms,an improved algorithm of BM is presented.The algorithm uses the BMH algorithm and BMHS algorithm at one time and makes use of combination of the first character and last character of pattern to make the pattern shift.It decreases the time and times of character comparison in the matching process.Experimental data shows the improved algorithm can enhance the matching speed effectively.
A significance statement is not available in the OpenAlex record.
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 is used in intrusion detection system widely.On the base of analyzing BM algorithm and other algorithms,an improved algorithm of BM is presented.The algorithm uses the BMH algorithm and BMHS algorithm at one time and makes use of combination of the first character and last character of pattern to make the pattern shift.It decreases the time and times of character comparison in the matching process.Experimental data shows the improved algorithm can enhance the matching speed effectively.
Key concepts: Character (mathematics), Matching (statistics), Algorithm, Pattern matching, Computer science, String searching algorithm, Intrusion detection system, Blossom algorithm