KMP算法与特殊子串滑动算法整合的构想与实践  

The Conception and Practice for the Integration of KMP Algorithm and Special Substring Sliding Algorithm

作　　者：佟冶[1] 刘娜[2] 

机构地区：[1]渤海大学文理学院,辽宁锦州121013 [2]渤海大学信息中心,辽宁锦州121013

出　　处：《西华大学学报（自然科学版）》2009年第1期29-33,共5页Journal of Xihua University:Natural Science Edition

摘　　要：在数据结构模式匹配算法中,Brute-Force算法是一个重要的基础算法,但是在性能上远不及KMP算法。而理解KMP及其改进算法是一个复杂的问题,其关键是KMP函数的求解过程。通过特殊子串滑动算法与KMP算法整合的实践,简化了特殊问题,省略了KMP函数的求解过程,在很大程度上提高了模式匹配问题的工作效率。In data structure pattern-matching algorithms, Brute-Force algorithm is an important and basic algorithm, but its per- formance is more poorer than that of KMP algorithm. However, it is a complex problem to understand KMP and its improved algorithm, in which the key is solving process of the KMP function. The practice of the integration of KMP Algorithm and Special Substring Sliding Algorithm simplifies the special problems, and it omits the solving process of the KMP function, which to a large extent , improves the efficiency of the pattern matching problem.

关 键 词：模式匹配 Brute-Force算法 KMP算法 子串滑动 

分 类 号：TP311.12[自动化与计算机技术—计算机软件与理论]