Improved algorithms for multiple patterns matching
Hongli Zhang · Ha'erbin gongye daxue xuebao · 2007
Combined with the advantages of the Tuned Boyer-Moore algorithm,an effective algorithm for performing multiple patterns matching in a string was put forward on the concept of deterministic finite state automata(DFSA),and achieved better performance by shifting unmatched characters consecutively.Experimental results indicate that,to search a string,the algorithm takes only 1/2～1/3 that of AC and 9/10 of AQR in case of short patterns while the ratio is 1/4～1/8 and 3/4 in case of long patterns.