Skip to main content

Repeated Patterns in Tree Genetic Programming

  • Conference paper

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

Abstract

We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP.

As in linear GP, repetitive patterns are present in large numbers. Size fair crossover limits bloat in automatic programming, preventing the evolution of recurring motifs. We examine these complex properties in detail: e.g. using depth v. size Catalan binary tree shape plots, subgraph and subtree matching, information entropy, syntactic and semantic fitness correlations and diffuse introns. We relate this emergent phenomenon to considerations about building blocks in GP and how GP works.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Britten, R.J., Kohnen, D.E.: Repeated sequences in DNA. Science 161, 529–540 (1968)

    Article  Google Scholar 

  2. Smit, A.F.A.: The origin of interspersed repeats in the human genome. Current Opinions in Genetics and Development 6, 743–748 (1996)

    Article  Google Scholar 

  3. Patience, C., Wilkinson, D.A., Weiss, R.A.: Our retroviral heritage. Trends in Genetics 13, 116–120 (1997)

    Article  Google Scholar 

  4. Lupski, J.R., Weinstock, G.M.: Short, interspersed repetitive DNA sequences in procaryotic genomes. Journal of Bacteriology 174, 4525–4529 (1992)

    Google Scholar 

  5. Toth, G., Gaspari, Z., Jurka, J.: Microsatellites in different eukaryotic genomes: Survey and analysis. Genome Research 10, 967–981 (2000)

    Article  Google Scholar 

  6. Achaz, G., Rocha, E.P.C., Netter, P., Coissac, E.: Origin and fate of repeats in bacteria. Nucleic Acids Research 30, 2987–2994 (2002)

    Article  Google Scholar 

  7. Langdon, W.B., Banzhaf, W.: Repeated sequences in linear genetic programming genomes. Complex Systems (2005) (in press)

    Google Scholar 

  8. O’Reilly, U.M., Oppacher, F.: The troubling aspects of a building block hypothesis for genetic programming. In: Whitley, L.D., Vose, M.D. (eds.) Foundations of Genetic Algorithms 3, pp. 73–88. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  9. Oakley, H.: Two scientific applications of genetic programming: Stack filters and non-linear equation fitting to chaotic data. In: Kinnear Jr., K.E. (ed.) Advances in Genetic Programming, pp. 369–389. MIT Press, Cambridge (1994)

    Google Scholar 

  10. Reinhardt, A., Hubbard, T.: Using neural networks for prediction of the subcellular location of proteins. Nucleic Acids Research 26(9), 2230–2236 (1998)

    Article  Google Scholar 

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

    MATH  Google Scholar 

  12. Langdon, W.B.: Size fair and homologous tree genetic programming crossovers. Genetic Programming and Evolvable Machines 1(1/2), 95–119 (2000)

    Article  MATH  Google Scholar 

  13. Langdon, W.B.: Genetic Programming and Data Structures. Kluwer, Dordrecht (1998)

    MATH  Google Scholar 

  14. Langdon, W.B., Barrett, S.J.: Genetic programming in data mining for drug discovery. In: Ghosh, A., Jain, L.C. (eds.) Evolutionary Computing in Data Mining. Studies in Fuzziness and Soft Computing, vol. 163, pp. 211–235. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Langdon, W.B., Soule, T., Poli, R., Foster, J.A.: The evolution of size and shape. In: Spector, L., et al. (eds.) Advances in GP 3, pp. 163–190. MIT Press, Cambridge (1999)

    Google Scholar 

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

    MATH  Google Scholar 

  17. Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Addison-Wesley, Reading (1996)

    MATH  Google Scholar 

  18. Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. The University of Illinois Press, Urbana (1964)

    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

Langdon, W.B., Banzhaf, W. (2005). Repeated Patterns in Tree 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_17

Download citation

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

  • 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