Genetic Code Degeneracy: Implications for Grammatical Evolution and Beyond (1999) [14 citations — 8 self]
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.
Citations
| 713 | Genetic Programming – Koza - 1992 |
| 265 | The Neutral Theory of Molecular Evolution – Kimura - 1983 |
| 72 | Grammatical Evolution: Evolving Programs for an Arbitrary Language – Ryan, Collins, et al. - 1998 |
| 29 | Effects of neutral selection on the evolution of molecular species – Newman, Engelhardt - 1998 |
| 25 | Genetic Programming and Data Structures – Langdon - 1998 |
| 21 | Grammatical Evolution: A Steady State Approach – Ryan, O'Neill - 1998 |
| 10 | Principles of Modern Genetics – D, D - 1995 |
| 10 | Evolving Multi-line Compilable C Programs – O'Neill, Ryan - 1999 |
| 1 | Replication and Mutation on Neutral Networks. Santa Fe Institute Working Paper 98-04-036 – Reidys, Forst, et al. |

