In 2005, hybrid algorithm have been proposed by considering the advantage of best case or average case time of Sunday algorithm; Hybrid of Sunday algorithm and Knuth-Morris-Pratt algorithm and known as FJS algorithm .
4 Hybrid pattern-matching algorithm based on Boyer-Moore and Knuth-Morris-Pratt algorithm
In 2012, again the fast multithreaded implementation of hybrid string matching algorithm hybrid of Boyer-Moore and Knuth-Morris-Pratt has been proposed.
For string matching, empirical results show that the new algorithm compares favorably with the Knuth-Morris-Pratt (KMP) algorithm  for any pattern length and the Boyer-Moore (BM) algorithm  for short patterns (up to length 6).
Our algorithm is based on finite automata theory, as in the Knuth-Morris-Pratt algorithm , and also exploits the finiteness of the alphabet, as in the Boyer-Moore algorithm .
The algorithms implemented are Boyer-Moore, as suggested by Horspool  (BMH), which according to Baeza-Yates , is the fastest practical version of this algorithm; Knuth-Morris-Pratt, as suggested by their authors , and our new algorithm (SO) using the KMP idea (first scan for the first character of the pattern.
Two of the most notable algorithms, published over a decade ago, are the Knuth-Morris-Pratt (KMP)  and the Boyer-Moore (BM)  algorithms.
Additional Key Words and Phrases: Boyer-Moore, Knuth-Morris-Pratt, pattern, search, substring