Abstract
Grammatical Evolution (GE) is a grammar-based GA which generates computer programs. GE has the distinction that its input is a BNF, which permits it to generate programs in any language, of arbitrary complexity. Part of the power of GE is that it is closer to natural DNA than other Evolutionary Algorithms, and thus can benefit from natural phenomena such as a separation of search and solution spaces through a genotype to phenotype mapping, and a genetic code degeneracy which can give rise to silent mutations that have no effect on the phenotype. It has previously been shown how runs of GE are competitive with GP, and in this paper we analyse the feature of genetic code degeneracy, and its implications for genotypic diversity. Results show that genetic diversity is improved as a result of degeneracy in the genetic code for the problem domains addressed here.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Elseth Gerald D., Baumgardner Kandy D. 1995. Principles of Modern Genetics. West Publishing Company.
Kimura, M. 1983. The Neutral Theory of Molecular Evolution. Cambridge University Press.
Koza, J. 1992. Genetic Programming. MIT Press.
Langdon, W. 1998. Genetic Programming and Data Structures. Kluwer Academic Publishers.
Langton, C.G. 1992. Preface. In C.G. Langton, C. Taylor, J.D. Farmer, and S. Rasmussen, editors, Artificial Life II.
Newman M.E.J., Engelhardt Robin. Effects of neutral selection on the evolution of molecular species. In Proc.R.Soc.London B, 265 pages 1333–1338.
O’Neill M., Ryan C. 1999. Evolving Multi-line Compilable C Programs. In Proceedings of the Second European Workshop on Genetic Programming 1999.
Reidys C., Forst C.V., Schuster P. Replication and Mutation on Neutral Networks. Santa Fe Institute Working Paper 98-04-036.
Ryan C, Collins J.J., O’Neill M. 1998. Grammatical Evolution: Evolving Programs for an Arbitrary Language. In Proceedings of the First European Workshop on Genetic Programming, pages 83–95.
Ryan C, O’Neill M. Grammatical Evolution: A Steady State Approach. In Late Breaking Papers, Genetic Programming 1998, pages 180–185.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Neill, M., Ryan, C. (1999). Genetic Code Degeneracy: Implications for Grammatical Evolution and Beyond. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_21
Download citation
DOI: https://doi.org/10.1007/3-540-48304-7_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66452-9
Online ISBN: 978-3-540-48304-5
eBook Packages: Springer Book Archive