Sciweavers

ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
13 years 9 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk