2012Unpublished venueRequires access

An Improved Pattern Matching Algorithm Based on BMHS

Jingbo Yuan, Jinsong Yang, Shunli Ding

Open publisher page 7 citations

Abstract

Pattern matching plays an important role in intrusion detection system. Based on analysis and discussions for BM, BMH and BMHS algorithms, an improved algorithm is proposed. The improved algorithm takes advantage of position information of the last character and its adjacent character in current attempt window to get bigger jump distance in each jump so to make the algorithm more efficient. Experimental results show that the number of character comparisons and windows shifts of improved algorithms is clearly reduced comparing with the BM and BMH and BMHS algorithms.

About this research paper

What this paper is about

Pattern matching plays an important role in intrusion detection system. Based on analysis and discussions for BM, BMH and BMHS algorithms, an improved algorithm is proposed. The improved algorithm takes advantage of position information of the last character and its adjacent character in current attempt window to get bigger jump distance in each jump so to make the algorithm more efficient. Experimental results show that the number of character comparisons and windows shifts of improved algorithms is clearly reduced comparing with the BM and BMH and BMHS algorithms.

Why it matters

OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Pattern matching plays an important role in intrusion detection system. Based on analysis and discussions for BM, BMH and BMHS algorithms, an improved algorithm is proposed. The improved algorithm takes advantage of position information of the last character and its adjacent character in current attempt window to get bigger jump distance in each jump so to make the algorithm more efficient. Experimental results show that the number of character comparisons and windows shifts of improved algorithms is clearly reduced comparing with the BM and BMH and BMHS algorithms.

Key concepts: Character (mathematics), Jump, Algorithm, Matching (statistics), Computer science, Pattern matching, Window (computing), Position (finance)

Related papers

Back to paper searchBrowse research topicsOriginal source
An Improved Pattern Matching Algorithm Based on BMHS — Research Paper | ScholarLens