ScholarLens Back to search
2013•Journal of South China Normal UniversityRequires access

A Fast Single-Pattern Match Algorithm

Yang Zijian

Open publisher page 0 citations

Abstract

After analyzing BM algorithm and some important improved algorithms,a new improved algorithm called Y_BMHS is put forward. With a two-dimensional array,the algorithm considers the uniqueness of text string's last two interval characters and pattern string's first character. The proposed algorithm makes the maximum displacement enhance to m + 3,and the occurrence probability and match speed are also improved. The experimental results show that the Y_BMHS algorithm performs better than BM,BMH,BMHS and other improved algorithms as well.

About this research paper

What this paper is about

After analyzing BM algorithm and some important improved algorithms,a new improved algorithm called Y_BMHS is put forward. With a two-dimensional array,the algorithm considers the uniqueness of text string's last two interval characters and pattern string's first character. The proposed algorithm makes the maximum displacement enhance to m + 3,and the occurrence probability and match speed are also improved. The experimental results show that the Y_BMHS algorithm performs better than BM,BMH,BMHS and other improved algorithms as well.

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

After analyzing BM algorithm and some important improved algorithms,a new improved algorithm called Y_BMHS is put forward. With a two-dimensional array,the algorithm considers the uniqueness of text string's last two interval characters and pattern string's first character. The proposed algorithm makes the maximum displacement enhance to m + 3,and the occurrence probability and match speed are also improved. The experimental results show that the Y_BMHS algorithm performs better than BM,BMH,BMHS and other improved algorithms as well.

Key concepts: Algorithm, Uniqueness, String (physics), String searching algorithm, Character (mathematics), Interval (graph theory), Computer science, Displacement (psychology)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Fast Single-Pattern Match Algorithm — Research Paper | ScholarLens