| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437273 | Theoretical Computer Science | 2012 | 6 Pages |
Abstract
The 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
