Approximate String Searching
Input: Query string Q and target string T in an alphabet S and a scoring function s, and a minimum score r.
Output: The set of k such that for some i < k score(Q,T[i..k]) > r. That is, an approximate match of some substring of T that ends at index k has a score of at least r.
- score(X,Y) is the maximum score for all matchings between X and Y.