Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem

In this paper, we design genetic algorithm and simulated annealing algorithm and their parallel versions to solve the Closest String Problem. Our implementation and experiments show usefulness of the parallel GA and SA algorithms.

[1]  Bin Ma,et al.  Finding similar regions in many strings , 1999, STOC '99.

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Bin Ma,et al.  Distinguishing string selection problems , 2003, SODA '99.

[4]  A. Litman,et al.  On covering problems of codes , 1997, Theory of Computing Systems.

[5]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.