Algorithm for linear pattern matching?

Question

I have a linear list of zeros and ones and I need to match multiple simple patterns and find the first occurrence. For example, I might need to find 0001101101,

Answer 1

Yes.

The Boyer–Moore string search algorithm

See also: Knuth–Morris–Pratt algorithm