Wu_Manber算法的综合改进  

Multiple improvements of Wu_Manber algorithm

作　　者：黄逸之[1] 尹香兰[1] 

机构地区：[1]江南计算技术研究所

出　　处：《微型机与应用》2014年第19期8-11,共4页Microcomputer & Its Applications

摘　　要：在研究了Wu_Manber算法及其已有改进的基础上,在跳跃距离、匹配过程和并行处理三方面进行了综合改进。改进后的算法跳跃距离最大能达到m+1,有效减少匹配过程中的比较次数,最后充分利用现有的硬件处理能力,进行并行处理,避免模式串集合过度增加后算法效率的下降问题,提高超大文本串的扫描速度。Based on the research of Wu_Manber algorithm and its existing improvements, this paper made three aspects of improvements to the algorithm, including jumping distance, matching procedure and parallel processing. The modified algorithm gains better jumping distance, the max of which is m＋1. The comparison times in matching procedure are also effectively reduced. Taking full advantage of modern hardware, this algorithm operates in parallel mode, which prevents efficiency dropping when pattern set becomes overly large, and increases the scan speeds for huge texts.

关 键 词：多模式匹配 Wu_Manber算法 

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