Hello, I'm studying multi-pattern matching and I was browsing the source code for ClamAV's implementation of a multi-pattern matcher (Wu-Maber based) algorithm.
I've got a question regarding the block and minimum size values. At the moment, both the block size and the minimum pattern length are set to 3 bytes. If I understood the algorithm correctly, this means that the only possible shift values are either 0 (at which point a match is possible), or 1 (minimum pattern size - block size + 1). If this is the case, given that the algorithm can only move at most one byte at a time, what is the advantage of using this algorithm instead of Aho-Corasick (besides space efficiency) ? Thank you for your time. Best regards, -Alexandre Dias _______________________________________________ http://lurker.clamav.net/list/clamav-devel.html Please submit your patches to our Bugzilla: http://bugs.clamav.net
