ScholarLens Back to search
2004•Mini-micro SystemsRequires access

A Fast String Matching Algorithm

Yibin Hou

Open publisher page 21 citations

Abstract

The technology of string matching is applied abroad in many fields. Based on the discussions of Brute-Force, Boyer-Moore algorithms and the most important improvements to these algorithms, a novel improved algorithm-BMH2C is presented. The algorithm computes the right shift using two characters and saves the shift in a two-dimension array, increases the shift, decreases the times of comparing and enhances the matching speed effectively. In the end, the comparisons of the testing results of these algorithms are given.

About this research paper

What this paper is about

The technology of string matching is applied abroad in many fields. Based on the discussions of Brute-Force, Boyer-Moore algorithms and the most important improvements to these algorithms, a novel improved algorithm-BMH2C is presented. The algorithm computes the right shift using two characters and saves the shift in a two-dimension array, increases the shift, decreases the times of comparing and enhances the matching speed effectively. In the end, the comparisons of the testing results of these algorithms are given.

Why it matters

OpenAlex reports 21 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 technology of string matching is applied abroad in many fields. Based on the discussions of Brute-Force, Boyer-Moore algorithms and the most important improvements to these algorithms, a novel improved algorithm-BMH2C is presented. The algorithm computes the right shift using two characters and saves the shift in a two-dimension array, increases the shift, decreases the times of comparing and enhances the matching speed effectively. In the end, the comparisons of the testing results of these algorithms are given.

Key concepts: String searching algorithm, Commentz-Walter algorithm, Approximate string matching, Algorithm, Matching (statistics), Boyer–Moore string search algorithm, Brute force, Computer science

Related papers

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