{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:39Z","timestamp":1725544659061},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540331438"},{"type":"electronic","value":"9783540331445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11729976_21","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T06:47:42Z","timestamp":1141109262000},"page":"238-249","source":"Crossref","is-referenced-by-count":11,"title":["Using Subtree Crossover Distance to Investigate Genetic Programming Dynamics"],"prefix":"10.1007","author":[{"given":"Leonardo","family":"Vanneschi","sequence":"first","affiliation":[]},{"given":"Steven","family":"Gustafson","sequence":"additional","affiliation":[]},{"given":"Giancarlo","family":"Mauri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_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)"},{"issue":"3","key":"21_CR2","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\u00e4rt, 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":"21_CR3","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":"21_CR4","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":"21_CR5","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":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-24621-3_20","volume-title":"Artificial Evolution","author":"M. Tomassini","year":"2004","unstructured":"Tomassini, M., Vanneschi, L., Fern\u00e1ndez, F., Galeano, G.: A study of diversity in multipopulation genetic programming. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds.) EA 2003. LNCS, vol.\u00a02936, pp. 69\u201381. Springer, Heidelberg (2004)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-45984-7_16","volume-title":"Genetic Programming","author":"A. Ek\u00e1rt","year":"2002","unstructured":"Ek\u00e1rt, A., N\u00e9meth, S.Z.: Maintaining the diversity of genetic programs. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol.\u00a02278, pp. 162\u2013171. Springer, Heidelberg (2002)"},{"key":"21_CR8","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)"},{"issue":"2","key":"21_CR9","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":"21_CR10","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":"21_CR11","unstructured":"Vanneschi, L.: Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, University of Lausanne, Switzerland (2004)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-540-31989-4_16","volume-title":"Genetic Programming","author":"S. Gustafson","year":"2005","unstructured":"Gustafson, S., Vanneschi, L.: Operator-based distance for genetic programming: Subtree crossover distance. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol.\u00a03447, pp. 178\u2013189. Springer, Heidelberg (2005)"},{"issue":"1","key":"21_CR13","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 subtreeswapping crossover: Part i. Evolutionary Computation\u00a011(1), 53\u201366 (2003)","journal-title":"Evolutionary Computation"},{"key":"21_CR14","first-page":"299","volume-title":"Advances in Genetic Programming 2","author":"B. Punch","year":"1996","unstructured":"Punch, B., Zongker, D., Goodman, E.: The royal tree problem, a benchmark for single and multiple population genetic programming. In: Angeline, P., Kinnear, K. (eds.) Advances in Genetic Programming 2, pp. 299\u2013316. The MIT Press, Cambridge (1996)"},{"key":"21_CR15","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11729976_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:10Z","timestamp":1619506270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11729976_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540331438","9783540331445"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11729976_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}