SPIRE
2010
Springer
13 years 3 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
Abstract. The problem of finding a center string that is "close" to every given string arises in computational molecular biology and coding theory. This problem has two v...
COCOON
2010
Springer
13 years 8 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...
GECCO
2009
Springer
13 years 9 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
ADMA
2005
Springer
2005
Springer
Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem
13 years 10 months ago
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 sho...