{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:35:14Z","timestamp":1767972914897,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642204067","type":"print"},{"value":"9783642204074","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20407-4_17","type":"book-chapter","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T17:23:02Z","timestamp":1303838582000},"page":"190-202","source":"Crossref","is-referenced-by-count":5,"title":["How Far Is It from Here to There? A Distance That Is Coherent with GP Operators"],"prefix":"10.1007","author":[{"given":"James","family":"McDermott","sequence":"first","affiliation":[]},{"given":"Una-May","family":"O\u2019Reilly","sequence":"additional","affiliation":[]},{"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[]},{"given":"Kalyan","family":"Veeramachaneni","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/11871842_9","volume-title":"Machine Learning: ECML 2006","author":"M. Bernard","year":"2006","unstructured":"Bernard, M., Habrard, A., Sebban, M.: Learning stochastic tree edit distance. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 42\u201353. Springer, Heidelberg (2006)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-45984-7_4","volume-title":"Genetic Programming","author":"M. Brameier","year":"2002","unstructured":"Brameier, M., Banzhaf, W.: Explicit control of diversity and effective variation distance in linear genetic programming. In: Foster, J., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds.) EuroGP 2002. LNCS, vol.\u00a02278, pp. 37\u201349. Springer, Heidelberg (2002)"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R. Cilibrasi","year":"2005","unstructured":"Cilibrasi, R., Vitanyi, P.M.B.: Clustering by compression. IEEE Transactions on Information Theory\u00a051(4), 1523\u20131545 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Durrett, G., Neumann, F., O\u2019Reilly, U.M.: Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In: Foundations of Genetic Algorithms (2010)","DOI":"10.1145\/1967654.1967661"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-46239-2_19","volume-title":"Genetic Programming","author":"A. Ek\u00e1rt","year":"2000","unstructured":"Ek\u00e1rt, A., N\u00e9meth, S.Z.: A metric for genetic programs and fitness sharing. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol.\u00a01802, pp. 259\u2013270. Springer, Heidelberg (2000)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Evolved Analytics LLC: DataModeler Release 1.0. Evolved Analytics LLC (2010)","DOI":"10.3139\/9783446424005.001"},{"issue":"4","key":"17_CR7","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/TEVC.2008.915993","volume":"12","author":"S. Gustafson","year":"2008","unstructured":"Gustafson, S., Vanneschi, L.: Crossover-based tree distance in genetic programming. IEEE Transactions on Evolutionary Computation\u00a012(4), 506\u2013524 (2008)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"17_CR8","unstructured":"Igel, C., Chellapilla, K.: Investigating the influence of depth and degree of genotypic change on fitness in genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol.\u00a02, pp. 1061\u20131068 (1999)"},{"key":"17_CR9","unstructured":"Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. Ph.D. thesis, University of New Mexico, Albuquerque (1995)"},{"key":"17_CR10","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J.R. Koza","year":"1992","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)"},{"key":"17_CR11","first-page":"987","volume-title":"GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation","author":"K. Krawiec","year":"2009","unstructured":"Krawiec, K., Lichocki, P.: Approximating geometric crossover in semantic space. In: GECCO 2009: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, pp. 987\u2013994. ACM, New York (2009)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","first-page":"164","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"J. McDermott","year":"2010","unstructured":"McDermott, J., Galv\u00e1n-Lop\u00e9z, E., O\u2019Neill, M.: A fine-grained view of GP locality with binary decision diagrams as ant phenotypes. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol.\u00a06238, pp. 164\u2013173. Springer, Heidelberg (2010)"},{"key":"17_CR13","unstructured":"Moraglio, A.: Towards a geometric unification of evolutionary algorithms. Ph.D. thesis, University of Essex (November 2007), http:\/\/eden.dei.uc.pt\/~moraglio\/"},{"key":"17_CR14","first-page":"427","volume-title":"CEC","author":"A. Moraglio","year":"2005","unstructured":"Moraglio, A., Poli, R.: Geometric landscape of homologous crossover for syntactic trees. In: CEC, vol.\u00a01, pp. 427\u2013434. IEEE, Los Alamitos (2005)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-01181-8_25","volume-title":"Genetic Programming","author":"Q.U. Nguyen","year":"2009","unstructured":"Nguyen, Q.U., Nguyen, X.H., O\u2019Neill, M.: Semantic aware crossover for genetic programming: The case for real-valued function regression. In: Vanneschi, L., Gustafson, S., Moraglio, A., De Falco, I., Ebner, M. (eds.) EuroGP 2009. LNCS, vol.\u00a05481, pp. 292\u2013302. Springer, Heidelberg (2009)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"O\u2019Reilly, U.M.: Using a distance metric on genetic programs to understand genetic operators. In: IEEE International Conference on Systems, Man, and Cybernetics: Computational Cybernetics and Simulation, vol.\u00a05 (1997)","DOI":"10.1109\/ICSMC.1997.637337"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/1063656054088549","volume":"13","author":"M. Tomassini","year":"2005","unstructured":"Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation\u00a013(2), 213\u2013239 (2005)","journal-title":"Evolutionary Computation"},{"key":"17_CR18","unstructured":"Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, Universit\u00e9 de Lausanne (2004)"},{"key":"17_CR19","first-page":"13","volume-title":"Genetic Programming Theory and Practice V, ch. 2","author":"E. Vladislavleva","year":"2007","unstructured":"Vladislavleva, E., Smits, G., Kotanchek, M.: Better solutions faster: Soft evolution of robust regression models in Pareto genetic programming. In: Riolo, R.L., Soule, T., Worzel, B. (eds.) Genetic Programming Theory and Practice V, ch. 2, pp. 13\u201332. Springer, Ann Arbor (2007)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20407-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:12:07Z","timestamp":1741162327000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20407-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642204067","9783642204074"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20407-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}