2015Electronic Design EngineeringRequires access

Research of new method for improve the rule pattern matching speed

Wang Tong-ju

Open publisher page 0 citations

Abstract

Based on the analyzing BM algorithm and some important improved algorithms, according to the characteristics of the first character only put forward a new pattern matching algorithm--BMX algorithm. The algorithm uses the uniqueness of the first character of pattern string, determine whether the next character in the pattern string and comparing the character and the first character of pattern string. The proposed algorithm makes the maximum displacement enhance to, the occurrence probability significantly improved. The results show that BMX algorithm can maximize the skip the bad character,greatly reduces the number of matching and compare the number of the characters, matching speed and efficiency is better than BM,BMH and BMHS algorithm.

About this research paper

What this paper is about

Based on the analyzing BM algorithm and some important improved algorithms, according to the characteristics of the first character only put forward a new pattern matching algorithm--BMX algorithm. The algorithm uses the uniqueness of the first character of pattern string, determine whether the next character in the pattern string and comparing the character and the first character of pattern string. The proposed algorithm makes the maximum displacement enhance to, the occurrence probability significantly improved. The results show that BMX algorithm can maximize the skip the bad character,greatly reduces the number of matching and compare the number of the characters, matching speed and efficiency is better than BM,BMH and BMHS algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

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

Based on the analyzing BM algorithm and some important improved algorithms, according to the characteristics of the first character only put forward a new pattern matching algorithm--BMX algorithm. The algorithm uses the uniqueness of the first character of pattern string, determine whether the next character in the pattern string and comparing the character and the first character of pattern string. The proposed algorithm makes the maximum displacement enhance to, the occurrence probability significantly improved. The results show that BMX algorithm can maximize the skip the bad character,greatly reduces the number of matching and compare the number of the characters, matching speed and efficiency is better than BM,BMH and BMHS algorithm.

Key concepts: Character (mathematics), String searching algorithm, Pattern matching, Commentz-Walter algorithm, Matching (statistics), Algorithm, String (physics), Uniqueness

Related papers

Back to paper searchBrowse research topicsOriginal source
Research of new method for improve the rule pattern matching speed — Research Paper | ScholarLens