摘要
文中利用ＢＭ算法中依据ｄ函数来右移模式距离大小的特点，在一定条件下，将模式分解成具有一定性质的两个子串．通过子模式各自的性质及相互间的关系，控制模式匹配过程，以减少字符重复比较次数，从而提高算法匹配效率．
An improved BM algorithm is presented. It matchs patterns after they are separated into two substrings under certain conditions by utilizing the feature of right shift distance by d function in BM algorithm. It controls pattern matching process according to the respective characteristics of substrings and the relation betwen them. It raises matching efficiency by reducing the times of repetitive comparisons.
出处
《计算机研究与发展》
EI
CSCD
北大核心
1998年第1期45-48,共4页
Journal of Computer Research and Development
关键词
算法
BM算法
串
匹配
text, pattern, string, match, algorithm, time complexity
