A New Algorithm for String Single Pattern Matching
Dongyang Xu
Abstract
Dongyang Xu
Abstract
This paper analyzed BM pattern matching algorithms firstly.On the basis of this,a new string single pattern matching algorithm was proposed,which Delaminated the pattern string,set priority of the characters of pattern string,improved the shift way of the pattern string.The algorithm can reduce the times of pattern matching and character comparing,it improves the efficiency of pattern matching effectively.By the experiments,the algorithm can improve the efficiency of pattern matching effectively.
A significance statement is not available in the OpenAlex record.
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.
This paper analyzed BM pattern matching algorithms firstly.On the basis of this,a new string single pattern matching algorithm was proposed,which Delaminated the pattern string,set priority of the characters of pattern string,improved the shift way of the pattern string.The algorithm can reduce the times of pattern matching and character comparing,it improves the efficiency of pattern matching effectively.By the experiments,the algorithm can improve the efficiency of pattern matching effectively.
Key concepts: String searching algorithm, Commentz-Walter algorithm, Computer science, Approximate string matching, Pattern matching, Boyer–Moore string search algorithm, String metric, Matching (statistics)