| 一种基于有序二叉树的多模式匹配算法 |
| |
| 引用本文： | 刘功申,李宁.一种基于有序二叉树的多模式匹配算法[J].小型微型计算机系统,2004,25(7):1387-1392. |
| |
| 作者姓名： | 刘功申 李宁 |
| |
| 作者单位： | 1. 上海交通大学,信息安全学院,上海,200030
2. 曼彻斯特大学,计算机系,英国 |
| |
| 基金项目： | 信息产业部科技发展项目 |
| |
| 摘 要： | 传统的多模式匹配算法是用树型结构的有限自动机实现的 ,它具有很多缺点 .本文提出的多模式匹配算法是基于有序二叉树的多模式匹配算法 .实验证明 ,本文算法不但具有和传统算法相当的查找速度 ,而且构造速度快、内存耗费少 .因此 ,本文提出的算法特别适用于要求动态构造自动机的情况
|
| 关 键 词： | 多模式匹配 DFSA 有序二叉树 |
Multiple Pattern Matching Algorithm Based on Sequential Binary Tree1 |
| |
| Abstract.Multiple Pattern Matching Algorithm Based on Sequential Binary Tree1[J].Mini-micro Systems,2004,25(7):1387-1392. |
| |
| Authors: | Abstract |
| |
| Abstract: | By analyzing the traditional multiple pattern matching algorithm based on tree structure, a new algorithm is proposed by substituting sequential binary tree for tree. The algorithm is suitable for the application which requires preprocessing the patterns dynamically. It is proved by experiment that the algorithm has three features: Its construction process is quick. Its cost of memory is small. At the same time, its searching process is as quick as the traditional algorithm. |
| |
| Keywords: | multiple pattern matching finite state automata sequential binary tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
