Improved BM Pattern Matching Algorithm
Feng Jingjing
Abstract
Feng Jingjing
Abstract
Considering the efficiency problem of the BM pattern matching algorithm,this paper proposes an improved BM pattern matching algorithm.Analyzing the character of it,if some continuous characters are not appearing in the model string,then the characters needn't to be compared,so this method changes the model string comparing order,and the matching efficiency of BM algorithm is enhanced.Experimental results show that the improved BM pattern matching algorithm can effectively decrease the times of string matching and comparing,and get the good string matching efficiency.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Considering the efficiency problem of the BM pattern matching algorithm,this paper proposes an improved BM pattern matching algorithm.Analyzing the character of it,if some continuous characters are not appearing in the model string,then the characters needn't to be compared,so this method changes the model string comparing order,and the matching efficiency of BM algorithm is enhanced.Experimental results show that the improved BM pattern matching algorithm can effectively decrease the times of string matching and comparing,and get the good string matching efficiency.
Key concepts: String searching algorithm, Commentz-Walter algorithm, Approximate string matching, Matching (statistics), Computer science, Character (mathematics), Pattern matching, Algorithm