The selective fixing algorithm for the closest string problem

DOI10.1016/j.cor.2013.07.017zbMath1348.90472OpenAlexW2011389177MaRDI QIDQ336747

Michele Garraffa, Frederico 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

zbMATH Keywords

heuristicsclosest string problemcontinuous relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Linear codes (general theory) (94B05)

Related Items (3)

An improved integer linear programming formulation for the closest 0-1 string problem ⋮ On the role of metaheuristic optimization in bioinformatics ⋮ Optimum Solution of the Closest String Problem via Rank Distance

Cites Work

• Unnamed Item
• Exact algorithm and heuristic for the closest string problem
• A heuristic algorithm based on Lagrangian relaxation for the closest string problem
• Improved LP-based algorithms for the closest string problem
• Finding similar regions in many strings

This page was built for publication: The selective fixing algorithm for the closest string problem