The selective fixing algorithm for the closest string problem
From MaRDI portal
Recommendations
- Optimal solutions for the closest-string problem via integer programming
- Exact algorithm and heuristic for the closest string problem
- Improved LP-based algorithms for the closest string problem
- A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
- An improved integer linear programming formulation for the closest 0-1 string problem
Cites work
- scientific article; zbMATH DE number 1305456 (Why is no real title available?)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem
- Exact algorithm and heuristic for the closest string problem
- Finding similar regions in many strings
- Improved LP-based algorithms for the closest string problem
Cited in
(9)- Randomized and Parameterized Algorithms for the Closest String Problem
- Improved LP-based algorithms for the closest string problem
- Designing and Implementing Algorithms for the Closest String Problem
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- On the role of metaheuristic optimization in bioinformatics
- On a cyclic string-to-string correction problem
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- An improved integer linear programming formulation for the closest 0-1 string problem
- Optimum Solution of the Closest String Problem via Rank Distance
This page was built for publication: The selective fixing 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 Q336747)
