{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:00Z","timestamp":1759637760865,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319992587"},{"type":"electronic","value":"9783319992594"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99259-4_4","type":"book-chapter","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T17:28:18Z","timestamp":1534786098000},"page":"42-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming"],"prefix":"10.1007","author":[{"given":"Timo","family":"K\u00f6tzing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A. Gregor","family":"Lagodzinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Lengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Melnichenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"4_CR1","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Doerr, B., K\u00f6tzing, T., Lagodzinski, J.A.G., Lengler, J.: Bounding bloat in genetic programming. In: Proceedings of GECCO 2017, pp. 921\u2013928. ACM (2017)","DOI":"10.1145\/3071178.3071271"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Durrett, G., Neumann, F., O\u2019Reilly, U.M.: Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics. In: Proceedings of FOGA 2011, pp. 69\u201380 (2011)","DOI":"10.1145\/1967654.1967661"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-540-24855-2_57","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"BE Eskridge","year":"2004","unstructured":"Eskridge, B.E., Hougen, D.F.: Memetic crossover for genetic programming: evolution through imitation. In: Deb, K. (ed.) GECCO 2004. LNCS, vol. 3103, pp. 459\u2013470. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24855-2_57"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Gathercole, C., Ross, P.: An adverse interaction between the crossover operator and a restriction on tree depth. In: Proceedings of GP 1996, pp. 291\u2013296 (1996)","DOI":"10.7551\/mitpress\/3242.003.0041"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0055925","volume-title":"Genetic Programming","author":"DE Goldberg","year":"1998","unstructured":"Goldberg, D.E., O\u2019Reilly, U.-M.: Where does the good stuff go, and why? How contextual semantics influences program structure in simple genetic programming. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 16\u201336. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055925"},{"key":"4_CR7","unstructured":"Jones, T.: Crossover, macromutation, and population-based search. In: Proceedings of ICGA 1995, pp. 73\u201380. Morgan Kaufmann Publishers Inc. (1995)"},{"key":"4_CR8","unstructured":"Jones, T.: Evolutionary algorithms, fitness landscape and search. Ph.D. thesis, University of New Mexico (1995)"},{"key":"4_CR9","unstructured":"Karp, R.M., Schindelhauer, C., Shenker, S., V\u00f6cking, B.: Randomized rumor spreading. In: Proceedings of FOCS 2000, pp. 565\u2013574 (2000)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Neumann, F., Sp\u00f6hel, R.: PAC learning and genetic programming. In: Proceedings of GECCO 2011, pp. 2091\u20132096 (2011)","DOI":"10.1145\/2001576.2001857"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6tzing, T., Sutton, A.M., Neumann, F., O\u2019Reilly, U.M.: The max problem revisited: the importance of mutation in genetic programming. In: Proceedings of GECCO 2012, pp. 1333\u20131340 (2012)","DOI":"10.1145\/2330163.2330348"},{"key":"4_CR12","unstructured":"Koza, J.R.: Genetic programming: a paradigm for genetically breeding populations of computer programs to solve problems. Technical report, Stanford, CA, USA (1990)"},{"key":"4_CR13","unstructured":"Langdon, W.B., Poli, R.: An analysis of the MAX problem in genetic programming. In: Proceedings of GP 1997, pp. 222\u2013230 (1997)"},{"key":"4_CR14","unstructured":"Luke, S., Panait, L.: Lexicographic parsimony pressure. In: Proceedings of GECCO 2002, pp. 829\u2013836 (2002)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Mambrini, A., Manzoni, L.: A comparison between geometric semantic GP and cartesian GP for Boolean functions learning. In: Proceedings of GECCO 2014, pp. 143\u2013144 (2014)","DOI":"10.1145\/2598394.2598475"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Mambrini, A., Oliveto, P.S.: On the analysis of simple genetic programming for evolving Boolean functions. In: Proceedings of EuroGP 2016, pp. 99\u2013114 (2016)","DOI":"10.1007\/978-3-319-30668-1_7"},{"key":"4_CR17","unstructured":"Mercier, H., Hayez, L., Matos, M.: Optimal epidemic dissemination. CoRR abs\/1709.00198 (2017). http:\/\/arxiv.org\/abs\/1709.00198"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Moraglio, A., Mambrini, A., Manzoni, L.: Runtime analysis of mutation-based geometric semantic genetic programming on Boolean functions. In: Proceedings of FOGA 2013, pp. 119\u2013132 (2013)","DOI":"10.1145\/2460239.2460251"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Neumann, F.: Computational complexity analysis of multi-objective genetic programming. In: Proceedings of GECCO 2012, pp. 799\u2013806 (2012)","DOI":"10.1145\/2330163.2330274"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Nguyen, A., Urli, T., Wagner, M.: Single- and multi-objective genetic programming: new bounds for weighted ORDER and MAJORITY. In: Proceedings of FOGA 2013, pp. 161\u2013172 (2013)","DOI":"10.1145\/2460239.2460254"},{"key":"4_CR21","unstructured":"O\u2019Reilly, U.M.: An analysis of genetic programming. Ph.D. thesis, Carleton University, Ottawa, Canada (1995)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-58484-6_283","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN III","author":"U-M O\u2019Reilly","year":"1994","unstructured":"O\u2019Reilly, U.-M., Oppacher, F.: Program search with a hierarchical variable length representation: genetic programming, simulated annealing and hill climbing. In: Davidor, Y., Schwefel, H.-P., M\u00e4nner, R. (eds.) PPSN 1994. LNCS, vol. 866, pp. 397\u2013406. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58484-6_283"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XV"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99259-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T11:43:50Z","timestamp":1720525430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99259-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319992587","9783319992594"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99259-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}