A Multi-repeat Pattern Matching Algorithm Based on Suffix Arrays
Zhang Li · Journal of Jiamusi University · 2010
To find a multi-repeat pattern quickly in the vast amounts of information,the time complexity is O(n2) in ordinary string matching algorithms.Therefore,it is necessary to improve the efficiency of pattern-matching algorithms.Here,a fast algorithm of pattern matching was proposed based on suffix arrays.When the algorithm is used to find high-frequency words in English text,it can run within the time complexity O(n).