计算机工程2009，Vol.35Issue(21)：39-41,3.
串匹配算法中的自动机紧缩存储技术
Automaton Compact Representation Technology in String Matching Algorithm
摘要
Abstract
Automaton is one kind of data structure often being used in string matching algorithms. By realizing compact representation of automaton, the algorithm space can be decreased. This paper summarizes several frequently used compact representations of automaton, analyzes their principles, time efficiencies, space efficieneies, merits and demerits, and gives relationships between above methods and sparsity character. It implements the basic AC algorithm with compact representation method. Experimental results of random and real data demonstrate the efficiency of this algorithm.关键词
紧缩存储/自动机/串匹配Key words
compact representation/ automaton/ string matching分类
信息技术与安全科学引用本文复制引用
杨毅夫,刘燕兵,刘萍,郭莉..串匹配算法中的自动机紧缩存储技术[J].计算机工程,2009,35(21):39-41,3.基金项目
国家"973"计划基金资助项目(2007CB311100). （2007CB311100）
