A New Fast String Matching Algorithm for Content Filtering and Detection

String matching algorithms are very important analyzing methods in content filtering and detection In this paper, some existing string matching algorithms are analyzed first, and then a new multi pattern string matching algorithm is presented The new algorithm adopts the BM algorithm’s shift methods, uses the suffix tree algorithm to get the maximum shift value, and employs the AC algorithm’s automaton in a matching string Analytical and experimental results show that the new algorithm is faster in searching large sets of patterns