Optimal solutions for the closest-string problem via integer programming

DOI10.1287/IJOC.1040.0090MaRDI QIDQ2890443zbMATH OpenOpenAlexFDO

Authors Cláudio N. Meneses, Zhaosong Lu, Carlos A. S. Oliveira, Panos M. Pardalos

Publication date 8 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1040.0090

zbMATH Keywords

branch-and-bound algorithmsclosest-string problemcomputational biologymathematical programming

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational methods for problems pertaining to biology (92-08) Protein sequences, DNA sequences (92D20)

Recommendations

• A closer look at the closest string and closest substring problem
• Exact algorithm and heuristic for the closest string problem
• An improved integer linear programming formulation for the closest 0-1 string problem
• Improved optimization modelling for the closest string and related problems
• Optimum Solution of the Closest String Problem via Rank Distance

Cited in

(21)

• An improved integer linear programming formulation for the closest 0-1 string problem
• Mathematical programming in computational biology: an annotated bibliography
• Efficient solutions for the far from most string problem
• 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
• Improved LP-based algorithms for the closest string problem
• A parallel multistart algorithm for the closest string problem
• An algorithm for the maximum likelihood problem on evolutionary trees
• Randomized fixed-parameter algorithms for the closest string problem
• Optimum Solution of the Closest String Problem via Rank Distance
• Configurations and minority in the string consensus problem
• A combined greedy-walk heuristic and simulated annealing approach for the closest string problem
• The selective fixing algorithm for the closest string problem
• On the hardness of the consensus string problem
• A three-string approach to the closest string problem
• A recursive exact algorithm for the closest string problem
• A closer look at the closest string and closest substring problem
• An optimization modelling for string selection in molecular biology using Pareto optimality
• Improved optimization modelling for the closest string and related problems
• Exact algorithm and heuristic for the closest string problem
• Efficient algorithms for consensus string problems minimizing both distance sum and radius

This page was built for publication: Optimal solutions for the closest-string problem via integer programming

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