摘要
在分析了BM算法以及一些重要的改进算法的基础上,提出一种新的改进算法——Y_BMHS算法.利用辅助的二维数组,考虑了文本串后间隔的两位字符和模式串首字符的唯一性,使得最大位移提升到m+3,出现概率也显著提高,加快了匹配速度.证明Y_BMHS算法比BM、BMH、BMHS等算法有更好的性能.
After analyzing BM algorithm and some important improved algorithms, a new improved algorithm called Y_BMHS is put forward. With a two-dimensional array, the algorithm considers the uniqueness of text string＇s last two interval characters and pattern string＇s first character. The proposed algorithm makes the maximum displacement enhance to m ＋ 3, and the occurrence probability and match speed are also improved. The experimental results show that the Y_BMHS algorithm performs better than BM, BMH, BMHS and other improved algorithms as well.
出处
《华南师范大学学报（自然科学版）》
CAS
北大核心
2013年第5期31-35,共5页
Journal of South China Normal University(Natural Science Edition)
基金
国家科技支撑计划项目(2008BAH37B05084)
广东省教育科研网优化升级与应用平台建设项目(粤财教2011-16)
关键词
BMHS算法
二维数组
出现概率
BMH算法
BM算法
BMHS algorithm
two-dimensional array
occurrence probability
BMH algorithm
BM algorithm
