{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:10:18Z","timestamp":1762459818431,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["1789003"],"award-info":[{"award-number":["1789003"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a form of neutral horizontal gene transfer (HGT) to evolving graphs by graph programming (EGGP). We introduce the<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mu \\times \\lambda$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>\u03bc<\/mml:mi><mml:mo>\u00d7<\/mml:mo><mml:mi>\u03bb<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>evolutionary algorithm (EA), where<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mu$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03bc<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>parents each produce<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\lambda$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mi>\u03bb<\/mml:mi><\/mml:math><\/jats:alternatives><\/jats:inline-formula>children who compete only with their parents. HGT events then copy the entire active component of one surviving parent into the inactive component of another parent, exchanging genetic information without reproduction. Experimental results from symbolic regression problems show that the introduction of the<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mu \\times \\lambda$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>\u03bc<\/mml:mi><mml:mo>\u00d7<\/mml:mo><mml:mi>\u03bb<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>EA and HGT events improve the performance of EGGP. Comparisons with genetic programming and Cartesian genetic programming strongly favour our proposed approach. We also investigate the effect of using HGT events in neuroevolution tasks. We again find that the introduction of HGT improves the performance of EGGP, demonstrating that HGT is an effective cross-domain mechanism for recombining graphs.<\/jats:p>","DOI":"10.1007\/s10710-020-09378-1","type":"journal-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T16:03:38Z","timestamp":1580745818000},"page":"321-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Horizontal gene transfer for recombining graphs"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5036-3358","authenticated-orcid":false,"given":"Timothy","family":"Atkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Stepney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"key":"9378_CR1","doi-asserted-by":"crossref","unstructured":"T. Atkinson, D. Plump, S. Stepney, Evolving graphs by graph programming. In: Proceedings of European Conference on Genetic Programming, EuroGP 2018, LNCS, vol. 10781 (Springer, 2018), pp. 35\u201351","DOI":"10.1007\/978-3-319-77553-1_3"},{"key":"9378_CR2","doi-asserted-by":"crossref","unstructured":"T. Atkinson, D. Plump, S. Stepney, Probabilistic graph programs for randomised and evolutionary algorithms. In: Proceedings of International Conference on Graph Transformation, ICGT 2018, LNCS, vol. 10887 (Springer, 2018), pp. 63\u201378","DOI":"10.1007\/978-3-319-92991-0_5"},{"key":"9378_CR3","doi-asserted-by":"publisher","unstructured":"T. Atkinson, D. Plump, S. Stepney, Evolving graphs with horizontal gene transfer. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2019 (ACM, 2019), pp. 968\u2013976. https:\/\/doi.org\/10.1145\/3321707.3321788","DOI":"10.1145\/3321707.3321788"},{"key":"9378_CR4","unstructured":"T. Atkinson, D. Plump, S. Stepney, Evolving graphs with semantic neutral drift. Nat. Comput. (2019). arXiv:1810.10453. (to appear)"},{"key":"9378_CR5","doi-asserted-by":"crossref","unstructured":"J. Clegg, J.A. Walker, J.F. Miller, A new crossover technique for cartesian genetic programming. In: Proceedings of 9th Annual Conference on Genetic and Evolutionary Computation, GECCO 2007 (ACM, 2007), pp. 1580\u20131587","DOI":"10.1145\/1276958.1277276"},{"key":"9378_CR6","unstructured":"L.N. De\u00a0Castro, J. Timmis, An artificial immune network for multimodal function optimization. In: Proceedings of 2002 Congress on Evolutionary Computation. CEC\u201902, vol.\u00a01 (IEEE, 2002), pp. 699\u2013704"},{"issue":"3","key":"9378_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TEVC.2002.1011539","volume":"6","author":"LN De Castro","year":"2002","unstructured":"L.N. De Castro, F.J. Von Zuben, Learning and optimization using the clonal selection principle. IEEE Trans. Evolut. Comput. 6(3), 239\u2013251 (2002)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9378_CR8","unstructured":"R.V. Florian, Correct equations for the dynamics of the cart-pole system (2005). https:\/\/coneural.org\/florian\/papers\/05_cart_pole.pdf"},{"issue":"Jul","key":"9378_CR9","first-page":"2171","volume":"13","author":"FA Fortin","year":"2012","unstructured":"F.A. Fortin, F.M.D. Rainville, M.A. Gardner, M. Parizeau, C. Gagn\u00e9, Deap: evolutionary algorithms made easy. J. Mach. Learn. Res. 13(Jul), 2171\u20132175 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9378_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s12530-011-9030-5","volume":"2","author":"E Galv\u00e1n-L\u00f3pez","year":"2011","unstructured":"E. Galv\u00e1n-L\u00f3pez, R. Poli, A. Kattan, M. O\u2019Neill, A. Brabazon, Neutrality in evolutionary algorithms... What do we know? Evol. Syst. 2(3), 145\u2013163 (2011)","journal-title":"Evol. Syst."},{"issue":"3\u20134","key":"9378_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1177\/105971239700500305","volume":"5","author":"F Gomez","year":"1997","unstructured":"F. Gomez, R. Miikkulainen, Incremental evolution of complex general behavior. Adapt. Behav. 5(3\u20134), 317\u2013342 (1997). https:\/\/doi.org\/10.1177\/105971239700500305","journal-title":"Adapt. Behav."},{"issue":"May","key":"9378_CR12","first-page":"937","volume":"9","author":"F Gomez","year":"2008","unstructured":"F. Gomez, J. Schmidhuber, R. Miikkulainen, Accelerated neural evolution through cooperatively coevolved synapses. J. Mach. Learn. Res. 9(May), 937\u2013965 (2008)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"9378_CR13","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1177\/0300985813511131","volume":"51","author":"C Gyles","year":"2014","unstructured":"C. Gyles, P. Boerlin, Horizontally transferred genetic elements and their role in pathogenesis of bacterial disease. Vet. Pathol. 51(2), 328\u2013340 (2014)","journal-title":"Vet. Pathol."},{"key":"9378_CR14","doi-asserted-by":"crossref","unstructured":"I. Harvey, The microbial genetic algorithm. In: European Conference on Artificial Life, ECAL 2009, LNCS, vol. 5778 (Springer, 2009), pp. 126\u2013133","DOI":"10.1007\/978-3-642-21314-4_16"},{"key":"9378_CR15","doi-asserted-by":"crossref","unstructured":"J. Husa, R. Kalkreuth, A comparative study on crossover in cartesian genetic programming. In: Proceedings of European Conference on Genetic Programming, EuroGP 2018, LNCS, vol. 10781 (Springer, 2018), pp. 203\u2013219","DOI":"10.1007\/978-3-319-77553-1_13"},{"key":"9378_CR16","doi-asserted-by":"publisher","unstructured":"C. Igel, Neuroevolution for reinforcement learning using evolution strategies. In: IEEE Congress on Evolutionary Computation, CEC 2003, vol.\u00a04 (IEEE, 2003), pp. 2588\u20132595. https:\/\/doi.org\/10.1109\/CEC.2003.1299414","DOI":"10.1109\/CEC.2003.1299414"},{"key":"9378_CR17","doi-asserted-by":"crossref","unstructured":"R. Kalkreuth, G. Rudolph, A. Droschinsky, A new subgraph crossover for cartesian genetic programming. In: Proceedings of European Conference on Genetic Programming, EuroGP 2017, LNCS, vol. 10196 (Springer, 2017), pp. 294\u2013310","DOI":"10.1007\/978-3-319-55696-3_19"},{"issue":"8","key":"9378_CR18","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1038\/nrg2386","volume":"9","author":"PJ Keeling","year":"2008","unstructured":"P.J. Keeling, J.D. Palmer, Horizontal gene transfer in eukaryotic evolution. Nat. Rev. Genet. 9(8), 605 (2008)","journal-title":"Nat. Rev. Genet."},{"key":"9378_CR19","doi-asserted-by":"publisher","unstructured":"M.M. Khan, G.M. Khan, J.F. Miller, Efficient representation of recurrent neural networks for markovian\/non-markovian non-linear control problems. In: Proceedings of 10th International Conference on Intelligent Systems Design and Applications, (ISDA 2010), pp. 615\u2013620. https:\/\/doi.org\/10.1109\/ISDA.2010.5687197","DOI":"10.1109\/ISDA.2010.5687197"},{"key":"9378_CR20","doi-asserted-by":"publisher","unstructured":"J. Koutnik, F. Gomez, J. Schmidhuber, Evolving neural networks in compressed weight space. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2010 (ACM, 2010), pp. 619\u2013626. https:\/\/doi.org\/10.1145\/1830483.1830596","DOI":"10.1145\/1830483.1830596"},{"key":"9378_CR21","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"JR Koza","year":"1992","unstructured":"J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, vol. 1 (MIT Press, Cambridge, 1992)"},{"issue":"1","key":"9378_CR22","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1214\/aoms\/1177730491","volume":"18","author":"HB Mann","year":"1947","unstructured":"H.B. Mann, D.R. Whitney, On a test of whether one of two random variables is stochastically larger than the other. Ann. Math. Stat. 18(1), 50\u201360 (1947)","journal-title":"Ann. Math. Stat."},{"key":"9378_CR23","unstructured":"J.F. Miller, An empirical study of the efficiency of learning boolean functions using a cartesian genetic programming approach. In: Proceedings of 1st Annual Conference on Genetic and Evolutionary Computation, GECCO \u201999, vol.\u00a02 (Morgan Kaufmann Publishers Inc., 1999), pp. 1135\u20131142"},{"key":"9378_CR24","doi-asserted-by":"crossref","unstructured":"J.F. Miller, Cartesian genetic programming. In: Cartesian Genetic Programming (Springer, 2011), pp. 17\u201334","DOI":"10.1007\/978-3-642-17310-3_2"},{"issue":"2","key":"9378_CR25","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TEVC.2006.871253","volume":"10","author":"JF Miller","year":"2006","unstructured":"J.F. Miller, S.L. Smith, Redundancy and computational efficiency in cartesian genetic programming. IEEE Trans. Evol. Comput. 10(2), 167\u2013174 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9378_CR26","unstructured":"D.E. Moriarty, Symbiotic Evolution of Neural Networks in Sequential Decision Tasks. Ph.D. thesis, University of Texas at Austin USA (1997)"},{"key":"9378_CR27","unstructured":"M. Nicolau, A. Agapitos, M. O\u2019Neill, A. Brabazon, Guidelines for defining benchmark problems in genetic programming. In: 2015 IEEE Congress on Evolutionary Computation, CEC (2015), pp. 1152\u20131159"},{"issue":"4","key":"9378_CR28","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"M. O\u2019Neill, C. Ryan, Grammatical evolution. IEEE Trans. Evolut. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9378_CR29","unstructured":"R. Poli, Evolution of graph-like programs with parallel distributed genetic programming. In: Procedings of International Conference on Genetic Algorithms, ICGA (Morgan Kaufmann, 1997), pp. 346\u2013353"},{"issue":"3","key":"9378_CR30","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1086\/BBLv227n3p300","volume":"227","author":"JA Schwartz","year":"2014","unstructured":"J.A. Schwartz, N.E. Curtis, S.K. Pierce, Fish labeling reveals a horizontally transferred algal (vaucheria litorea) nuclear gene on a sea slug (elysia chlorotica) chromosome. Biol. Bull. 227(3), 300\u2013312 (2014)","journal-title":"Biol. Bull."},{"key":"9378_CR31","unstructured":"K.O. Stanley, Efficient Evolution of Neural Networks Through Complexification. Ph.D. thesis, The University of Texas at Austin (2004). http:\/\/nn.cs.utexas.edu\/?stanley:phd2004"},{"key":"9378_CR32","doi-asserted-by":"publisher","unstructured":"Y. Tsoy, V. Spitsyn, Using genetic algorithm with adaptive mutation mechanism for neural networks design and training. In: Proceedings of 9th Russian-Korean International Symposium on Science and Technology, KORUS 2005 (IEEE, 2005), pp. 709\u2013714. https:\/\/doi.org\/10.1109\/KORUS.2005.1507882","DOI":"10.1109\/KORUS.2005.1507882"},{"key":"9378_CR33","unstructured":"A. Turner, Evolving Artificial Neural Networks Using Cartesian Genetic Programming. Ph.D. thesis, University of York (2015). http:\/\/etheses.whiterose.ac.uk\/12035\/1\/thesis.pdf"},{"key":"9378_CR34","doi-asserted-by":"crossref","unstructured":"A. Turner, J. Miller, Cartesian genetic programming: why no bloat? In: Proceedings of European Conference on Genetic Programming, EuroGP 2014, LNCS, vol. 8599 (Springer, 2014), pp. 222\u2013233","DOI":"10.1007\/978-3-662-44303-3_19"},{"key":"9378_CR35","doi-asserted-by":"publisher","unstructured":"A.J. Turner, J.F. Miller, Cartesian genetic programming encoded artificial neural networks: a comparison using three benchmarks. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2013 (ACM, 2013), pp. 1005\u20131012. https:\/\/doi.org\/10.1145\/2463372.2463484","DOI":"10.1145\/2463372.2463484"},{"key":"9378_CR36","doi-asserted-by":"crossref","unstructured":"A.J Turner, J.F. Miller, Recurrent cartesian genetic programming. In: Proceedings of International Conference on Parallel Problem Solving from Nature, PPSN 2014, LNCS, vol. 8672 (Springer, 2014), pp. 476\u2013486","DOI":"10.1007\/978-3-319-10762-2_47"},{"issue":"1","key":"9378_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10710-014-9233-1","volume":"16","author":"AJ Turner","year":"2015","unstructured":"A.J. Turner, J.F. Miller, Introducing a cross platform open source cartesian genetic programming library. Genet. Program. Evolv. Mach. 16(1), 83\u201391 (2015)","journal-title":"Genet. Program. Evolv. Mach."},{"issue":"2","key":"9378_CR38","first-page":"101","volume":"25","author":"A Vargha","year":"2000","unstructured":"A. Vargha, H.D. Delaney, A critique and improvement of the CL common language effect size statistics of McGraw and Wong. J. Educ. Behav. Stat. 25(2), 101\u2013132 (2000)","journal-title":"J. Educ. Behav. Stat."},{"issue":"4","key":"9378_CR39","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1109\/TEVC.2007.903549","volume":"12","author":"JA Walker","year":"2008","unstructured":"J.A. Walker, J.F. Miller, The automatic acquisition, evolution and reuse of modules in cartesian genetic programming. IEEE Trans. Evolut. Comput. 12(4), 397\u2013417 (2008)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"9378_CR40","doi-asserted-by":"crossref","unstructured":"A.P. Wieland, Evolving controls for unstable systems. In: Connectionist Models (Elsevier, 1991), pp. 91\u2013102","DOI":"10.1016\/B978-1-4832-1448-1.50015-9"},{"key":"9378_CR41","doi-asserted-by":"publisher","unstructured":"A.P. Wieland, Evolving neural network controllers for unstable systems. In: Seattle International Joint Conference on Neural Networks, IJCNN 91, vol.\u00a02 (IEEE, 1991), pp. 667\u2013673. https:\/\/doi.org\/10.1109\/IJCNN.1991.155416","DOI":"10.1109\/IJCNN.1991.155416"},{"key":"9378_CR42","doi-asserted-by":"publisher","unstructured":"D. Wierstra, A. Foerster, J. Peters, J. Schmidhuber, Solving deep memory POMDPs with recurrent policy gradients. In: Proceedings of Artificial Neural Networks, ICANN 2007, LNCS, vol. 4668 (Springer, 2007), pp. 697\u2013706. https:\/\/doi.org\/10.1007\/978-3-540-74690-4_71","DOI":"10.1007\/978-3-540-74690-4_71"},{"issue":"5982","key":"9378_CR43","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1126\/science.1187145","volume":"328","author":"S Yoshida","year":"2010","unstructured":"S. Yoshida, S. Maruyama, H. Nozaki, K. Shirasu, Horizontal gene transfer by the parasitic plant striga hermonthica. Science 328(5982), 1128\u20131128 (2010)","journal-title":"Science"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-020-09378-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-020-09378-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-020-09378-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T04:59:52Z","timestamp":1665723592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-020-09378-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,3]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["9378"],"URL":"https:\/\/doi.org\/10.1007\/s10710-020-09378-1","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"type":"print","value":"1389-2576"},{"type":"electronic","value":"1573-7632"}],"subject":[],"published":{"date-parts":[[2020,2,3]]},"assertion":[{"value":"14 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}