Neighbor Relationship-Based String Matching Algorithm
Da-Qing Zhou, Lin Juan-ru · Computer Technology and Development · 2006
Giving the arrangement of twenty-six letters,the sequence is exclusive,and the neighbor relationship of the letters in the sequence is a fixed value.Taking advantage of the feature given above,presents a string matching algorithm based on neighbor relationship,to solve the question of long string matching(more than twenty-six).The algorithm transforms the neighbor relationship to a value,and achieves the fast string matching by using this value.The time complexity of the algorithm is О(m-n).By the way,this algorithm has the feature of simplicity and convenience,and it is easy to realize.