The selective fixing algorithm for the closest string problem
From MaRDI portal
Publication:336747
DOI10.1016/J.COR.2013.07.017zbMATH Open1348.90472OpenAlexW2011389177MaRDI QIDQ336747FDOQ336747
Authors: Michele Garraffa, F. Della Croce 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.017
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
Cited In (9)
- Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
- Randomized and Parameterized Algorithms for the Closest String Problem
- Designing and Implementing Algorithms for the Closest String Problem
- On the role of metaheuristic optimization in bioinformatics
- On a cyclic string-to-string correction problem
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- Optimum Solution of the Closest String Problem via Rank Distance
- An improved integer linear programming formulation for the closest 0-1 string problem
- Improved LP-based algorithms for the closest string problem
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)
