A recursive exact algorithm for the closest string problem

MaRDI QIDQ4995289zbMATH OpenFDO

Authors Omar Latorre Vilca, Mario Jun. Salvatierra

Publication date 23 June 2021

zbMATH Keywords

maximum Hamming distance

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35)

Recommendations

• Exact algorithm and heuristic for the closest string problem
• scientific article; zbMATH DE number 2081011
• A GRASP algorithm for the closest string problem using a probability-based heuristic
• Optimal solutions for the closest-string problem via integer programming
• Randomized and Parameterized Algorithms for the Closest String Problem

Cited in

(11)

• A GRASP algorithm for the closest string problem using a probability-based heuristic
• A heuristic algorithm based on Lagrangian relaxation for the closest string problem
• A parallel multistart algorithm for the closest string problem
• A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
• Designing and Implementing Algorithms for the Closest String Problem
• Enumerating Neighbour and Closest Strings
• Randomized and Parameterized Algorithms 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
• Exact algorithm and heuristic for the closest string problem
• On a cyclic string-to-string correction problem

This page was built for publication: A recursive exact algorithm for the closest string problem

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