{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:40:21Z","timestamp":1737078021130,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433781"},{"type":"electronic","value":"9783540459842"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45984-7_21","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T02:20:51Z","timestamp":1181182851000},"page":"212-227","source":"Crossref","is-referenced-by-count":13,"title":["Allele Diffusion in Linear Genetic Programming and Variable-Length Genetic Algorithms with Subtree Crossover"],"prefix":"10.1007","author":[{"given":"Riccardo","family":"Poli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan E.","family":"Rowe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher R.","family":"Stephens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alden H.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"L. B. Booker. Recombination distributions for genetic algorithms. In FOGA-92, Foundations of Genetic Algorithms, Vail, Colorado, 24\u201329 July 1992. http:\/\/booker@mitre.org .","DOI":"10.1016\/B978-0-08-094832-4.50008-8"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"L. B. Booker, D. B. Fogel, D. Whitley, P. J. Angeline, and A. E. Eiben. Recombination. In T. B\u00e4ck, D. B. Fogel, and T. Michalewicz, editors, Evolutionary Computation 1: Basic Algorithms and Operators, chapter 33. Institute of Physics Publishing, 2000.","DOI":"10.1887\/0750306645\/b877c33"},{"issue":"1","key":"21_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1214\/aoms\/1177731313","volume":"15","author":"H. Geiringer","year":"1944","unstructured":"H. Geiringer. On the probability theory of linkage in Mendelian heredity. Annals of Mathe-matical Statistics, 15(1):25\u201357, March 1944.","journal-title":"Annals of Mathe-matical Statistics"},{"key":"21_CR4","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"J. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, USA, 1975."},{"key":"21_CR5","first-page":"163","volume-title":"Advances in Genetic Programming","author":"W. B. Langdon","year":"1999","unstructured":"W. B. Langdon, T. Soule, R. Poli, and J. A. Foster. The evolution of size and shape. In L. Spector, W. B. Langdon, U.-M. O\u2019Reilly, and P. J. Angeline, editors, Advances in Genetic Programming 3, chapter 8, pages 163\u2013190. MIT Press, Cambridge, MA, USA, June 1999."},{"key":"21_CR6","unstructured":"N. F. McPhee and J. D. Miller. Accurate replication in genetic programming. In L. Eshelman, editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 303\u2013309, Pittsburgh, PA, USA, 15\u201319 July 1995. Morgan Kaufmann."},{"key":"21_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Genetic Programming, Proceedings of EuroGP 2001","author":"N. F. McPhee","year":"2001","unstructured":"N. F. McPhee and R. Poli. A schema theory analysis of the evolution of size in genetic programming with linear representations. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18\u201320 Apr. 2001. Springer-Verlag."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"N. F. McPhee, R. Poli, and J. E. Rowe. A schema theory analysis of mutation size biases in genetic programming with linear representations. In Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001, Seoul, Korea, May 2001.","DOI":"10.1109\/CEC.2001.934311"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"N. F. McPhee, R. Poli, and J. E. Rowe. A schema theory analysis of mutation size biases in genetic programming with linear representations. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001, pages 1078\u20131085, COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea, 27\u201330 May 2001. IEEE Press.","DOI":"10.1109\/CEC.2001.934311"},{"key":"21_CR10","unstructured":"R. Poli. Exact schema theorem and effective fitness for GP with one-point crossover. In D. Whitley, D. Goldberg, E. Cantu-Paz, L. Spector, I. Parmee, and H.-G. Beyer, editors, Proceedings of the Genetic and Evolutionary Computation Conference, pages 469\u2013476, Las Vegas, July 2000. Morgan Kaufmann."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"R. Poli. Hyperschema theory for GP with one-point crossover, building blocks, and some new results in GA theory. In R. Poli, W. Banzhaf, and et al., editors, Genetic Programming, Proceedings of EuroGP 2000. Springer-Verlag, 15-16 Apr. 2000.","DOI":"10.1007\/978-3-540-46239-2_12"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"R. Poli. Exact schema theory for genetic programming and variable-length genetic algo-rithms with one-point crossover. Genetic Programming and Evolvable Machines, 2(2), 2001. Forthcoming.","DOI":"10.1023\/A:1011552313821"},{"key":"21_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45124-2","volume-title":"Genetic Programming, Proceedings of EuroGP 2001","author":"R. Poli","year":"2001","unstructured":"R. Poli. General schema theory for genetic programming with subtree-swapping crossover. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18-20 Apr. 2001. Springer-Verlag."},{"key":"21_CR14","unstructured":"R. Poli and W. B. Langdon. On the search properties of different crossover operators in genetic programming. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 293\u2013301, University of Wisconsin, Madison, Wisconsin, USA, 22\u201325 July 1998. Morgan Kaufmann."},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1162\/evco.1998.6.3.231","volume":"6","author":"R. Poli","year":"1998","unstructured":"R. Poli and W. B. Langdon. Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation, 6(3):231\u2013252, 1998.","journal-title":"Evolutionary Computation"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"R. Poli and N. F. McPhee. Exact GP schema theory for headless chicken crossover and subtree mutation. In Proceedings of the 2001 Congress on Evolutionary Computation CEC 2001, Seoul, Korea, May 2001.","DOI":"10.1109\/CEC.2001.934309"},{"key":"21_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45124-2","volume-title":"Genetic Programming, Proceedings of EuroGP 2001","author":"R. Poli","year":"2001","unstructured":"R. Poli and N. F. McPhee. Exact schema theorems for GP with one-point and standard crossover operating on linear structures and their application to the study of the evolution of size. In Genetic Programming, Proceedings of EuroGP 2001, LNCS, Milan, 18\u201320 Apr. 2001. Springer-Verlag."},{"key":"21_CR18","unstructured":"R. Poli and N. F. McPhee. Exact schema theory for GP and variable-length GAs with homol-ogous crossover. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, California, USA, 7\u201311 July 2001. Morgan Kaufmann."},{"key":"21_CR19","volume-title":"Evolution","author":"M. Ridley","year":"1993","unstructured":"M. Ridley. Evolution. Blackwell Scientific Publications, Boston, 1993."},{"key":"21_CR20","unstructured":"J. E. Rowe and N. F. McPhee. The effects of crossover and mutation operators on variable length linear structures. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), San Francisco, California, USA, 7\u201311 July 2001. Morgan Kauf-mann."},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"T. Soule, J. A. Foster, and J. Dickinson. Code growth in genetic programming. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215\u2013223, Stanford University, CA, USA, 28\u201331 July 1996. MIT Press.","DOI":"10.7551\/mitpress\/3242.003.0029"},{"key":"21_CR22","unstructured":"W. M. Spears. Limiting distributions for mutation and recombination. In W. M. Spears and W. Martin, editors, Proceedings of the Foundations of Genetic Algorithms Workshop (FOGA 6), Charlottesville, VA, USA, July 2000. In press."},{"key":"21_CR23","unstructured":"C. R. Stephens. Some exact results from a coarse grained formulation of genetic dynamics. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M.H. Garzon, and E. Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 631\u2013638, San Francisco, California, USA, 7\u201311 July 2001. Morgan Kaufmann."},{"key":"21_CR24","unstructured":"C. R. Stephens and H. Waelbroeck. Effective degrees of freedom in genetic algorithms and the block hypothesis. In T. B\u00e4ck, editor, Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA97), pages 34\u201340, East Lansing, 1997. Morgan Kaufmann."},{"issue":"2","key":"21_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1162\/evco.1999.7.2.109","volume":"7","author":"C. R. Stephens","year":"1999","unstructured":"C. R. Stephens and H. Waelbroeck. Schemata evolution and building blocks. Evolutionary Computation, 7(2):109\u2013124, 1999.","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45984-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T01:18:00Z","timestamp":1737076680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45984-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433781","9783540459842"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45984-7_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}