串匹配算法中模式串与文本之间关系的研究  

Research on Relationship Between Patterns and Text in String Matching Algorithms

作　　者：刘萍[1,2] 刘燕兵[1,3,2] 郭莉[1,2] 方滨兴[1,2] 

机构地区：[1]中国科学院计算技术研究所,北京100190 [2]信息内容安全技术国家工程实验室,北京100190 [3]中国科学院研究生院,北京100049

出　　处：《软件学报》2010年第7期1503-1514,共12页Journal of Software

基　　金：国家重点基础研究发展计划(973)No.2007CB311100~~

摘　　要：经典的串匹配算法设计和分析中假设"字符互相独立并且等概率出现",这与实际应用环境差异很大,导致出现很多问题.考虑了字符的概率分布和上下文的关联,同时兼顾应用的方便,提出了命中密度的概念.在给出基本定义和扩展定义后,通过对4种类型的代表性算法的理论和实验分析,给出了命中密度与算法性能之间的关系.同时,在对命中密度的分析中得出一些极具价值的结论.对命中密度概念的多角度理解以及对它与算法性能关系的深入剖析都说明,命中密度作为一个特征量,可以从一个侧面刻画模式串和文本之间的相关性,它对算法的设计和分析以及串匹配领域研究工作的扩展都具有指导意义.It was assumed that the pattern and text characters are independent and uniformly distributed over a finite alphabet in classical string matching algorithms, and this assumption differs from real applications and causes many problems. Considering the probability distributions, the contexts of the characters, and the convenience of applications, this paper gives a concept hit rate and four extended concepts about it. Then it gives the theory analysis and detailed experiments with hit rate on the four classical algorithms. The map of the relationships is obtained between the hit rate and the algorithms＇ performance, and at the same time some valuable conclusions are made through above work. As a character variable, hit rate describes the relativity of patterns and text and can serve as guidelines in the algorithms design, analysis and some other extended research fields of the string matching.

关 键 词：串匹配 字符概率分布 字符串相关性 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]