The set of parameterized k-covers problem

AbstractThe problem of the set of k-covers is a distance measure for strings. Another well-studied string comparison measure is that of parameterized matching. We consider the problem of the set of parameterized k-covers (k-SPC) which combines k-cover measure with parameterized matching. We prove that k-SPC is NP-complete. We describe an approach to solve k-SPC. This approach is based on constructing a logical model for k-SPC

The Generalized Approximate Regularities in Strings

We concentrate on the generalized string regularities and study the minimum approximate λ-cover problem and the minimum approximate λ-seed problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover (resp. seed) problem is to find a set of λ substrings each of equal length that covers x (resp. a superstring of x) with the minimum error, under a variety of distance models containing the Hamming distance, the edit distance and the weighted edit distance. Both problems can be solved in polynomial time