{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T23:10:03Z","timestamp":1745968203165,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642372063"},{"type":"electronic","value":"9783642372070"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37207-0_5","type":"book-chapter","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T23:04:49Z","timestamp":1362438289000},"page":"49-60","source":"Crossref","is-referenced-by-count":0,"title":["PhenoGP: Combining Programs to Avoid Code Disruption"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Fonlupt","sequence":"first","affiliation":[]},{"given":"Denis","family":"Robilliard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Angeline, P.J., Pollack, J.B.: Coevolving high-level representations. In: Langton, C.G. (ed.) Artificial Life III, Santa Fe, New Mexico, June 15-19. SFI Studies in the Sciences of Complexity, vol.\u00a0XVII, pp. 55\u201371. Addison-Wesley (1992, 1994)"},{"key":"5_CR2","unstructured":"Brameier, M., Banzhaf, W.: Linear Genetic Programming. Genetic and Evolutionary Computation. Springer (2007)"},{"key":"5_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/11589990_144","volume-title":"AI 2005: Advances in Artificial Intelligence","author":"G. Chen","year":"2005","unstructured":"Chen, G., Zhang, M.: Evolving While-Loop Structures in Genetic Programming for Factorial and Ant Problems. In: Zhang, S., Jarvis, R.A. (eds.) AI 2005. LNCS (LNAI), vol.\u00a03809, pp. 1079\u20131085. Springer, Heidelberg (2005)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Ciesielski, V., Li, X.: Experiments with explicit for-loops in genetic programming. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, Portland, Oregon, pp. 494\u2013501. IEEE Press (2004)","DOI":"10.1109\/CEC.2004.1330897"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-20407-4_16","volume-title":"Genetic Programming","author":"C. Downey","year":"2011","unstructured":"Downey, C., Zhang, M.: Parallel Linear Genetic Programming. In: Silva, S., Foster, J.A., Nicolau, M., Machado, P., Giacobini, M. (eds.) EuroGP 2011. LNCS, vol.\u00a06621, pp. 178\u2013189. Springer, Heidelberg (2011)"},{"key":"5_CR6","first-page":"1887","volume-title":"Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009","author":"I. Kadar","year":"2009","unstructured":"Kadar, I., Ben-Shahar, O., Sipper, M.: Evolution of a local boundary detector for natural images via genetic programming and texture cues. In: Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation, GECCO 2009, pp. 1887\u20131888. ACM, New York (2009)"},{"key":"5_CR7","unstructured":"Koza, J.: Genetic Programming II: Automatic Discovery of Reusable Programs. The MIT Press (1994)"},{"key":"5_CR8","unstructured":"Langdon, W.B., Poli, R.: Why ants are hard. In: Genetic Programming 1998: Proceedings of the Third Annual Conference, University of Wisconsin, Madison, Wisconsin, USA, July 22-25, pp. 193\u2013201. Morgan Kaufmann (1998)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Larres, J., Zhang, M., Browne, W.: Using unrestricted loops in genetic programming for image classification. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2010)","DOI":"10.1109\/CEC.2010.5586305"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Lichodzijewski, P., Heywood, M.I.: Managing team-based problem solving with symbiotic bid-based genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 363\u2013370. Morgan Kaufmann (2008)","DOI":"10.1145\/1389095.1389162"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Miller, J.: Cartesian Genetic Programming. Springer (2011)","DOI":"10.1007\/978-3-642-17310-3"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Spector, L.: Automatic Quantum Computer Programming: A Genetic Programming Approach. Springer (2006)","DOI":"10.1007\/978-0-387-36791-0"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1145\/1389095.1389343","volume-title":"Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008","author":"L. Spector","year":"2008","unstructured":"Spector, L., Clark, D.M., Lindsay, I., Barr, B., Klein, J.: Genetic programming for finite algebras. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, GECCO 2008, pp. 1291\u20131298. ACM, New York (2008)"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37207-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:55:13Z","timestamp":1745967313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37207-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642372063","9783642372070"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37207-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}