一种改进的Sunday匹配算法  

A Modified Sunday Matching Algorithm

作　　者：李明月[1] 张善卿[1] 陆剑锋[1] 孙冬梅[1] 

机构地区：[1]杭州电子科技大学计算机学院,浙江杭州310018

出　　处：《杭州电子科技大学学报（自然科学版）》2015年第1期93-96,共4页Journal of Hangzhou Dianzi University：Natural Sciences

基　　金：浙江省自然科学基金资助项目(LY14F020043)

摘　　要：字符串的模式匹配算法在多协议识别技术中,起着至关重要的作用,为了提高多协议识别效率,该文在分析几种经典模式匹配算法的基础上,提出一种基于Sunday算法的改进算法。算法主要是在每次匹配开始前通过一个条件判断语句,判断主串中的相应后缀是否在模式串中,从而减少了无意义的匹配次数,提高了算法的执行效率,通过对比实验证明了该算法的有效性。Pattern-matching algorithm of string plays an important role in multi-protocol recognition technology,in order to improve the efficiency of multi-protocol recognition,this paper analyzed several classical pattern matching algorithms and presented a modified Su Sunday algorithm on the base of Ro Sunday algorithm. The algorithm mainly judged the suffix of the main string whether contain in the pattern string through the conditional judgment before the start of each matching, thereby reducing the frequency of meaningless matching,improve the execution efficiency of the algorithm,and verified the effectiveness of this algorithm through comparison testing.

关 键 词：Sunday算法 RoSunday算法 匹配模式 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]