摘要
研究BM串匹配算法,分析国内外各种改进算法,结合其优缺点,增加对模式串串末字符或坏字符的邻接字符在模式串中的首次出现位置、存在性、惟一性的判断。根据判断的结果对移动距离重新设置,增加模式串移动距离,减少字符重复比较的次数,以提高匹配效率。
This paper researched algorithm for BM string matching. Analyzed kinds of improved algorithms. On the basis of the advantage of these algorithms, the first position, judged the existence and the uniqueness of the neighbor character of the end character or the bad character of the. string. By the result of these judges, increased the new shift distance, reduced the times of the match, and enhanced the efficiency of string matching.
出处
《计算机应用研究》
CSCD
北大核心
2009年第9期3249-3252,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(60373109)
北京电子科技学院开放基金资助项目(KFHT200704)
关键词
串匹配
末字符
坏字符
邻接字符
惟一性
存在性
string match
end character
bad character
neighbor character
uniqueness
existence
