计算机应用与软件2012，Vol.29Issue(3)：128-131,4.
一种基于分段匹配的字符串匹配算法
A STRING MATCHING ALGORITHM BASED ON SEGMENTING MATCHING
摘要
Abstract
Existing algorithms have bigger dependence to the pertinence between text and patterns, to avoid this, a string matching algorithm named SM based on segmenting is proposed. This algorithm cuts text first and then matches the patterns, all with the aid of special characters, and it is insensitive to the content and length of patterns in matching course. It is proved that SM algorithm does behave steadily in performance by analysing it and comparing it through experiment both with the classical algorithms, especially in the circumstance of multi-pattern strings matching,SM algorithm performs better than Wu-Manber algorithm in speed and space cost.关键词
BM/Wu-manber/分段/字符串匹配Key words
BM/Wu-manber/Segment/String matching分类
信息技术与安全科学引用本文复制引用
刘许刚,黄海,马宏..一种基于分段匹配的字符串匹配算法[J].计算机应用与软件,2012,29(3):128-131,4.基金项目
国家高技术研究发展计划(2011AA010603). （2011AA010603）
