A high efficiency pattern matching algorithm based on KMP
Yu Ye · jOURNAL OF southwest University for Nationalities · 2010
String matching is a fundamental problem in computer science,also one of problems in the study of complexity theory.On the basis of analyzing some pattern matching algorithms commonly used,an improved algorithm based on KMP algorithm,IKMP(Improved-KMP) algorithm,is presented.Based on KMP and by using Good-Character to record the positional information of end character which appears in the pattern string,this paper gets the maximum moving distance of the pattern.Experimental results show that IKMP algorithm can reduce the times of comparing.