{"id":"https://openalex.org/W7233988097","doi":"https://doi.org/10.5753/eniac.2026.31457","title":"An Integer Linear Programming and Biased Random-Key Genetic Algorithm for the Sequence-to-Graph Alignment Problem with Vertex Label Modification","display_name":"An Integer Linear Programming and Biased Random-Key Genetic Algorithm for the Sequence-to-Graph Alignment Problem with Vertex Label Modification","alternate_titles":[],"publication_year":2026,"publication_date":"2026-10-19","ids":{"openalex":"https://openalex.org/W7233988097","doi":"https://doi.org/10.5753/eniac.2026.31457"},"language":"en","primary_location":{"id":"doi:10.5753/eniac.2026.31457","doi":"https://doi.org/10.5753/eniac.2026.31457","is_oa":false,"landing_page_url":"https://doi.org/10.5753/eniac.2026.31457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Anais do XXIII Encontro Nacional de Intelig\u00eancia Artificial e Computacional (ENIAC 2026)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W7233988097"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://sol.sbc.org.br/index.php/eniac/article/download/47073/46830","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5162437318","display_name":"Gabriel Pereira Falc\u00e3o","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gabriel Pereira Falc\u00e3o","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5162218994","display_name":"Erick Rodrigues de Lemos Ribeiro","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Erick Rodrigues de Lemos Ribeiro","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049504087","display_name":"Matheus Amorim Martins","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matheus Amorim Martins","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043528531","display_name":"Eduardo Theodoro Bogue","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eduardo Theodoro Bogue","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083018192","display_name":"Said Sadique Adi","orcid":"https://orcid.org/0000-0002-0349-7441","observed_orcids":["https://orcid.org/0000-0002-0349-7441"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Said Sadique Adi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"3547","last_page":"3558"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8910999894142151,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.8910999894142151,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.029400000348687172,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.028200000524520874,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.7919999957084656},{"id":"https://openalex.org/keywords/biased-random-key-genetic-algorithm","display_name":"biased random-key genetic algorithm","score":0.9959999918937683},{"id":"https://openalex.org/keywords/graph-alignment","display_name":"graph alignment","score":0.625},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.7179999947547913},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.6579999923706055}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7379999756813049},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5449000000953674},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5281000137329102},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5016000270843506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46399998664855957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4632999897003174},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43689998984336853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4287000000476837},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3921999931335449},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3598000109195709},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3515999913215637},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.34130001068115234},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.32899999618530273},{"id":"https://openalex.org/C202269582","wikidata":"https://www.wikidata.org/wiki/Q2644277","display_name":"Complementarity (molecular biology)","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31130000948905945},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29820001125335693},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.28189998865127563},{"id":"https://openalex.org/C34320192","wikidata":"https://www.wikidata.org/wiki/Q783105","display_name":"Linear complementarity problem","level":3,"score":0.27959999442100525},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5753/eniac.2026.31457","doi":"https://doi.org/10.5753/eniac.2026.31457","is_oa":false,"landing_page_url":"https://doi.org/10.5753/eniac.2026.31457","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Anais do XXIII Encontro Nacional de Intelig\u00eancia Artificial e Computacional (ENIAC 2026)","raw_type":"proceedings-article"},{"id":"pmh:oai:sol.sbc.org.br:article/47073","doi":null,"is_oa":true,"landing_page_url":"https://sol.sbc.org.br/index.php/eniac/article/view/47073","pdf_url":"https://sol.sbc.org.br/index.php/eniac/article/download/47073/46830","source":{"id":"https://openalex.org/S4387283521","display_name":"Anais do Encontro Nacional de Intelig\u00eancia Artificial e Computacional (ENIAC)","issn_l":"2763-9061","issn":["2763-9061"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310312150","host_organization_name":"Brazilian Computer Society","host_organization_lineage":["https://openalex.org/P4310312150"],"host_organization_lineage_names":["Brazilian Computer Society"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.5753/eniac.2026","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:sol.sbc.org.br:article/47073","doi":null,"is_oa":true,"landing_page_url":"https://sol.sbc.org.br/index.php/eniac/article/view/47073","pdf_url":"https://sol.sbc.org.br/index.php/eniac/article/download/47073/46830","source":{"id":"https://openalex.org/S4387283521","display_name":"Anais do Encontro Nacional de Intelig\u00eancia Artificial e Computacional (ENIAC)","issn_l":"2763-9061","issn":["2763-9061"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310312150","host_organization_name":"Brazilian Computer Society","host_organization_lineage":["https://openalex.org/P4310312150"],"host_organization_lineage_names":["Brazilian Computer Society"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10.5753/eniac.2026","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7233988097.pdf","grobid_xml":"https://content.openalex.org/works/W7233988097.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1978981589","https://openalex.org/W2054895735","https://openalex.org/W2153386665","https://openalex.org/W2166348281","https://openalex.org/W2168079536","https://openalex.org/W2543066836","https://openalex.org/W2575750030","https://openalex.org/W2603734366","https://openalex.org/W2888300707","https://openalex.org/W2971433408","https://openalex.org/W3018787322","https://openalex.org/W3088400220","https://openalex.org/W4206067192","https://openalex.org/W4312512934","https://openalex.org/W4404062777","https://openalex.org/W7171376509"],"related_works":["https://openalex.org/W2999349690","https://openalex.org/W2952746707","https://openalex.org/W3001121439","https://openalex.org/W7097489598","https://openalex.org/W4406260960","https://openalex.org/W4285226269","https://openalex.org/W7127954862","https://openalex.org/W7097641789","https://openalex.org/W7171376509","https://openalex.org/W2955274270"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,18,22,31,57,60,62,72,76,87,101],"Sequence-to-Graph":[4],"Alignment":[5],"Problem":[6],"with":[7,83],"Vertex":[8],"Label":[9],"Modification,":[10],"where":[11],"vertex":[12],"labels":[13],"may":[14],"be":[15],"altered,":[16],"shifting":[17],"objective":[19],"to":[20,69,100],"minimizing":[21],"modification":[23],"cost":[24],"for":[25],"an":[26,39],"exact":[27,40],"alignment.":[28],"To":[29],"tackle":[30],"computational":[32],"complexity":[33],"of":[34],"this":[35],"problem,":[36],"we":[37],"propose":[38],"Integer":[41],"Linear":[42],"Programming":[43],"(ILP)":[44],"formulation":[45],"and":[46,91],"a":[47],"Biased":[48],"Random-Key":[49],"Genetic":[50],"Algorithm":[51],"(BRKGA)":[52],"metaheuristic.":[53],"Computational":[54],"experiments":[55],"reveal":[56],"complementarity":[58],"between":[59],"methods:":[61],"ILP":[63,102],"efficiently":[64],"solves":[65],"moderately":[66],"sized":[67],"instances":[68],"optimality,":[70],"while":[71],"BRKGA":[73],"excels":[74],"in":[75],"most":[77],"challenging":[78],"scenarios":[79],"(large,":[80],"sparse":[81],"graphs":[82],"long":[84],"queries),":[85],"improving":[86],"best-known":[88],"upper":[89],"bounds":[90],"reducing":[92],"alignment":[93],"costs":[94],"by":[95],"more":[96],"than":[97],"50%":[98],"relative":[99],"solutions.":[103]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7233988097","counts_by_year":[],"updated_date":"2026-11-18T13:11:19.462570","created_date":"2026-11-17T00:00:00"}
