In this note we present three efficient variations of the occurrence heuristic, adopted by many exact string matching algorithms and first introduced in the well-known Boyer-Moore algorithm. Our first heuristic, called improved-occurrence heuristic, is a simple improvement of the rule introduced by Sunday in his Quick-Search algorithm. Our second heuristic, called worst-occurrence heuristic, achieves its speed-up by selecting the relative position which yields the largest average advancement. Finally, our third heuristic, called jumping-occurrence heuristic, uses two characters for computing the next shift. Setting the distance between these two characters optimally allows one to maximize the average advancement. The worst-occurrence and jumping-occurrence heuristics tune their parameters according to the distribution of the characters in the text. Experimental results show that the newly proposed heuristics achieve very good results on average, especially in the case of small alphabets.
|Titolo:||Improved and Self-Tuned Occurrence Heuristics|
|Data di pubblicazione:||2014|
|Citazione:||Improved and Self-Tuned Occurrence Heuristics / CANTONE D; FARO S. - In: JOURNAL OF DISCRETE ALGORITHMS. - ISSN 1570-8667. - 28(2014), pp. 73-84.|
|Appare nelle tipologie:||1.1 Articolo in rivista|