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

@inproceedings{Liu2005ParallelGA,
  title={Parallel Genetic Algorithm and Parallel Simulated Annealing Algorithm for the Closest String Problem},
  author={Xuan Liu and Hongmei He and Ondrej S{\'y}kora},
  booktitle={ADMA},
  year={2005}
}
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. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 16 extracted citations

A Genetic Approximation of Closest String via Rank Distance

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing • 2011

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Distinguish string search problems, Processings of the Thirty-first

M. Li, B Ma, L. Wang
Annual ACM Symposium on Theory of • 1999

On Covering Problems of Codes

Theory Comput. Syst. • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…