high speed string matching algorithms
===

Iam basically benchmarking some high speed string matching algorithms ,
I came across 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
    http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm

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