High speed string matching algorithms

I'm basically benchmarking some high speed string matching algorithms, I came across a few.

1. Backwards Non-deterministic DAWG (Directed acyclic word graph) Matching algorithm by Gonzalo Navarro and Mathieu Raffinot. See "A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching"

2. Horspool's improved version of the Boyer-Moore String searching algorithm. See "Practical fast searching in strings"

3. Shift-Or algorithm with mismatches

4. KMP

Are there any other better high speed string matching algorithms i can try ?

Edit : There is another thread in similar lines , which has good references too