Compressed Multiple Pattern Matching

Dmitry Kosolobov, Nikita Sivukhin

Given $d$ strings over the alphabet $\{0,1,\dots ,\sigma -1\}$, the classical Aho--Corasick data structure allows us to find all $occ$ occurrences of the strings in any text $T$ in $O(…