Genetic algorithm approach for the closest string problem

Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003

Volumn , Issue , 2003, Pages 560-561

  Mauch, H ^a   Melzer, M J ^a   Hu, J S ^a  

^a UNIVERSITY OF HAWAII   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOINFORMATICS; C (PROGRAMMING LANGUAGE); COMPUTATION THEORY; COMPUTER PROGRAMMING; GENETIC ALGORITHMS; NUCLEIC ACIDS; PLANTS (BOTANY); VIRUSES;

CLOSEST STRING PROBLEM; COMPUTATIONAL BIOLOGY; GENETIC ALGORITHM APPROACH; OPTIMIZATION PROBLEMS; POST-TRANSCRIPTIONAL GENE SILENCING; SEQUENCE HOMOLOGY; SEQUENCE VARIATIONS; TRANSGENIC PLANTS;

OPTIMIZATION;

EID: 15944400683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSB.2003.1227407     Document Type: Conference Paper

References (7)

1. A. Depicker and M. V. Montagu. Post-transcriptional gene silencing in plants. Current Opinion in Cell Biology, 9:373-382, 1997.
2. M. Frances and A. Litman. On covering problems of codes. Theory of Computing Systems, 30:113-119, 1997.
3. D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA, 1989.
4. J. Gramm, R. Niedermeier, and P. Rossmanith. Exact solutions for closest string and related problems. Lecture Notes in Computer Science, 2223:441-453, 2001.
5. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.
6. M. Li, B. Ma, and L. Wang. On the closest string and substring problems. Journal of the ACM, 49(2):157-171, March 2002.
7. H. Vaucheret, C. Beclin, T. Elmayan, F. Feuerbach, C. Gordon, J. B. Morel, P. Mourrain, J. C. Palauqui, and S. Vernhettes. Transgene-induced gene silencing in plants. Plant Journal, 16:651-659, 1998.