TY - JOUR
AU - Kytöjoki, Jari
AB - We present three algorithms for exact string matching of multiple patterns. Our algorithms are filtering methods, which apply q -grams and bit parallelism. We ran extensive experiments with them and compared them with various versions of earlier algorithms, e.g., different trie implementations of the Aho--Corasick algorithm. All of our algorithms appeared to be substantially faster than earlier solutions for sets of 1,000--10,000 patterns and the good performance of two of them continues to 100,000 patterns. The gain is because of the improved filtering efficiency caused by q -grams.
TI - Multipattern string matching with q -grams
JF - Journal of Experimental Algorithmics (JEA)
DO - 10.1145/1187436.1187438
DA - 2007-02-09
UR - https://www.deepdyve.com/lp/association-for-computing-machinery/multipattern-string-matching-with-q-grams-4c03ev1xWJ
SP - 1.1
VL - 11
IS - 
DP - DeepDyve
ER -