Search for string allowing for one mismatch in any location of the string

Before you read on, have you looked at biopython? It appears that you want to find approximate matches with one substitution error, and zero insertion/deletion errors i.e. a Hamming distance of 1. If you have a Hamming distance match function (see e.g. the link provided by Ignacio), you could use it like this to do … Read more

Finding how similar two strings are

Ok, so the standard algorithms are: 1) Hamming distance Only good for strings of the same length, but very efficient. Basically it simply counts the number of distinct characters. Not useful for fuzzy searching of natural language text. 2) Levenstein distance. The Levenstein distance measures distance in terms of the number of “operations” required to … Read more