A Space-Efficient Implementation of the Good-Suffix Heuristic.
Domenico Aldo Cantone, Salvatore Cristofaro, Simone Faro · 2010
Abstract. We present an efficient variation of the good-suffix heuristic, firstly intro-duced in the well-known Boyer-Moore algorithm for the exact string matching problem. Our proposed variant uses only constant space, retaining much the same time efficiency of the original rule, as shown by extensive experimentation.