UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Repeated sequences in linear genetic programming genomes

Langdon, W.B.; Banzhaf, W.; (2005) Repeated sequences in linear genetic programming genomes. Complex Systems , 15 (4 (c)) pp. 285-306. Green open access

[thumbnail of 344759_LangdonBanzhaf.pdf]
Preview
PDF
344759_LangdonBanzhaf.pdf

Download (428kB)

Abstract

Biological chromosomes are replete with repetitive sequences, micro satellites, SSR tracts, ALU, etc. in their DNA base sequences. We started looking for similar phenomena in evolutionary computation. First studies find copious repeated sequences, which can be hierarchically decomposed into shorter sequences, in programs evolved using both homologous and two point crossover but not with headless chicken crossover or other mutations. In bloated programs the small number of effective or expressed instructions appear in both repeated and nonrepeated code. Hinting that building-blocks or code reuse may evolve in unplanned ways. Mackey-Glass chaotic time series prediction and eukaryotic protein localisation (both previously used as artificial intelligence machine learning benchmarks) demonstrate evolution of Shannon information (entropy) and lead to models capable of lossy Kolmogorov compression. Our findings with diverse benchmarks and GP systems suggest this emergent phenomenon may be widespread in genetic systems.

Type: Article
Title: Repeated sequences in linear genetic programming genomes
Open access status: An open access version is available from UCL Discovery
Publisher version: http://www.complex-systems.com/Archive/hierarchy/a...
Language: English
URI: https://discovery.ucl.ac.uk/id/eprint/576
Downloads since deposit
331Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item