Finding the Position of the k-Mismatch and Approximate Tandem Repeats

Given a pattern P, a text T, and an integer k, we want to find for every position j of T, the index of the k-mismatch of P with the suffix of T starting at position j. We give an algorithm that finds the exact index for each j, and algorithms that approximate it. We use these algorithms to get an efficient solution for an approximate version of the tandem repeats problem with k-mismatches