메뉴 건너뛰기




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;

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)
  • 1
    • 10044284095 scopus 로고    scopus 로고
    • Optimal Solutions for the Closest String Problem via Integer Programming
    • Cláudio N. Meneses, Zhaosong Lu, Carlos A. S. Oliveira, Panos M. Pardalos, "Optimal Solutions for the Closest String Problem via Integer Programming", Informs Journal on Computing. vol. 16, pp. 419-429 ,2004.
    • (2004) Informs Journal on Computing , vol.16 , pp. 419-429
    • Meneses, C.N.1    Lu, Z.2    Oliveira, C.A.S.3    Pardalos, P.M.4
  • 3
    • 0141653290 scopus 로고    scopus 로고
    • On the closest string and substring problems
    • M. Li, B. Ma, and L. Wang, "On the closest string and substring problems", Journal of the ACM, vol. 49, pp. 157-171, 2002.
    • (2002) Journal of the ACM , vol.49 , pp. 157-171
    • Li, M.1    Ma, B.2    Wang, L.3
  • 4
    • 15944400683 scopus 로고    scopus 로고
    • Holger Mauch, Michael-J. Melzer, and John-S. Hu, Genetic algorithm approach for the closest string problem, Proceedings of the 2003 IEEE Bioinformatics Conference(CSB2003), Stanford, California,: IEEE Computer Society Press, pp. 560-561,2003.
    • Holger Mauch, Michael-J. Melzer, and John-S. Hu, "Genetic algorithm approach for the closest string problem", Proceedings of the 2003 IEEE Bioinformatics Conference(CSB2003), Stanford, California,: IEEE Computer Society Press, pp. 560-561,2003.
  • 5
    • 12444338793 scopus 로고
    • Genetic simulated annealing and application to non-slicing floorplan design
    • Technical Report UCSC-CRL-95-52, University of California, Santa Cruz
    • Seiichi Koakutsu, Maggie Kang, and Wayne Wei-Ming Dai, "Genetic simulated annealing and application to non-slicing floorplan design", Technical Report UCSC-CRL-95-52, University of California, Santa Cruz, 1995.
    • (1995)
    • Koakutsu, S.1    Kang, M.2    Wei-Ming Dai, W.3
  • 6
    • 0029184315 scopus 로고
    • Parallel recombinative simulated annealing: A genetic algorithm
    • Samir W. Mahfoud and David E. Goldberg, "Parallel recombinative simulated annealing: A genetic algorithm", Parallel Computing, vol. 21, pp. 1-28, 1995.
    • (1995) Parallel Computing , vol.21 , pp. 1-28
    • Mahfoud, S.W.1    Goldberg, D.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.