Molecular Computation for Genetic Algorithms

  • Authors:
  • Juan Castellanos;S. Leiva;J. Rodrigo;Alfonso Rodríguez-Patón

  • Affiliations:
  • -;-;-;-

  • Venue:
  • RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 [1] and Lipton [2].