Biological chromosomes are replete with repetitive
sequences, microsatellites, 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 non-repeated 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.
%0 Journal Article
%1 langdon:2005:CS
%A Langdon, William B.
%A Banzhaf, Wolfgang
%D 2005
%J Complex Systems
%K Discipulus Evolutionary GPengine, SSR algorithms, artificial blocks, building computation, crossover, duplication elements, evolution, finder, frequent genes, genetic genomes, growth hierarchical microsatellites, of patterns, programming, repeated repeats repetitive sequences, tandemly tracts, unequal
%N 4
%P 285--306
%T Repeated Sequences in Linear Genetic Programming
Genomes
%U http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_repeat_linear.ps.gz
%V 15
%X Biological chromosomes are replete with repetitive
sequences, microsatellites, 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 non-repeated 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.
@article{langdon:2005:CS,
abstract = {Biological chromosomes are replete with repetitive
sequences, microsatellites, 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 non-repeated 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.},
added-at = {2008-06-19T17:35:00.000+0200},
author = {Langdon, William B. and Banzhaf, Wolfgang},
biburl = {https://www.bibsonomy.org/bibtex/2b471d5192efc0ea8840c1718a26feb28/brazovayeye},
interhash = {559be28b3d0231ef4c6b77ec9c457cdf},
intrahash = {b471d5192efc0ea8840c1718a26feb28},
issn = {0891-2513},
journal = {Complex Systems},
keywords = {Discipulus Evolutionary GPengine, SSR algorithms, artificial blocks, building computation, crossover, duplication elements, evolution, finder, frequent genes, genetic genomes, growth hierarchical microsatellites, of patterns, programming, repeated repeats repetitive sequences, tandemly tracts, unequal},
notes = {Extended version of \cite{langdon:2004:geccolb}
http://www.complex-systems.com/Archive/hierarchy/abstract.cgi?vol=15&iss=4&art=02},
number = 4,
pages = {285--306},
size = {22 pages},
timestamp = {2008-06-19T17:45:03.000+0200},
title = {Repeated Sequences in Linear Genetic Programming
Genomes},
url = {http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_repeat_linear.ps.gz},
volume = 15,
year = 2005
}