The number of character comparisons and the jump length after mismatch are two key factors affecting the efficiency of string matching algorithms.BM algorithm is one of the most classical single pattern string matching algorithms.In a pattern string with a length of m,the maximum jump length after mismatch is m.However,when ap-plied to Tibetan environments,there are more comparisons of meaningless characters,and the maximum jump length can be increased.This paper proposes a single pattern matching algorithm based on Tibetan syllable points:BM-Ti-betan algorithm.The algorithm uses the idea of"alignment first,then matching"to reduce the number of matching,and the maximum jump distance after mismatch is m+k(2≤k≤8).Experimental results show that the number of character comparison and pattern string movement of BM-Tibetan algorithm are less than BM algorithm,and the per-formance of the algorithm has certain advantages.
维普
万方数据