Optimal-Mismatch

Variation of Quick-Search using probabilities of characters. It compares the pattern and the text proceeding from the less frequent to the more frequent character.

Appeared in:

• [96]: Sunday, D.: A very fast substring search algorithm. Commun. ACM 33(8), 132–142 (1990), http://doi.acm.org/10.1145/79173.79184 ↗