Forward-Fast-Search

Combination of Fast-Search and Quick-Search. It computes the good-suffix using information about the character following the current window of the text

Appeared in:

• [22]: Cantone, D., Faro, S.: Fast-search algorithms: New efficient variants of the boyer-moore pattern-matching algorithm. Journal of Automata, Languages and Combinatorics 10(5/6), 589–608 (2005)