ScholarLens Back to search
2007•Microelectronics & ComputerRequires access

A Fast Improved Algorithm for Pattern Matching in String

Jian Zhang

Open publisher page 0 citations

Abstract

On the basis of BM algorithm and some important improvement algorithms, a new improved algorithm- BMG is presented. This algorithm combines the merits of BMH and BMHS.At the same time, the uniqueness of next character is taken into account. This algorithm greatly enhances the probability of occurrence of the largest right Goodsuffix m+1, thus improves the matching speed effectively. BMG algorithm passed test and proves to be valid. The test results shows that the algorithm has better performance than BM, BMH, BMHS algorithm.

About this research paper

What this paper is about

On the basis of BM algorithm and some important improvement algorithms, a new improved algorithm- BMG is presented. This algorithm combines the merits of BMH and BMHS.At the same time, the uniqueness of next character is taken into account. This algorithm greatly enhances the probability of occurrence of the largest right Goodsuffix m+1, thus improves the matching speed effectively. BMG algorithm passed test and proves to be valid. The test results shows that the algorithm has better performance than BM, BMH, 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

On the basis of BM algorithm and some important improvement algorithms, a new improved algorithm- BMG is presented. This algorithm combines the merits of BMH and BMHS.At the same time, the uniqueness of next character is taken into account. This algorithm greatly enhances the probability of occurrence of the largest right Goodsuffix m+1, thus improves the matching speed effectively. BMG algorithm passed test and proves to be valid. The test results shows that the algorithm has better performance than BM, BMH, BMHS algorithm.

Key concepts: Computer science, Algorithm, String searching algorithm, Basis (linear algebra), Matching (statistics), Uniqueness, Pattern matching, Character (mathematics)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Fast Improved Algorithm for Pattern Matching in String — Research Paper | ScholarLens