Study and improve of BM pattern matching algorithms
Rui Guan
Abstract
Rui Guan
Abstract
Pattern matching algorithms are widely used in digital communications,intrusion detection and other areas.BM algorithm is one of the most widely used pattern matching algorithm for its excellent efficiency.However,the efficiency of BM algorithm can be improved.Based on BM,BMH and BMHS algorithm,and through integrating and improving,the paper proposed IBMH algorithm which is a new improved algorithm.After the analysis of the algorithms complexity,the paper made an experimental test.And the results show that the IBMH algorithm is much better than BM,BMH and BMHS algorithm in comparisons times,running time and stability.
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 algorithms are widely used in digital communications,intrusion detection and other areas.BM algorithm is one of the most widely used pattern matching algorithm for its excellent efficiency.However,the efficiency of BM algorithm can be improved.Based on BM,BMH and BMHS algorithm,and through integrating and improving,the paper proposed IBMH algorithm which is a new improved algorithm.After the analysis of the algorithms complexity,the paper made an experimental test.And the results show that the IBMH algorithm is much better than BM,BMH and BMHS algorithm in comparisons times,running time and stability.
Key concepts: Algorithm, Matching (statistics), Blossom algorithm, String searching algorithm, Computer science, Stability (learning theory), Pattern matching, Efficient algorithm