A comparison of the performance of four exact string matching algorithms
Jonathan P. Leidig, Christian I. Trefftz · 2007
There are numerous exact string matching algorithms that have similar performance characteristics. Which algorithm is best depends on the length of the pattern being searched for, the number of letters in the alphabet and the particular architecture where the program is being executed. Results of experiments on different recent microprocessors, with different word lengths are reported.