The Prague Stringology Conference 2003

Domenico Cantone and Simone Faro

Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm

We present a variation of the Fast-Search string matching algorithm, a recent member of the large family of Boyer-Moore-like algorithms, and we compare it with some of the most effective string matching algorithms, such as Horspool, Quick Search, Tuned Boyer-Moore, Reverse Factor, Berry-Ravindran, and Fast-Search itself. All algorithms are compared in terms of run-time efficiency, number of text character inspections, and number of character comparisons. It turns out that our new proposed variant, though not linear, achieves very good results especially in the case of very short patterns or small alphabets.

Download paper: Article in PostScript Article in PDF
 PostScript   PDF