Randomized and Parameterized Algorithms for the Closest String Problem

DOI10.1007/978-3-319-07566-2_11MaRDI QIDQ5165596zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Bin Ma, Lusheng Wang

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_11

Mathematics Subject Classification ID

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

Recommendations

• Randomized fixed-parameter algorithms for the closest string problem
• Fixed-parameter algorithms for CLOSEST STRING and related problems
• A recursive exact algorithm for the closest string problem
• Exact algorithm and heuristic for the closest string problem
• Algorithms for closest and farthest string problems via rank distance
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• A randomized algorithm for approximate string matching
• Lower bounds for approximation schemes for Closest String
• The selective fixing algorithm for the closest string problem
• Parameterized complexity analysis for the closest string with wildcards problem

Cited in

(13)

• On the kernelization complexity of string problems
• Designing and implementing algorithms for the closest string problem
• A parallel multistart algorithm for the closest string problem
• Randomized fixed-parameter algorithms for the closest string problem
• Optimum Solution of the Closest String Problem via Rank Distance
• On the kernelization complexity of string problems
• The set of parameterized k-covers problem
• Designing and Implementing Algorithms for the Closest String Problem
• Parameterized complexity analysis for the closest string with wildcards problem
• A recursive exact algorithm for the closest string problem
• Parameterized Complexity Analysis for the Closest String with Wildcards Problem
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• Efficient algorithms for consensus string problems minimizing both distance sum and radius

This page was built for publication: Randomized and Parameterized Algorithms for the Closest String Problem

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