Optimal superprimitivity testing for strings
Information Processing Letters
An on-line string superprimitivity test
Information Processing Letters
Efficient detection of quasiperiodicities in strings
Theoretical Computer Science
Alphabet dependence in parameterized matching
Information Processing Letters
An optimal algorithm to compute all the covers of a string
Information Processing Letters
A correction to “An optimal algorithm to compute all the covers of a string”
Information Processing Letters
Multiple matching of parameterized patterns
Theoretical Computer Science
Parameterized pattern matching: algorithms and applications
Journal of Computer and System Sciences
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximate parameterized matching
ACM Transactions on Algorithms (TALG)
On the Longest Common Parameterized Subsequence
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Generalized approximate regularities in strings
International Journal of Computer Mathematics
SAT-encodings, search space structure, and local search performance
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Cover array string reconstruction
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
New complexity results for the k-covers problem
Information Sciences: an International Journal
| Hi-index | 5.23 |
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.