Locating alignments with k differences for nucleotide and amino acid sequences
Gad M. Landau, Uzi Vishkin, Ruth Nussinov · Computer applications in the biosciences · 1988
Given two sequences, a pattern of length m, a text of length n and a positive integer k, we give two algorithms. The first finds all occurrences of the pattern in the text as long as these do not differ from each other by more than k differences. It runs in O(nk) time. The second algorithm finds all subsequence alignments between the pattern and the test with at most k differences. This algorithm runs in O(nmk) time, is very simple and easy to program.