Given strings
x, u
and a distance measure
d
, find the minimum number
k
such that
u
is a
k
-approximate cover of
C(x)
.
String X
String U