I have been doing a lot of research into pattern matching algorithms. For some background I am searching a long binary alphabet text consisting of considerably more 0s than 1s. The individual patterns I am searching for are of the form 11111, 1*1*1*1*1, 1**1**1**1**1**1, etc, where * is the Don't Care symbol (so either 1 or 0). I think that Boyer-Moore would be quite effective, however I understand that Boyer-Moore string matching can't be modified to work with Don't Care symbols. Is there something with this ability and similar performance?
Boyer-Moore with Don't Cares
algorithms;search algorithms;strings