A very fast substring search algorithm

This article describes a substring search algorithm that is faster than the Boyer-Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: (1) a “Quick Search” algorithm; (2) a “Maximal Shift” and (3) an “Optimal Mismatch” algorithm.

[1]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[2]  Leonidas J. Guibas,et al.  A new proof of the linearity of the Boyer-Moore string searching algorithm , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[4]  Leonidas J. Guibas,et al.  A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm , 1980, SIAM J. Comput..