2004Jisuanji gongchengRequires access

Improved BM-algorithm for pattern matching in string

Pang Shan-chen, Shudong Wang

Open publisher page 0 citations

Abstract

On the basis of BM-algorithm and [12], an improved BM-algorithm was presented. The important characters of the improved BM-algorithm were stated as follows: 1) The complexity of the algorithm was reduced efficiently; 2) The matching algorithm was more easily extended to two dimensions and approximate matching.

About this research paper

What this paper is about

On the basis of BM-algorithm and [12], an improved BM-algorithm was presented. The important characters of the improved BM-algorithm were stated as follows: 1) The complexity of the algorithm was reduced efficiently; 2) The matching algorithm was more easily extended to two dimensions and approximate matching.

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 [12], an improved BM-algorithm was presented. The important characters of the improved BM-algorithm were stated as follows: 1) The complexity of the algorithm was reduced efficiently; 2) The matching algorithm was more easily extended to two dimensions and approximate matching.

Key concepts: String searching algorithm, Computer science, Commentz-Walter algorithm, Matching (statistics), Algorithm, Approximate string matching, Pattern matching, Basis (linear algebra)

Related papers

Back to paper searchBrowse research topicsOriginal source
Improved BM-algorithm for pattern matching in string — Research Paper | ScholarLens