1
$\begingroup$

Aho-Corasick can result in a quadratic number of matches because it finds all occurrences of each searched-for substring. What is a faster algorithm or modification to this one to simply determine if there is any occurrence for each of the substrings?

$\endgroup$
1
  • 2
    $\begingroup$ What if you abort processing when a match is found ? $\endgroup$
    – user16034
    Feb 8, 2023 at 8:18

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.