Hamming Distance



This is the implementation of Algorithm th

Input:  string x and set U = {u1,, um} of strings where
0 < | u1| = = | um| ≤ |x|
Output:  the minimum number t such that U is a set of approximate
| u1|-covers for x with hamming distance t.


  1. A legal string is based on the English alphabet, no spaces are allowed.
  2. In this program, we use the symbol "~" to separate elements of set U.

 String x:   

 Set U:    


Acknowledgement: This material is based upon work supported by the National Science Foundation under  grant No. CCR-0207673.

Disclaimer: Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.