Multiple pattern matching revisited

TL;DR

This paper presents a new approach to multiple pattern matching using q-grams, pattern superimposition, bit-parallelism, and alphabet size reduction, demonstrating good scalability and performance across various alphabet sizes and large pattern sets.

Contribution

It introduces a novel combination of techniques for multiple pattern matching, improving scalability and performance over previous methods.

Findings

Performs well on different alphabet sizes

Scales effectively to large pattern sets

Offers a balanced trade-off of pros and cons

Abstract

We consider the classical exact multiple string matching problem. Our solution is based on $q$-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method performs well on different alphabet sizes and that they scale to large pattern sets.