The Conception and Practice for the Integration of KMP Algorithm and Special Substring Sliding Algorithm
Liu Na · Xihua Daxue xuebao. Zhexue shehui kexue ban · 2009
In data structure pattern-matching algorithms,Brute-Force algorithm is an important and basic algorithm,but its performance 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.