Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach
Computers and Operations Research - Special issue: artificial intelligence, evolutionary programming and operations research
Genotype-Phenotype-Mapping and Neutral Variation - A Case Study in Genetic Programming
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Introducing probabilistic adaptive mapping developmental genetic programming with redundant mappings
Genetic Programming and Evolvable Machines
Simulated Evolution of the Adaptability of the Genetic Code Using Genetic Algorithms
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Natural Computing: an international journal
A case for codons in evolutionary algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
| Hi-index | 0.00 |
The genetic code is a ubiquitous interface between inert genetic information and living organisms, as such it plays a fundamental role in defining the process of evolution. There have been many attempts to identify features of the code that are themselves adaptations. So far, the strongest evidence for an adaptive code is that the assignments of amino acids (encoded objects) to codons (coding units) appear to be organized so as to minimize the change in amino acid hydrophobicity that results from random mutations. One possibility not previously discussed is that this feature of the code may in fact represent an adaptation to maximize the efficiency of adaptive evolution, particularly given the maximized connectedness of protein fitness landscapes afforded by the redundancy of the code.