|
Volumn , Issue , 2008, Pages 702-705
|
A compounded genetic and simulated annealing algorithm for the closest string problem
|
Author keywords
Closest string problem; Computational biology; Genetic algorithm; Hybrid methods; Simulated annealing
|
Indexed keywords
BIOCHEMISTRY;
BIOCOMMUNICATIONS;
BIOINFORMATICS;
BIOMEDICAL ENGINEERING;
BOOLEAN FUNCTIONS;
COMPUTER PROGRAMMING;
DIESEL ENGINES;
GENETIC ALGORITHMS;
HEURISTIC PROGRAMMING;
INFORMATION SCIENCE;
INFORMATION THEORY;
MOLECULAR BIOLOGY;
NUCLEAR PROPULSION;
PROGRAMMING THEORY;
SOLUTIONS;
CLOSEST STRING PROBLEM;
COMPUTATIONAL BIOLOGY;
GENETIC ALGORITHM;
GENETIC AND SIMULATED ANNEALING ALGORITHM;
HYBRID METHODS;
SIMULATED ANNEALING;
|
EID: 50949122977
PISSN: None
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICBBE.2008.171 Document Type: Conference Paper |
Times cited : (10)
|
References (8)
|