{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:16:30Z","timestamp":1743099390878,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540254362"},{"type":"electronic","value":"9783540319894"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31989-4_16","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T13:04:43Z","timestamp":1278939883000},"page":"178-189","source":"Crossref","is-referenced-by-count":13,"title":["Operator-Based Distance for Genetic Programming: Subtree Crossover Distance"],"prefix":"10.1007","author":[{"given":"Steven","family":"Gustafson","sequence":"first","affiliation":[]},{"given":"Leonardo","family":"Vanneschi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","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":"16_CR2","first-page":"184","volume-title":"Proceedings of the Sixth International Conference on Genetic Algorithms","author":"T. Jones","year":"1995","unstructured":"Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Eshelman, L. (ed.) Proceedings of the Sixth International Conference on Genetic Algorithms, pp. 184\u2013192. Morgan Kaufmann, San Francisco (1995)"},{"key":"16_CR3","unstructured":"Tomassini, M., Vanneschi, L., Collard, P., Clergue, M.: A study of fitness distance correlation as a difficulty measure in genetic programming. Evolutionary Computation (in press)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/3-540-36599-0_43","volume-title":"Genetic Programming","author":"L. Vanneschi","year":"2003","unstructured":"Vanneschi, L., Tomassini, M., Collard, P., Clergue, M.: Fitness distance correlation in structural mutation genetic programming. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol.\u00a02610, pp. 459\u2013468. Springer, Heidelberg (2003)"},{"key":"16_CR5","unstructured":"Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, University of Lausanne, Switzerland (2004)"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/B:GENP.0000030194.98244.e3","volume":"5","author":"S. Gustafson","year":"2004","unstructured":"Gustafson, S., Ek\u00e1rt, A., Burke, E.K., Kendall, G.: Problem difficulty and code growth in genetic programming. Genetic Programming and Evolvable Hardware\u00a05(3), 271\u2013290 (2004)","journal-title":"Genetic Programming and Evolvable Hardware"},{"key":"16_CR7","unstructured":"Gustafson, S.: An Analysis of Diversity in Genetic Programming. PhD thesis, School of Computer Science and Information Technology, University of Nottingham, Nottingham, England (February 2004)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/TEVC.2003.819263","volume":"8","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Gustafson, S., Kendall, G.: Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Transactions on Evolutionary Computation\u00a08(1), 47\u201362 (2004)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"16_CR9","first-page":"1112","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference","author":"N.F. McPhee","year":"1999","unstructured":"McPhee, N.F., Hopper, N.J.: Analysis of genetic diversity through population history. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, FL, USA, pp. 1112\u20131120. Morgan Kaufmann, San Francisco (1999)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1007\/3-540-45110-2_20","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"M. Wineberg","year":"2003","unstructured":"Wineberg, M., Oppacher, F.: Distance between populations. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1481\u20131492. Springer, Heidelberg (2003)"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1162\/106365603321829005","volume":"11","author":"R. Poli","year":"2003","unstructured":"Poli, R., McPhee, N.F.: General schema theory for genetic programming with subtree-swapping crossover: Part i. Evolutionary Computation\u00a011(1), 53\u201366 (2003)","journal-title":"Evolutionary Computation"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1665","DOI":"10.1007\/3-540-45110-2_60","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"J.M. Daida","year":"2003","unstructured":"Daida, J.M., Li, H., Tang, R., Hilss, A.M.: What makes a problem GP-hard? validating a hypothesis of structural causes. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1665\u20131677. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31989-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T19:48:08Z","timestamp":1675194488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-31989-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540254362","9783540319894"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31989-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}