摘要
本文通过对字符串模式匹配算法BF与KMP的分析 ,提出了改进KMP算法的方法 ,并通过复杂性分析和上机实验 ,得出在字符串模式匹配时 。
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
出处
《南宁师范高等专科学校学报》
2001年第2期72-74,共3页
Journal of Nanning Junior Teachers College
关键词
字符串
模式匹配
算法
alphabetic string
matching model
algorithm
