{"id":"https://openalex.org/W1584056478","doi":"https://doi.org/10.1109/cec.2005.1554823","title":"Single Parent Genetic Programming","display_name":"Single Parent Genetic Programming","publication_year":2005,"publication_date":"2005-12-13","ids":{"openalex":"https://openalex.org/W1584056478","doi":"https://doi.org/10.1109/cec.2005.1554823","mag":"1584056478"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2005.1554823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066757355","display_name":"Wendy Ashlock","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"W. Ashlock","raw_affiliation_strings":["Roseheart Biomaths, Guelph, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Roseheart Biomaths, Guelph, ONT, Canada","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080870632","display_name":"Daniel Ashlock","orcid":"https://orcid.org/0000-0003-2209-7504"},"institutions":[{"id":"https://openalex.org/I79817857","display_name":"University of Guelph","ror":"https://ror.org/01r7awg59","country_code":"CA","type":"education","lineage":["https://openalex.org/I79817857"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"D. Ashlock","raw_affiliation_strings":["Mathematics and Statistics, University of Guelph, Guelph, ONT, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics and Statistics, University of Guelph, Guelph, ONT, Canada","institution_ids":["https://openalex.org/I79817857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9716,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.86833947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"2","issue":null,"first_page":"1172","last_page":"1179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9757999777793884,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.9308867454528809},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.773776650428772},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5366325974464417},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5358705520629883},{"id":"https://openalex.org/keywords/ancestor","display_name":"Ancestor","score":0.4989345073699951},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47858715057373047},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45453765988349915},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4272370934486389},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3725772202014923},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35152125358581543},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2976630926132202},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29561108350753784},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2387714684009552},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.19624507427215576},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17718127369880676}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.9308867454528809},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.773776650428772},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5366325974464417},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5358705520629883},{"id":"https://openalex.org/C2780422015","wikidata":"https://www.wikidata.org/wiki/Q402152","display_name":"Ancestor","level":2,"score":0.4989345073699951},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47858715057373047},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45453765988349915},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4272370934486389},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3725772202014923},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35152125358581543},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2976630926132202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29561108350753784},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2387714684009552},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.19624507427215576},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17718127369880676},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2005.1554823","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2005.1554823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2005 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.94.3796","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.94.3796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eldar.mathstat.uoguelph.ca/dashlock/eprints/SP-I.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W92444230","https://openalex.org/W106723995","https://openalex.org/W147708904","https://openalex.org/W195993229","https://openalex.org/W1493611775","https://openalex.org/W1513434371","https://openalex.org/W1568404366","https://openalex.org/W1569757501","https://openalex.org/W1961482980","https://openalex.org/W2029874061","https://openalex.org/W2062663664","https://openalex.org/W2155802383","https://openalex.org/W2167609699","https://openalex.org/W2331296304","https://openalex.org/W2418011578","https://openalex.org/W2526208276","https://openalex.org/W4210567833","https://openalex.org/W4238753141","https://openalex.org/W6603769662","https://openalex.org/W6604397998","https://openalex.org/W6629365653","https://openalex.org/W6684708117"],"related_works":["https://openalex.org/W2082776239","https://openalex.org/W2142324575","https://openalex.org/W2051028534","https://openalex.org/W2164305954","https://openalex.org/W1501730763","https://openalex.org/W2046401452","https://openalex.org/W1772786136","https://openalex.org/W1963986408","https://openalex.org/W235718540","https://openalex.org/W1593354505"],"abstract_inverted_index":{"The":[0,17,103,118,138],"most":[1],"controversial":[2],"part":[3],"of":[4,47,63,67,79,100,105,140,149,162],"genetic":[5,42,48,115],"programming":[6,43,49,116],"is":[7,24,44,53,120],"its":[8,25],"highly":[9],"disruptive":[10,98],"and":[11,76,131,147,170],"potentially":[12],"innovative":[13],"subtree":[14,57],"crossover":[15,22,58,80],"operator.":[16],"clearest":[18],"problem":[19,136,146,177],"with":[20,59,144],"the":[21,90,94,114,141,145,153,167,175],"operator":[23],"potential":[26],"to":[27,158],"induce":[28],"defensive":[29],"meta-selection":[30],"for":[31,96,166,174],"large":[32,101],"parse":[33],"trees,":[34],"a":[35,45,60,132],"process":[36],"usually":[37],"termed":[38],"\"bloat.\"":[39],"Single":[40],"parent":[41],"form":[46],"in":[50,89,156,160],"which":[51],"bloat":[52],"reduced":[54],"by":[55],"doing":[56],"fixed":[61,75],"population":[62],"ancestor":[64,106,150],"trees.":[65,102],"Analysis":[66],"mean":[68],"tree":[69,87],"size":[70,88],"growth":[71],"demonstrates":[72],"that":[73],"this":[74],"limited":[77],"set":[78],"partners":[81],"provides":[82],"implicit,":[83],"automatic":[84],"control":[85],"on":[86,122],"evolving":[91],"population,":[92],"reducing":[93],"need":[95],"additionally":[97],"trimming":[99],"choice":[104,148],"trees":[107],"can":[108],"also":[109],"incorporate":[110],"expert":[111],"knowledge":[112],"into":[113],"system.":[117],"system":[119],"tested":[121],"four":[123],"problems:":[124],"plus-one-recall-store":[125],"(PORS),":[126],"odd":[127],"parity,":[128],"plus-times-half":[129],"(PTH)":[130],"bioinformatics":[133],"model":[134],"fitting":[135],"(NIPs).":[137],"effectiveness":[139],"technique":[142],"varies":[143],"set.":[151],"At":[152],"extremes,":[154],"improvements":[155,173],"time":[157],"solution":[159],"excess":[161],"4700-fold":[163],"were":[164,178],"observed":[165],"PORS":[168],"problem,":[169],"no":[171],"significant":[172],"PTH":[176],"observed.":[179]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}