1. W.F. Punch, D. Zongker, E.D. Goodman, The royal tree problem, a benchmark for single and multiple population genetic programming, in Advances in Genetic Programming 2, Chap. 15, ed. by P.J. Angeline, K.E. Kinnear, Jr. (MIT Press, Cambridge, 1996), pp. 299–316
2. J.M. Daida, H. Li, R. Tang, A.M. Hilss, What makes a problem GP-hard? Validating a hypothesis of structural causes, in Genetic and Evolutionary Computation—GECCO-2003, Chicago, IL, ed. by E. Cantú-Paz, J.A. Foster, K. Deb, D. Davis, R. Roy, U.-M. O’Reilly, H.-G. Beyer, R. Standish, G. Kendall, S. Wilson, M. Harman, J. Wegener, D. Dasgupta, M.A. Potter, A.C. Schultz, K. Dowsland, N. Jonoska, J. Miller. Lecture Notes in Computer Science, vol. 2724 (Springer-Verlag, Berlin, 2003), pp. 1665–1677
3. S. Gustafson, E.K. Burke, N. Krasnogor, The tree-string problem: an artificial domain for structure and content search, in Proceedings of the 8th European Conference on Genetic Programming, Lausanne, Switzerland, 30 March–1 April 2005, ed. by M. Keijzer, A. Tettamanzi, P. Collet, J.I. van Hemert, M. Tomassini. Lecture Notes in Computer Science, vol. 3447 (Springer, Berlin, 2005), pp. 215–226
4. J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection (MIT Press, Cambridge, 1992)
5. P. Nordin, F. Francone, W. Banzhaf, Explicitly defined introns and destructive crossover in genetic programming, in Proceedings of the Workshop on Genetic Programming: From Theory to Real-World Applications, Tahoe City, CA, 9 July 1995, ed. by J.P. Rosca, pp. 6–22