Parameterized Complexity Analysis for the Closest String with Wildcards Problem

DOI10.1007/978-3-319-07566-2_15MaRDI QIDQ5165600zbMATH OpenOpenAlexFDO

Authors Danny Hermelin, Liat Rozenberg

Publication date 30 June 2014

Published in Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-07566-2_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Recommendations

• Parameterized complexity analysis for the closest string with wildcards problem
• Randomized and Parameterized Algorithms for the Closest String Problem
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• Randomized fixed-parameter algorithms for the closest string problem
• scientific article; zbMATH DE number 2086391
• Lower bounds for approximation schemes for Closest String
• Complexity of approximating closest substring problems.
• A recursive exact algorithm for the closest string problem
• scientific article; zbMATH DE number 1615273
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems

Cited in

(1)

• Parameterized complexity analysis for the closest string with wildcards problem

This page was built for publication: Parameterized Complexity Analysis for the Closest String with Wildcards Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5165600)