## Abstract

In this paper we study the closest-string problem (CSP), which can be defined as follows: Given a finite set ℒ = [s^{1}, s ^{2},...,s^{n}} of strings, each string with length m, find a center string t of length m minimizing d, such that for every string s ^{i} ∈ ℒ, d_{H}(t, s^{i}) ≤ d. By d _{H}(t, s^{i}) we mean the Hamming distance between t and s ^{i}. This is an NP-hard problem, with applications in molecular biology and coding theory. Even though there are good approximation algorithms for this problem, and exact algorithms for instances with d constant, there are no studies trying to solve it exactly for the general case. In this paper we propose three integer-programming (IP) formulations and a heuristic, which is used to provide upper bounds on the value of an optimal solution. We report computational results of a branch-and-bound algorithm based on one of the IP formulations, and of the heuristic, executed over randomly generated instances. These results show that it is possible to solve CSP instances of moderate size to optimality.

Original language | English (US) |
---|---|

Pages (from-to) | 419-429 |

Number of pages | 11 |

Journal | INFORMS Journal on Computing |

Volume | 16 |

Issue number | 4 |

DOIs | |

State | Published - Sep 2004 |

Externally published | Yes |

## Keywords

- Branch-and-bound algorithms
- Closest-string problem
- Computational biology
- Mathematical programming