Re:Faster string searching and matching with Rabin-Karp algo...
by perlgeek on Saturday April 07, 2012 @01:33AM
(#3810074)
If I want to match multiple patterns at the same time, wouldn't it be more efficient to build a (possibly tagged) DFA from them? Then the performance would be independent from the number of patterns to match (modulo some startup cost to construct the DFA in the first place).
[ Parent
| on HN ]
There are no comments on this comment yet.