ScholarLens Back to search
2006•Journal of Hefei University of TechnologyRequires access

A fast improved BM algorithm for pattern matching in strings

Hou Zheng-feng

Open publisher page 2 citations

Abstract

The Boyer-Moore(BM) algorithm and its important improvement algorithms,such as the Boyer-Moore-Horspool(BMH) algorithm,the BoyerMoore-Horspool-Sunday(BMHS) algorithm,are described.Then a new improved algorithm,the BMG algorithm is introduced.The new algorithm combines the merits of the BMH and BMHS algorithms and the uniqueness of the next character is taken into account.This new algorithm greatly enhances the probability of occurrence of the largest right shift m+1,thus improving the matching speed effectively.

About this research paper

What this paper is about

The Boyer-Moore(BM) algorithm and its important improvement algorithms,such as the Boyer-Moore-Horspool(BMH) algorithm,the BoyerMoore-Horspool-Sunday(BMHS) algorithm,are described.Then a new improved algorithm,the BMG algorithm is introduced.The new algorithm combines the merits of the BMH and BMHS algorithms and the uniqueness of the next character is taken into account.This new algorithm greatly enhances the probability of occurrence of the largest right shift m+1,thus improving the matching speed effectively.

Why it matters

OpenAlex reports 2 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

The Boyer-Moore(BM) algorithm and its important improvement algorithms,such as the Boyer-Moore-Horspool(BMH) algorithm,the BoyerMoore-Horspool-Sunday(BMHS) algorithm,are described.Then a new improved algorithm,the BMG algorithm is introduced.The new algorithm combines the merits of the BMH and BMHS algorithms and the uniqueness of the next character is taken into account.This new algorithm greatly enhances the probability of occurrence of the largest right shift m+1,thus improving the matching speed effectively.

Key concepts: Algorithm, Boyer–Moore string search algorithm, Matching (statistics), String searching algorithm, Computer science, Pattern matching, Character (mathematics), Uniqueness

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A fast improved BM algorithm for pattern matching in strings — Research Paper | ScholarLens