Skip to main content

Context-Based Repeated Sequences in Linear Genetic Programming

  • Conference paper
Book cover Genetic Programming (EuroGP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3447))

Included in the following conference series:

Abstract

Repeating code sequences are found in both artificial and natural genomes as an emergent phenomenon. These patterns are of interest in researching both how evolution reuses code segments to create superior individuals and whether building blocks are used in the formation of repeated sequences. We describe a GP representation using a special type of crossover that is more conducive to the formation of repeated sequences than traditional GP. We then establish that the repeated sequence phenomenon in the implementation displays traits of building blocks by establishing associated regularity of genotype and phenotype elements.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Soule, T., Heckendorn, R.B.: An Analysis of the Causes of Code Growth in Genetic Programming. Genetic Programming and Evolvable Machines 3(3), 283–309 (2002)

    Article  MATH  Google Scholar 

  2. Langdon, W.B., Banzhaf, W.: Repeated Sequences in Linear GP Genomes. GECCO Late-breaking Papers CD-ROM (2004)

    Google Scholar 

  3. Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)

    MATH  Google Scholar 

  4. Koza, J.R.: Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  5. Langdon, W.B., Poli, R.: Why Ants are Hard. In: Gentic Programming 1998: Proceedings of the Third Annual Conference, pp. 193–201 (1998)

    Google Scholar 

  6. Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  7. Huelsbergen, L.: Toward Simulated Evolution of Machine-Language Iteration. In: Proceedings of the 1st Conference on Genetic Programming, pp. 315–320 (1996)

    Google Scholar 

  8. Heywood, M.I., Zincir-Heywood, A.N.: Dynamic Page-Based Crossover in Linear Genetic Programming. IEEE Transactions on Systems, Man and Cybernetics—Part B: Cybernetics 32(3), 380–388 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wilson, G.C., Heywood, M.I. (2005). Context-Based Repeated Sequences in Linear Genetic Programming. In: Keijzer, M., Tettamanzi, A., Collet, P., van Hemert, J., Tomassini, M. (eds) Genetic Programming. EuroGP 2005. Lecture Notes in Computer Science, vol 3447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31989-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31989-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25436-2

  • Online ISBN: 978-3-540-31989-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics