Re^2: Why Boyer-Moore, Horspool, alpha-skip et.al don't work for bit strings. (And is there an alternative that does?)

On x86 there are the MMX instructions that let you operate on 64 bits at a time, which might help.

I already posted a very efficient brute-force algorithm that uses 128-bit shifts to good effect.

The main purpose of this meditation was to try and discover if there are any smart bit-string search algorithms that I haven't discovered; as well as demonstrate that the fast string search algorithm don't work.

GPUs must be really good at shifting bits strings and doing bit-ops

That's the kind of thing that is a possibility. Thanks.

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I'm with torvalds on this

In the absence of evidence, opinion is indistinguishable from prejudice. Agile (and TDD) debunked

Comment on Re^2: Why Boyer-Moore, Horspool, alpha-skip et.al don't work for bit strings. (And is there an alternative that does?)