Exact algorithm and heuristic for the closest string problem

DOI10.1016/j.cor.2011.01.009zbMath1219.90105OpenAlexW2066812960MaRDI QIDQ716344

Holger Mauch, Zhifeng Hao, Shenghan Liu, Xiao-Lan Liu

Publication date: 28 April 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.009

zbMATH Keywords

heuristicexact algorithmclosest string problemlocal search strategies

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Biochemistry, molecular biology (92C40)

Related Items (6)

The selective fixing algorithm for the closest string problem ⋮ An improved integer linear programming formulation for the closest 0-1 string problem ⋮ A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ LP-based heuristics for the distinguishing string and substring selection problems ⋮ Application of negative learning ant colony optimization to the far from most string problem ⋮ Improved LP-based algorithms for the closest string problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distinguishing string selection problems.
• A parallel multistart algorithm for the closest string problem
• Optimal Solutions for the Closest-String Problem via Integer Programming
• On the closest string and substring problems

This page was built for publication: Exact algorithm and heuristic for the closest string problem