计算机与数字工程2013，Vol.41Issue(4)：608-610,3.
基于后缀WM匹配算法的改进算法
An Improved Algorithm Based on the Suffix WM Matching Algorithm
摘要
Abstract
With regard to the problem of the repeated matching in WM algorithm based on suffix matching, an improved algorithm is proposed in this paper. When the algorithm detects that the text string has the same prefix, suffix, and suffix of the former m character as the pattern string, during the matching stage, the algorithm would skip the located blocks which have been confirmed in the scanning. Which avoid repeatedly matching the confirmed blocks, reducing the matching overhead. The tested results show that, compared with the original algorithm, the improved algorithm reduces the matching time, and improves the efficiency of the system.关键词
多模式匹配/WM算法/前缀/后缀Key words
multi-pattern matching/ WM-algorithm/ prefix/ suffix分类
信息技术与安全科学引用本文复制引用
蒋晓鸽,武小年,张昭..基于后缀WM匹配算法的改进算法[J].计算机与数字工程,2013,41(4):608-610,3.基金项目
保密通信重点实验室基金(编号:9140C110404110C1106) （编号:9140C110404110C1106）
广西自然科学基金(编号:2012GXNSFAA053224) （编号:2012GXNSFAA053224）
广西研究生教育创新计划(编号:2010105950810M18) （编号:2010105950810M18）
广西教育厅基金(编号:201010LX156,CD10066X)资助. （编号:201010LX156,CD10066X）
