{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:20:31Z","timestamp":1737609631833,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540009719"},{"type":"electronic","value":"9783540365990"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36599-0_18","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T22:36:12Z","timestamp":1194993372000},"page":"194-203","source":"Crossref","is-referenced-by-count":13,"title":["Maximum Homologous Crossover for Linear Genetic Programming"],"prefix":"10.1007","author":[{"given":"Michael","family":"Defoin Platel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Clergue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Collard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"18_CR1","unstructured":"Lee Altenberg. The evolution of evolvability in genetic programming. In Advances in Genetic Programming. MIT Press, 1994."},{"key":"18_CR2","unstructured":"P. J. Angeline. Subtree crossover: Building block engine or macromutation ? In Genetic Programming 1997: Proceedings of the Second Annual Conference. Morgan Kaufmann, July 1997."},{"issue":"1","key":"18_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/4235.910462","volume":"5","author":"M. Brameier","year":"2001","unstructured":"Markus Brameier and Wolfgang Banzhaf. A comparison of linear genetic programming and neural networks in medical data mining. IEEE Transactions on Evolutionary Computation, 5(1):17\u201326, 2001.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Markus Brameier and Wolfgang Bhanzhaf. Explicit control of diversity and effective variation distance in linear genetic programming, 2001.","DOI":"10.1007\/3-540-45984-7_4"},{"key":"18_CR5","unstructured":"Manuel Clergue, Philippe Collard, Marco Tomassini, and Leonardo Vanneschi. Fitness distance correlation and problem difficulty for genetic programming. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 724\u2013732, New York, 9\u201313 July 2002. Morgan Kaufmann Publishers."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Patrik D\u2019haeseleer. Context preserving crossover in genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 256\u2013261, Orlando, Florida, USA, 27\u201329 1994. IEEE Press.","DOI":"10.1109\/ICEC.1994.350006"},{"key":"18_CR7","first-page":"109","volume":"2","author":"S. Forrest","year":"1993","unstructured":"Stephanie Forrest and Melanie Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundation of Genetic Algorithms 2, pages 109\u2013126. Morgan Kaufman, 1993.","journal-title":"Foundation of Genetic Algorithms"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Tree and Sequences. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"J. Koza. Genetic programming-on the programming of computers by means of natural selection. Nature, 1993.","DOI":"10.1007\/BF00175355"},{"key":"18_CR10","unstructured":"W. B. Langdon. Size fair and homologous tree genetic programming crossovers. In Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1092\u20131097, Orlando, Florida, USA, 13\u201317 July 1999. Morgan Kaufmann."},{"key":"18_CR11","unstructured":"V. I. Levenshtein. Binary codes capable of correcting deletions, insertions, and reversals. Soviet Physics-Doklady, 1966."},{"key":"18_CR12","first-page":"275","volume-title":"Advances in Genetic Programming","author":"P. Nordin","year":"1999","unstructured":"Peter Nordin, Wolfgang Banzhaf, and Frank D. Francone. Efficient evolution of machine code for CISC architectures using instruction blocks and homologous crossover. In Advances in Genetic Programming 3, chapter 12, pages 275\u2013299. MIT Press, Cambridge, MA, USA, June 1999."},{"key":"18_CR13","unstructured":"U. O\u2019Reilly. Using a distance metric on genetic programs to understand genetic operators, 1997."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Tim Perkis. Stack-based genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, volume 1, pages 148\u2013153, Orlando, Florida, USA, 27\u201329 1994. IEEE Press.","DOI":"10.1109\/ICEC.1994.350025"},{"key":"18_CR15","first-page":"180","volume-title":"Soft Computing in Engineering Design and Manufacturing","author":"R. Poli","year":"1997","unstructured":"Riccardo Poli and W. B. Langdon. Genetic programming with one-point crossover. In Soft Computing in Engineering Design and Manufacturing, pages 180\u2013189. Springer-Verlag London, 23\u201327 June 1997."},{"key":"18_CR16","first-page":"299","volume-title":"Advances in Genetic Programming","author":"W. F. Punch","year":"1996","unstructured":"William F. Punch, Douglas Zongker, and Erik D. Goodman. The royal tree problem, a benchmark for single and multiple population genetic programming. In Advances in Genetic Programming 2, chapter 15, pages 299\u2013316. MIT Press, Cambridge, MA, USA, 1996."},{"key":"18_CR17","unstructured":"R.E. Keller W. Banzhaf, P. Nordin and F.D. Francone. Genetic Programming-An Introduction. Morgan Kaufmann, 1998."}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36599-0_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:56:42Z","timestamp":1737536202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36599-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540009719","9783540365990"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36599-0_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}