1. Banzhaf W, Nordin P, Keller RE, Francone FD (1998) Genetic programming—an introduction; On the automatic evolution of computer programs and its applications. Morgan Kaufmann, San Francisco, CA, USA
2. Daida JM, Bertram RR, Polito JA 2, Stanhope SA (1999) Analysis of single-node (building) blocks in genetic programming. In: Spector L, Langdon WB, O’Reilly U-M, Angeline PJ (eds) Advances in genetic programming 3, chapter 10. MIT Press, Cambridge, MA, USA, pp 217–241
3. Greene WA (2004) Greene. Schema disruption in chromosomes that are structured as binary trees. In: Deb K et al. (eds) Genetic and evolutionary computation—GECCO-2004, Part I, vol 3102 of Lecture Notes in Computer Science. Springer-Verlag, Seattle, WA, USA, pp 1197–1207
4. Langdon WB (2002) Convergence rates for the distribution of program outputs. In: Langdon WB et al. (eds) GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference. New York, July 2002, pp 812–819
5. Langdon WB (2003a) How many good programs are there? How long are they? In: De Jong KA, Poli R, Rowe JE (eds) Foundations of genetic algorithms VII. Torremolinos, Spain, 4–6 September 2002. Morgan Kaufmann, pp 183–202