A Jumping String Mode Matching Algorithm

摘要：

In this paper we present a jumping string mode matching algorithm. The principle is as follows. First, we build a bucket based on the main text. The characters in the pattern string compare with the corresponding ones in the bucket to find out the Best Matching Character. Then we simply match from the most suitable positions. This algorithm is especially fit for the relatively stable main texts. The time complexity depends on the degree of relevancy between pattern string and the main text.

关键词： string matching bucket pattern string

作者: Wang Wen-jian Wu Shun-xiang

作者单位: Department of Automation Xiamen University Xiamen, China Institute of Pattern Recognition & Intelligence System Department of Automation, Xiamen University X

会议类型: 国际会议

会议名称: 第四届国际计算机新科技与教育学术会议(2009 4th International Conference on Computer Science & Education)

会议地点: 南京

会议语种:英文

页码: 1181-1185

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