UCL  IRIS
Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at http://www.ucl.ac.uk/finance/research/post_award/post_award_contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Repeated Sequences in Linear Genetic Programming Genomes
  • Publication Type:
    Journal article
  • Publication Sub Type:
    Article
  • Authors:
    Langdon WB, Banzhaf W
  • Publication date:
    2005
  • Place of publication:
    USA
  • Pagination:
    285, 306
  • Journal:
    Complex Systems
  • Volume:
    15
  • Issue:
    4
  • Print ISSN:
    0891-2513
  • Keywords:
    genetic algorithms, genetic programming, Evolutionary computation, artificial evolution, repeated sequences, hierarchical building blocks, repetitive elements, microsatellites, unequal crossover, duplication tandemly repeated genes, growth of genomes, repeats finder, SSR tracts, GPengine, Discipulus
  • Notes:
    Extended version of langdon:2004:geccolb
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 appears 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.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Author
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by