Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3584 LNAI, Issue , 2005, Pages 591-597

  Liu, Xuan ^a   He, Hongmei ^a   Sýkora, Ondrej ^a  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DATA MINING; GENETIC ALGORITHMS; SIMULATED ANNEALING;

CLOSEST STRING PROBLEM; PARALLEL SIMULATED ANNEALING ALGORITHM;

PARALLEL ALGORITHMS;

EID: 26944445774     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11527503_70     Document Type: Conference Paper

References (5)

1. Frances, M., Litman, A., On covering problems of codes,Theory of Computing System,30,(1997) 113-119.
2. Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L., Distinguishing string selection problems, Information and Computation, 185,(2003) 41-55.
3. Li, M., Ma B., Wang, L., Distinguish string search problems, Processings of the Thirty-first Annual ACM Symposium on Theory of Computing,(1999) 473-482.
4. Kirkpatrick, S., Gelatt, C., Vecchi, M., Optimization by simulated annealing, Science,220,(1983) 671-680.
5. Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller A., Teller, E., Equation o State Calculations by Fast Computing Machines, J. Chem Phys., 21, (1953) 1087 -1092.