Summary: The Boyer-Moore idea applied in exact string matching is generalized to approximate string matching. Two versions of the problem are considered. The \(k\) mismatches problem is to find all approximate occurrences of a pattern string (length \(m\)) in a text string (length \(n\)) with at most \(k\) mismatches. The generalized Boyer-Moore algorithm is shown (under a mild independence assumption) to solve the problem in expected time \(O(kn(1/(m-k)+(k/c)))\), where \(c\) is the size of the alphabet. A related algorithm is developed for the \(k\) differences problem, where the task is to find all approximate occurrences of a pattern in a text with \(\leq k\) differences (insertions, deletions, changes). Experimental evaluation of the algorithms is reported, showing that the new algorithms are often significantly faster than the old ones. Both algorithms are functionally equivalent with the Horspool version of the Boyer-Moore algorithm when \(k=0\).