Efficient Pattern Matching on Binary Strings

Simone Faro, Thierry Lecroq

The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem…