Probe into the Algorithm of Alphabetic String Model Matching KMP

Jiang Wen-pei · 2001

The article analyses the two algorithms of alphabetic string model matching BF and alphabetic string Model matching KMP, put forward the improved means of KMP analysis and by ways of complex analysis and computer experiment,gets the conclusion that the improved algorithm of KMPA is more effective than that of KMP in the condition of matching alphabetic string model

Read the paper · More papers on PaperTik