The set of parameterized \(k\)-covers problem

DOI10.1016/j.tcs.2011.12.052zbMath1237.68088OpenAlexW2059909702MaRDI QIDQ418000

V. Yu. Popov, A. A. Gorbenko

Publication date: 14 May 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.052

zbMATH Keywords

NP-completelogical modelsparameterized pattern matchingset of \(k\)-covers

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New complexity results for the \(k\)-covers problem
• Multiple matching of parameterized patterns
• Efficient detection of quasiperiodicities in strings
• Optimal superprimitivity testing for strings
• An on-line string superprimitivity test
• Alphabet dependence in parameterized matching
• An optimal algorithm to compute all the covers of a string
• Parameterized pattern matching: Algorithms and applications
• On the Longest Common Parameterized Subsequence
• Cover Array String Reconstruction
• Approximate parameterized matching
• Generalized approximate regularities in strings
• ALGORITHMS FOR APPROXIMATE K-COVERING OF STRINGS
• Computing the cover array in linear time

This page was built for publication: The set of parameterized \(k\)-covers problem