Optimal Solutions for the Closest-String Problem via Integer Programming

DOI10.1287/ijoc.1040.0090zbMath1239.90077OpenAlexW2144355282MaRDI QIDQ2890443

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

mathematical programmingcomputational biologybranch-and-bound algorithmsclosest-string problem

Mathematics Subject Classification ID

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

Related Items (15)

Configurations and minority in the string consensus problem ⋮ A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ Mathematical programming in computational biology: an annotated bibliography ⋮ On the hardness of the consensus string problem ⋮ A three-string approach to the closest string problem ⋮ An optimization modelling for string selection in molecular biology using Pareto optimality ⋮ Improved optimization modelling for the closest string and related problems ⋮ 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 ⋮ A parallel multistart algorithm for the closest string problem ⋮ Exact algorithm and heuristic for the closest string problem ⋮ Efficient algorithms for consensus string problems minimizing both distance sum and radius ⋮ An algorithm for the maximum likelihood problem on evolutionary trees ⋮ Randomized fixed-parameter algorithms for the closest string problem

This page was built for publication: Optimal Solutions for the Closest-String Problem via Integer Programming