A DNA Codification for Genetic Algorithms Simulation
Data(s) |
08/04/2010
08/04/2010
2008
|
---|---|
Resumo |
In this paper we propose a model of encoding data into DNA strands so that this data can be used in the simulation of a genetic algorithm based on molecular operations. DNA computing is an impressive computational model that needs algorithms to work properly and efficiently. The first problem when trying to apply an algorithm in DNA computing must be how to codify the data that the algorithm will use. In a genetic algorithm the first objective must be to codify the genes, which are the main data. A concrete encoding of the genes in a single DNA strand is presented and we discuss what this codification is suitable for. Previous work on DNA coding defined bond-free languages which several properties assuring the stability of any DNA word of such a language. We prove that a bond-free language is necessary but not sufficient to codify a gene giving the correct codification. |
Identificador |
1313-0455 |
Idioma(s) |
en |
Publicador |
Institute of Information Theories and Applications FOI ITHEA |
Palavras-Chave | #DNA Computing #Bond-Free Languages #Genetic Algorithms |
Tipo |
Article |