Wu-Manber算法性能分析及其改进  

The Performance Analysis of Wu-Manber Algorithm and its Improvement

作　　者：陈瑜[1] 陈国龙[1] 

机构地区：[1]福州大学数学与计算机科学学院,福州350002

出　　处：《计算机科学》2006年第6期203-205,209,共4页Computer Science

基　　金：福建省自然基金资助项目(A0410010);福建省科技三项资助项目(K03012);福建省教育厅资助项目(JA04155)。

摘　　要：在模式匹配中,多模式匹配算法越来越受到人们的关注。本文首先介绍了一些著名的多模式匹配算法,重点介绍了Wu-Manber算法的基本概念及其实现原理,此算法在实践应用中是最有效的。然后提出了对Wu-Manber算法的改进,以解决多模式串长度很短时出现的性能问题。最后,实验数据表明,改进后的Wu-Manber算法,其性能远远优于传统的Wu-Manber算法。In the field of pattern matching, the multiple pattern matching algorithms attract more and more attentions. This paper firstly introduces some famous multiple pattern matching algorithms and puts emphasis on the basic idea and the implementation principle of the Wu-Manber algorithm which is the most efficient in practice. Then, an improvement to the Wu Manber algorithm is provided to solve the problem of performance falling when the patterns are very Short, At last, the experiment data show that the performance of the improved Wu Manber algorithm is much better than the traditional Wu-Manber algorithm.

关 键 词：WU-MANBER算法 多模式匹配 性能分析 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TP301.6[自动化与计算机技术—计算机科学与技术]