Maximum Homologous Crossover for Linear Genetic Programming

1. Lee Altenberg. The evolution of evolvability in genetic programming. In Advances in Genetic Programming. MIT Press, 1994.

   Google Scholar 

2. P. J. Angeline. Subtree crossover: Building block engine or macromutation ? In Genetic Programming 1997: Proceedings of the Second Annual Conference. Morgan Kaufmann, July 1997.

   Google Scholar 

3. Markus Brameier and Wolfgang Banzhaf. A comparison of linear genetic programming and neural networks in medical data mining. IEEE Transactions on Evolutionary Computation, 5(1):17–26, 2001.

   Article  Google Scholar 

4. Markus Brameier and Wolfgang Bhanzhaf. Explicit control of diversity and effective variation distance in linear genetic programming, 2001.

   Google Scholar 

5. Manuel Clergue, Philippe Collard, Marco Tomassini, and Leonardo Vanneschi. Fitness distance correlation and problem difficulty for genetic programming. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 724–732, New York, 9–13 July 2002. Morgan Kaufmann Publishers.

   Google Scholar 

6. Patrik D’haeseleer. Context preserving crossover in genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 256–261, Orlando, Florida, USA, 27–29 1994. IEEE Press.

   Google Scholar 

7. Stephanie Forrest and Melanie Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundation of Genetic Algorithms 2, pages 109–126. Morgan Kaufman, 1993.

   Google Scholar 

8. D. Gusfield. Algorithms on Strings, Tree and Sequences. Cambridge University Press, 1997.

   Google Scholar 

9. J. Koza. Genetic programming-on the programming of computers by means of natural selection. Nature, 1993.

   Google Scholar 

10. W. B. Langdon. Size fair and homologous tree genetic programming crossovers. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1092–1097, Orlando, Florida, USA, 13–17 July 1999. Morgan Kaufmann.

    Google Scholar 

11. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady, 1966.

    Google Scholar 

12. Peter Nordin, Wolfgang Banzhaf, and Frank D. Francone. Efficient evolution of machine code for CISC architectures using instruction blocks and homologous crossover. In Advances in Genetic Programming 3, chapter 12, pages 275–299. MIT Press, Cambridge, MA, USA, June 1999.

    Google Scholar 

13. U. O’Reilly. Using a distance metric on genetic programs to understand genetic operators, 1997.

    Google Scholar 

14. Tim Perkis. Stack-based genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 148–153, Orlando, Florida, USA, 27–29 1994. IEEE Press.

    Google Scholar 

15. Riccardo Poli and W. B. Langdon. Genetic programming with one-point crossover. In Soft Computing in Engineering Design and Manufacturing, pages 180–189. Springer-Verlag London, 23–27 June 1997.

    Google Scholar 

16. William F. Punch, Douglas Zongker, and Erik D. Goodman. The royal tree problem, a benchmark for single and multiple population genetic programming. In Advances in Genetic Programming 2, chapter 15, pages 299–316. MIT Press, Cambridge, MA, USA, 1996.

    Google Scholar 

17. R.E. Keller W. Banzhaf, P. Nordin and F.D. Francone. Genetic Programming-An Introduction. Morgan Kaufmann, 1998.

    Google Scholar 

Download references