一种改进的Wu-Manber多关键词匹配算法  

An Improved Wu-Manber Multiple Patterns Match Algorithm

作　　者：张鑫[1] 谭建龙[1] 程学旗[1] 

机构地区：[1]中国科学院计算技术研究所,北京100080

出　　处：《计算机应用》2003年第7期29-31,共3页journal of Computer Applications

摘　　要：文章提出了一种改进的Wu Manber多关键词匹配算法。Wu Manber算法是在BoyerAn improved WuManber algorithm was presented in this article,which is a multiple patterns match algorithm from the BoyerMoore pattern match algorithm family. It analyzed and compared the two algorithms,got two ways to improve the WuManber algorithm:precise bad (block) character shift and weakened good suffix shift. In our comparing experiment,the improved algorithm required 8～15% less time than the WuManber algorithm on large scale data set.

关 键 词：多关键词匹配 信息扫描 字符串匹配 匹配 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]