2011•Unpublished venueRequires access

An improved algorithm for boyer-moore string matching in chinese information processing

Lingling Yuan

Abstract

BM string matching algorithm is the most famous and efficient in the model matching. Based on it, this article made use of the continuous series of characters which are not in the model string need not be compared to change the model string comparing order. The results indicated that the improvement algorithm for BM string matching which proposed by this article can efficiently decrease the time of string matching and comparing, improve the efficiency string matching algorithm.

About this research paper

What this paper is about

Why it matters

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

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