The approximate string matching problem is to find all locations at which a query
of lengthm matches a substring of a text of length n with k-or-fewer differences. Simple and practical bit-vector algorithms have been designed
for this problem, most ...