메뉴 건너뛰기




Volumn 3316, Issue , 2004, Pages 205-211

Closest substring problem - Results from an evolutionary algorithm

Author keywords

Closest String Problem; Closest Substring Problem; Genetic Algorithm; Radius of Code

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BIOINFORMATICS; COMPUTER PROGRAMMING; GENETIC ALGORITHMS; OPTIMIZATION;

EID: 35048898094     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30499-9_30     Document Type: Article
Times cited : (3)

References (13)
  • 1
    • 15944400683 scopus 로고    scopus 로고
    • Genetic algorithm approach for the closest string problem
    • Stanford, California, August 11-14, 2003, IEEE Computer Society Press
    • Mauch, H., Melzer, M.J., Hu, J.S.: Genetic algorithm approach for the closest string problem. In: Proceedings of the 2003 IEEE Bioinformatics Conference (CSB2003), Stanford, California, August 11-14, 2003, IEEE Computer Society Press (2003) 560-561
    • (2003) Proceedings of the 2003 IEEE Bioinformatics Conference (CSB2003) , pp. 560-561
    • Mauch, H.1    Melzer, M.J.2    Hu, J.S.3
  • 3
    • 84937395783 scopus 로고    scopus 로고
    • Approximation algorithms for hamming clustering problems
    • CPM 2000. Springer-Verlag
    • Gasienic, L., Jansson, J., Lingas, A.: Approximation algorithms for hamming clustering problems. In: CPM 2000. Volume 1848 of LNCS., Springer-Verlag (2000) 108-118
    • (2000) LNCS , vol.1848 , pp. 108-118
    • Gasienic, L.1    Jansson, J.2    Lingas, A.3
  • 4
    • 70350646559 scopus 로고    scopus 로고
    • Exact solutions for closest string and related problems
    • Eades, P., Takaoka, T., eds.: ISAAC 2001. Springer-Verlag
    • Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for closest string and related problems. In Eades, P., Takaoka, T., eds.: ISAAC 2001. Volume 2223 of LNCS., Springer-Verlag (2001) 441-453
    • (2001) LNCS , vol.2223 , pp. 441-453
    • Gramm, J.1    Niedermeier, R.2    Rossmanith, P.3
  • 6
    • 0141653290 scopus 로고    scopus 로고
    • On the closest string and substring problems
    • Li, M., Ma, B., Wang, L.: On the closest string and substring problems. Journal of the ACM 49 (2002) 157-171
    • (2002) Journal of the ACM , vol.49 , pp. 157-171
    • Li, M.1    Ma, B.2    Wang, L.3
  • 7
    • 0003913211 scopus 로고    scopus 로고
    • Bäck, T., Fogel, D.B., Michalewicz, Z., eds.: Institute of Physics Publishing, Bristol, UK
    • Bäck, T., Fogel, D.B., Michalewicz, Z., eds.: Evolutionary Computation 1 - Basic Algorithms and Operators. Institute of Physics Publishing, Bristol, UK (2000)
    • (2000) Evolutionary Computation 1 - Basic Algorithms and Operators


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