eprintid: 576
rev_number: 4
eprint_status: archive
userid: 1
dir: disk0/00/00/05/76
datestamp: 2005-07-28 12:00:00
lastmod: 2015-07-18 22:11:26
status_changed: 2008-01-09 13:19:28
type: article
metadata_visibility: show
creators_name: Langdon, W.B.
creators_name: Banzhaf, W.
title: Repeated sequences in linear genetic programming genomes
ispublished: pub
subjects: 8020
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.
date: 2005
date_type: published
official_url: http://www.complex-systems.com/Archive/hierarchy/abstract.cgi?vol=15&iss=4&art=02
oa_status: green
language: eng
primo: open
primo_central: open_green
full_text_status: public
publication: Complex Systems
volume: 15
number: 4 (c)
pagerange: 285-306
refereed: TRUE
issn: 0891-2513
citation:        Langdon, W.B.;    Banzhaf, W.;      (2005)    Repeated sequences in linear genetic programming genomes.                   Complex Systems , 15  (4 (c))   pp. 285-306.          Green open access   
 
document_url: https://discovery.ucl.ac.uk/id/eprint/576/1/344759_LangdonBanzhaf.pdf