Molecular Computation for Genetic Algorithms
- 574 Downloads
In this paper we present a new computational model based on DNA molecules and genetic operations. This model incorporates the theoretic simulation of the main genetic algorithms operations like: selecting individuals from the population to create a new generation, crossing selected individuals, mutating crossed individuals, evaluating fitness of generated individuals, and introducing individuals in the population. This is a first step that will permit the resolution of larger instances of search problems far beyond the scope of exact and exponentially sized DNA algorithms like the proposed by Adleman  and Lipton .
KeywordsGenetic Algorithm Polymerase Chain Reaction Primer Mating Pool Temporary Tube Molecular Computation
Unable to display preview. Download preview PDF.
- 4.Donald Beaver: Universality and Complexity of Molecular Computation. Extended Abstract accepted in the 28th ACM Annual Symposium ‘Theory of Computing’ (STOC) (1996)Google Scholar
- 5.Paul W. K. Rothemund: A DNA and restriction enzyme implementation of Turing machines. In Proceedings of the Second Annual Meeting on DNA Based Computers (1996)Google Scholar
- 6.Warren D. Smith and Allan Schweitzer: DNA Computers in Vitro and Vivo. In Proceedings of the Second Annual Meeting on DNA Based Computers (1996)Google Scholar
- 7.Erzs bet Csuhaj-Varjú, R. Freund, Lila Kari and Gheorghe Paun: DNA computation based on splicing: universality results. In Pacific Symposium on Biocomputing (1996)Google Scholar
- 8.Richard R. Sinden: DNA Structure and Functions. Academic Press (1996)Google Scholar
- 9.J. Sambrook, E. F. Fritsch, and T. Maniatis: Molecular Cloning: A Laboratory Manual. Cold Spring Harbor Press, NY, 2nd edition, (1989)Google Scholar