{"id":"https://openalex.org/W2592818772","doi":"https://doi.org/10.1186/s13015-017-0096-x","title":"Approximating the correction of weighted and unweighted orthology and paralogy relations","display_name":"Approximating the correction of weighted and unweighted orthology and paralogy relations","publication_year":2017,"publication_date":"2017-03-10","ids":{"openalex":"https://openalex.org/W2592818772","doi":"https://doi.org/10.1186/s13015-017-0096-x","mag":"2592818772","pmid":"https://pubmed.ncbi.nlm.nih.gov/28293276"},"language":"en","primary_location":{"id":"doi:10.1186/s13015-017-0096-x","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-017-0096-x","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0096-x","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0096-x","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110357719","display_name":"Riccardo Dondi","orcid":null},"institutions":[{"id":"https://openalex.org/I11039511","display_name":"University of Bergamo","ror":"https://ror.org/02mbd5571","country_code":"IT","type":"education","lineage":["https://openalex.org/I11039511"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Riccardo Dondi","raw_affiliation_strings":["Dipartimento di Lettere, Filosofia, Comunicazione, Universit\u00e0 degli Studi di Bergamo, Via Donizetti 3, 24129 Bergamo, Italy","Dipartimento di Lettere, Filosofia, Comunicazione, Universit\u00e0 degli Studi di Bergamo, Via Donizetti 3, 24129, Bergamo, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Lettere, Filosofia, Comunicazione, Universit\u00e0 degli Studi di Bergamo, Via Donizetti 3, 24129 Bergamo, Italy","institution_ids":[]},{"raw_affiliation_string":"Dipartimento di Lettere, Filosofia, Comunicazione, Universit\u00e0 degli Studi di Bergamo, Via Donizetti 3, 24129, Bergamo, Italy","institution_ids":["https://openalex.org/I11039511"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016796629","display_name":"Manuel Lafond","orcid":"https://orcid.org/0000-0002-5305-7372"},"institutions":[{"id":"https://openalex.org/I153718931","display_name":"University of Ottawa","ror":"https://ror.org/03c4mmv16","country_code":"CA","type":"education","lineage":["https://openalex.org/I153718931"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Manuel Lafond","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Ottawa, Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Ottawa, Ottawa, Canada","institution_ids":["https://openalex.org/I153718931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041470344","display_name":"Nadia El-Mabrouk","orcid":"https://orcid.org/0000-0002-5385-1015"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nadia El-Mabrouk","raw_affiliation_strings":["D\u00e9partement d'informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Quebec, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement d'informatique et de recherche op\u00e9rationnelle, Universit\u00e9 de Montr\u00e9al, Quebec, Canada","institution_ids":["https://openalex.org/I70931966"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110357719"],"corresponding_institution_ids":["https://openalex.org/I11039511"],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":3.5916,"has_fulltext":true,"cited_by_count":22,"citation_normalized_percentile":{"value":0.92641314,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"12","issue":"1","first_page":"4","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.7973999977111816,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.7973999977111816,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.08089999854564667,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.03500000014901161,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6256179213523865},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5490772724151611},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.543419599533081},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.48154786229133606},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.4794241786003113},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4741467833518982},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4636560380458832},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43839728832244873},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4303930401802063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42260611057281494},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.20044013857841492}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6256179213523865},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5490772724151611},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.543419599533081},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.48154786229133606},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.4794241786003113},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4741467833518982},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4636560380458832},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43839728832244873},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4303930401802063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42260611057281494},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.20044013857841492},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1186/s13015-017-0096-x","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-017-0096-x","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0096-x","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:28293276","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/28293276","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:oai:aisberg.unibg.it:10446/84267","is_oa":true,"landing_page_url":"http://hdl.handle.net/10446/84267","pdf_url":"http://hdl.handle.net/10446/84267","source":{"id":"https://openalex.org/S4377196347","display_name":"Aisberg (University of Bergamo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11039511","host_organization_name":"University of Bergamo","host_organization_lineage":["https://openalex.org/I11039511"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pubmedcentral.nih.gov:5346272","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/5346272","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms Mol Biol","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1186/s13015-017-0096-x","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-017-0096-x","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0096-x","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320334841","display_name":"Fonds de recherche du Qu\u00e9bec \u2013 Nature et technologies","ror":"https://ror.org/00b9f9778"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2592818772.pdf","grobid_xml":"https://content.openalex.org/works/W2592818772.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W39630659","https://openalex.org/W319819633","https://openalex.org/W598887167","https://openalex.org/W1575387405","https://openalex.org/W1586744224","https://openalex.org/W1965193466","https://openalex.org/W1979835060","https://openalex.org/W1987195907","https://openalex.org/W1992296962","https://openalex.org/W1995615099","https://openalex.org/W1997093937","https://openalex.org/W2008856488","https://openalex.org/W2008978934","https://openalex.org/W2015906942","https://openalex.org/W2028356989","https://openalex.org/W2041346050","https://openalex.org/W2057463094","https://openalex.org/W2103017472","https://openalex.org/W2121654623","https://openalex.org/W2133790733","https://openalex.org/W2135123683","https://openalex.org/W2135281627","https://openalex.org/W2135398177","https://openalex.org/W2142045367","https://openalex.org/W2161719898","https://openalex.org/W2339182468","https://openalex.org/W2345982775","https://openalex.org/W4229487902","https://openalex.org/W4231886136"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2043159103","https://openalex.org/W2391769344","https://openalex.org/W4297790016","https://openalex.org/W2359260952","https://openalex.org/W2769269860","https://openalex.org/W52360167","https://openalex.org/W2170077473"],"abstract_inverted_index":{"BACKGROUND:":[0],"Given":[1],"a":[2,13,29,34,44,57,76,82,93,110,125,172],"gene":[3,30,58],"family,":[4],"the":[5,37,71,89,103,107,129,133,137,142,152,168,180,194,203],"relations":[6],"between":[7],"genes":[8,22],"(orthology/paralogy),":[9],"are":[10],"represented":[11],"by":[12],"relation":[14,35,45,94,173],"graph,":[15,36],"where":[16,109],"edges":[17,25],"connect":[18],"pairs":[19],"of":[20,91,106,112,128,132,139,167,170],"orthologous":[21],"and":[23,98,162,177],"\"missing\"":[24],"represent":[26,75],"paralogs.":[27],"While":[28],"tree":[31,72],"directly":[32],"induces":[33],"converse":[38],"is":[39,47,114],"not":[40,48,53,67,74],"always":[41],"true.":[42],"Indeed,":[43],"graph":[46,95,174],"necessarily":[49,54],"\"satisfiable\",":[50],"i.e.":[51,70],"does":[52],"correspond":[55],"to":[56,116,186,201],"tree.":[59,84],"And":[60],"even":[61],"if":[62],"that":[63],"holds,":[64],"it":[65],"may":[66,73],"be":[68],"\"consistent\",":[69],"true":[77],"history":[78],"in":[79,141],"agreement":[80],"with":[81],"species":[83],"Previous":[85],"studies":[86],"have":[87],"addressed":[88],"problem":[90,169],"correcting":[92,171],"for":[96,151,155,165,175,193],"satisfiability":[97,176],"consistency.":[99,178],"Here":[100],"we":[101,183,198],"consider":[102,124],"weighted":[104,195],"version":[105,131],"problem,":[108],"degree":[111],"confidence":[113],"assigned":[115],"each":[117],"orthology":[118],"or":[119],"paralogy":[120],"relation.":[121],"We":[122,144,159],"also":[123,145],"maximization":[126,153,181],"variant":[127,154],"unweighted":[130,156],"problem.":[134],"RESULTS:":[135],"being":[136],"number":[138],"vertices":[140],"graph.":[143],"provide":[146,202],"polynomial":[147,188],"time":[148,189],"approximation":[149,190],"schemes":[150],"graphs.":[157],"CONCLUSIONS:":[158],"provided":[160],"complexity":[161],"algorithmic":[163],"results":[164],"variants":[166,182,197],"For":[179],"were":[184,199],"able":[185,200],"design":[187],"schemes,":[191],"while":[192],"minimization":[196],"first":[204],"inapproximability":[205],"results.":[206]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}