Improved Pattern Matching Algorithm of BMHS

摘要：

Based on the discussion and comparison of BMH, BMHS string matching algorithm,The optimum choice of which BMHS algorithm is improved,BMHS algorithm for the shortcomings,That is the algorithm fails in matching text strings matcht last bit characters to participate in the next match, in the case of a series of characters appearing It cannt achieve a maximum moving distance m+1.An improved algorithm of BMHS2 is proposed.In most cases, The paper proposed an improved algorithm of BMHS2 which can achieve maximum moving distance m+1. Simulation results showed its efficiency.

关键词： String Pattern Matching Algorithm

作者: Lin quan Xie Xiao ming Liu Guangxue Yue

作者单位: School of Sciences, Jiangxi University of Science and Technology Ganzhou, China Department of Computer Science and Technology, Huaihua University Huaihua, China

会议类型: 国际会议

会议名称: Third International Symposium on Information Science and Engineering(第三届信息科学与工程国际会议 ISISE 2010)

会议地点: 上海

会议语种:英文

页码: 616-619

在线出版日期: 2010-12-24（万方平台首次上网日期，不代表论文的发表时间）