Evolutionary model with Turing machines.
The development of a large noncoding fraction in eukaryotic DNA and the phenomenon of the code bloat in the field of evolutionary computations show a striking similarity. This seems to suggest that (in the presence of mechanisms of code growth) the evolution of a complex code cannot be attained without maintaining a large inactive fraction. To test this hypothesis we performed computer simulations of an evolutionary toy model for Turing machines, studying the relations among fitness and coding versus noncoding ratio while varying mutation and code growth rates. The results suggest that, in our model, having a large reservoir of noncoding states constitutes a great (long term) evolutionary advantage.
Feverati
Giovanni
G
Laboratoire de Physique Theorique LAPTH, CNRS, UMR 5108, associé à l'Université de Savoie, 9, Chemin de Bellevue, Boîte Postale 110, 74941, Annecy le Vieux Cedex, France. feverati@lapp.in2p3.fr
Musso
Fabio
F
D000465:Algorithms; D005075:Biological Evolution; D003198:Computer Simulation; D003201:Computers; D003205:Computing Methodologies; D004247:DNA / Q000737:chemistry / Q000235:genetics*; D019143:Evolution, Molecular; D005838:Genotype; D008954:Models, Biological; D015233:Models, Statistical; D009154:Mutation; D009716:Numerical Analysis, Computer-Assisted; D010641:Phenotype; D012641:Selection, Genetic
D004247:DNA