Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm
Domenico Cantone, Simone Faro · Universitätsbibliothek Gießen · 2005
We present two variants of the Boyer-Moore string matching algorithm, named Fast- Search and Forward-Fast-Search, and compare them with some of the most effective string matching algorithms, such as Horspool, Quick Search, Tuned Boyer-Moore, Reverse Factor, and Berry-Ravindran. All algorithms are compared in terms of their run-time efficiency, number of text character inspections, and number of character comparisons. It turns out that the new proposed variants, though not linear, achieve very good results especially in the case of very short patterns or small alphabets.