{"id":"https://openalex.org/W1939063554","doi":"https://doi.org/10.1109/cec.2002.1004543","title":"A memetic algorithm instantiated with selection sort consistently finds global optima for the error-correcting graph isomorphism","display_name":"A memetic algorithm instantiated with selection sort consistently finds global optima for the error-correcting graph isomorphism","publication_year":2003,"publication_date":"2003-06-25","ids":{"openalex":"https://openalex.org/W1939063554","doi":"https://doi.org/10.1109/cec.2002.1004543","mag":"1939063554"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2002.1004543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2002.1004543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","raw_type":"proceedings-article"},"type":"article","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/A5012644227","display_name":"Rodolfo Torres-Vel\u00e1zquez","orcid":null},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"R. Torres-Velazquez","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061047124","display_name":"Vladimir Estivill\u2010Castro","orcid":"https://orcid.org/0000-0001-7775-0780"},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"V. Estivill-Castro","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]},{"raw_affiliation_string":"Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia","institution_ids":["https://openalex.org/I78757542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.14245216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1958","last_page":"1963"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9973999857902527,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/sorting","display_name":"Sorting","score":0.6548186540603638},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.6136463284492493},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5680676698684692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5517803430557251},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4739026129245758},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.4348013401031494},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4318031966686249},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40495800971984863},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3582760989665985},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3522030711174011}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6548186540603638},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.6136463284492493},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5680676698684692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5517803430557251},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4739026129245758},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4348013401031494},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4318031966686249},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40495800971984863},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3582760989665985},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3522030711174011},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2002.1004543","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2002.1004543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600)","raw_type":"proceedings-article"},{"id":"pmh:oai:research-repository.griffith.edu.au:10072/22849","is_oa":false,"landing_page_url":"http://hdl.handle.net/10072/22849","pdf_url":null,"source":{"id":"https://openalex.org/S4306402548","display_name":"Griffith Research Online (Griffith University, Queensland, Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11701301","host_organization_name":"Griffith University","host_organization_lineage":["https://openalex.org/I11701301"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference output"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W168006464","https://openalex.org/W1516301787","https://openalex.org/W1562968555","https://openalex.org/W1605502715","https://openalex.org/W1709754610","https://openalex.org/W1787544972","https://openalex.org/W1977866540","https://openalex.org/W2013363798","https://openalex.org/W2097904397","https://openalex.org/W2098677716","https://openalex.org/W2106378689","https://openalex.org/W2153401650","https://openalex.org/W2156698647","https://openalex.org/W2163528881","https://openalex.org/W2166843422","https://openalex.org/W2433790761","https://openalex.org/W2801910904","https://openalex.org/W2912569805","https://openalex.org/W2976664243","https://openalex.org/W4300005723","https://openalex.org/W6606839663","https://openalex.org/W6630838125","https://openalex.org/W6638021218","https://openalex.org/W6682914103","https://openalex.org/W6718260763","https://openalex.org/W6758375369","https://openalex.org/W6802923458"],"related_works":["https://openalex.org/W2809748609","https://openalex.org/W2095055219","https://openalex.org/W2908348257","https://openalex.org/W3033694952","https://openalex.org/W2994182992","https://openalex.org/W2372558933","https://openalex.org/W2116295091","https://openalex.org/W2362374543","https://openalex.org/W2085265870","https://openalex.org/W2348196682"],"abstract_inverted_index":{"We":[0,28],"study":[1],"several":[2],"tested":[3],"cases":[4],"of":[5,14,91],"the":[6,21,62,73,83,88,92],"error-correcting":[7],"graph":[8],"isomorphism":[9],"problem.":[10,27],"The":[11],"set":[12],"Sn":[13],"n!":[15],"permutations":[16,70],"on":[17,41,48],"n":[18],"items":[19],"is":[20,32,65,85],"search":[22],"space":[23],"for":[24,112],"this":[25,113],"optimization":[26],"apply":[29],"MA-sorting.":[30],"This":[31],"a":[33,51,56,66],"memetic":[34],"algorithm":[35,46,94],"with":[36,100,106],"domain-independent":[37],"mutation":[38,63,84],"operators":[39],"based":[40],"classical":[42],"sorting.":[43],"Each":[44],"sorting":[45,74,93],"works":[47],"results":[49,79],"to":[50,96],"comparison":[52,89],"predicate":[53],"and":[54,87],"defines":[55],"path":[57],"in":[58,80],"SI.,.":[59],"In":[60,98],"MA-sorting":[61,104],"operator":[64,90],"local-search":[67],"that":[68],"evaluates":[69,95],"suggested":[71],"by":[72],"algorithm.":[75],"When":[76],"such":[77],"evaluation":[78],"an":[81],"improvement,":[82],"accepted":[86],"true.":[97],"contrast":[99],"previous":[101],"proposals,":[102],"our":[103],"instantiated":[105],"selection":[107],"sort":[108],"finds":[109],"optimal":[110],"solutions":[111],"case":[114],"study.":[115]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}