{"id":"https://openalex.org/W4414725606","doi":"https://doi.org/10.1186/s13015-025-00283-9","title":"Finding maximum common contractions between phylogenetic networks","display_name":"Finding maximum common contractions between phylogenetic networks","publication_year":2025,"publication_date":"2025-10-01","ids":{"openalex":"https://openalex.org/W4414725606","doi":"https://doi.org/10.1186/s13015-025-00283-9","pmid":"https://pubmed.ncbi.nlm.nih.gov/41035063"},"language":"en","primary_location":{"id":"doi:10.1186/s13015-025-00283-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-025-00283-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-025-00283-9","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","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/counter/pdf/10.1186/s13015-025-00283-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014123931","display_name":"Bertrand Marchand","orcid":"https://orcid.org/0000-0001-8060-6640"},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bertrand Marchand","raw_affiliation_strings":["Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada. bertrand.marchand@usherbrooke.ca","Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada. bertrand.marchand@usherbrooke.ca","institution_ids":["https://openalex.org/I135117807"]},{"raw_affiliation_string":"Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada","institution_ids":["https://openalex.org/I135117807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083583971","display_name":"Nadia Tahiri","orcid":"https://orcid.org/0000-0002-1818-208X"},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Nadia Tahiri","raw_affiliation_strings":["Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada","institution_ids":["https://openalex.org/I135117807"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119804897","display_name":"Shohreh Golpaigani Fard","orcid":null},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Shohreh Golpaigani Fard","raw_affiliation_strings":["Department of Computer Science, University of Manitoba, 75 Chancellors Cir, R3T5V6, Winnipeg, MB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manitoba, 75 Chancellors Cir, R3T5V6, Winnipeg, MB, Canada","institution_ids":["https://openalex.org/I46247651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042753556","display_name":"Olivier Tremblay-Savard","orcid":"https://orcid.org/0000-0003-2514-0264"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Olivier Tremblay-Savard","raw_affiliation_strings":["Department of Computer Science, University of Manitoba, 75 Chancellors Cir, R3T5V6, Winnipeg, MB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manitoba, 75 Chancellors Cir, R3T5V6, Winnipeg, MB, Canada","institution_ids":["https://openalex.org/I46247651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016796629","display_name":"Manuel Lafond","orcid":"https://orcid.org/0000-0002-5305-7372"},"institutions":[{"id":"https://openalex.org/I135117807","display_name":"Universit\u00e9 de Sherbrooke","ror":"https://ror.org/00kybxq39","country_code":"CA","type":"education","lineage":["https://openalex.org/I135117807"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Manuel Lafond","raw_affiliation_strings":["Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departement d'Informatique, University of Sherbrooke, 2500 Boulevard de l'Universite, J1K2R1, Sherbrooke, QC, Canada","institution_ids":["https://openalex.org/I135117807"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5014123931"],"corresponding_institution_ids":["https://openalex.org/I135117807"],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":0.6802,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.73889426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"20","issue":"1","first_page":"18","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9853000044822693,"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"}},"topics":[{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9853000044822693,"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/T10887","display_name":"Bioinformatics and Genomic Networks","score":0.965399980545044,"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9287999868392944,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/phylogenetic-tree","display_name":"Phylogenetic tree","score":0.6834999918937683},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6179999709129333},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.555400013923645},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5072000026702881},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47099998593330383},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.35920000076293945},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3582000136375427}],"concepts":[{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.6834999918937683},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6179999709129333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5795999765396118},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.555400013923645},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5072000026702881},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4052000045776367},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3582000136375427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35749998688697815},{"id":"https://openalex.org/C26619641","wikidata":"https://www.wikidata.org/wiki/Q3142246","display_name":"Phylogenetic network","level":4,"score":0.35580000281333923},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35519999265670776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34119999408721924},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.32829999923706055},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3262999951839447},{"id":"https://openalex.org/C2988224531","wikidata":"https://www.wikidata.org/wiki/Q20830730","display_name":"Network structure","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C204562854","wikidata":"https://www.wikidata.org/wiki/Q1397646","display_name":"Edge contraction","level":5,"score":0.3095000088214874},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C28225019","wikidata":"https://www.wikidata.org/wiki/Q4915005","display_name":"Biological network","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1186/s13015-025-00283-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-025-00283-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-025-00283-9","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:41035063","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/41035063","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:doaj.org/article:555367d0a6c5435e82206352958b5d6b","is_oa":true,"landing_page_url":"https://doaj.org/article/555367d0a6c5435e82206352958b5d6b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms for Molecular Biology, Vol 20, Iss 1, Pp 1-30 (2025)","raw_type":"article"},{"id":"pmh:oai:europepmc.org:11300670","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/12490124","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"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":null,"raw_type":"Text"},{"id":"pmh:oai:mspace.lib.umanitoba.ca:1993/39457","is_oa":false,"landing_page_url":"http://hdl.handle.net/1993/39457","pdf_url":null,"source":{"id":"https://openalex.org/S4306400554","display_name":"Mspace (University of Manitoba)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I46247651","host_organization_name":"University of Manitoba","host_organization_lineage":["https://openalex.org/I46247651"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"},{"id":"pmh:oai:pubmedcentral.nih.gov:12490124","is_oa":true,"landing_page_url":"https://pmc.ncbi.nlm.nih.gov/articles/PMC12490124/","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","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-025-00283-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-025-00283-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/s13015-025-00283-9","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","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/W4414725606.pdf","grobid_xml":"https://content.openalex.org/works/W4414725606.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1528911722","https://openalex.org/W1584371244","https://openalex.org/W1974672137","https://openalex.org/W1977358834","https://openalex.org/W1982901388","https://openalex.org/W1986316739","https://openalex.org/W2003852880","https://openalex.org/W2014072463","https://openalex.org/W2029133099","https://openalex.org/W2060425093","https://openalex.org/W2076043677","https://openalex.org/W2096420865","https://openalex.org/W2105722028","https://openalex.org/W2110570734","https://openalex.org/W2121166240","https://openalex.org/W2131783665","https://openalex.org/W2143424400","https://openalex.org/W2159476620","https://openalex.org/W2605394804","https://openalex.org/W2739187695","https://openalex.org/W2741899203","https://openalex.org/W2962725223","https://openalex.org/W2963026941","https://openalex.org/W2963589575","https://openalex.org/W2964340057","https://openalex.org/W2999580712","https://openalex.org/W3005839441","https://openalex.org/W3011668974","https://openalex.org/W3015444032","https://openalex.org/W3021396888","https://openalex.org/W3021922824","https://openalex.org/W3027147731","https://openalex.org/W3120743784","https://openalex.org/W3126040650","https://openalex.org/W4220772397","https://openalex.org/W4226045769","https://openalex.org/W4254268221","https://openalex.org/W4384080303","https://openalex.org/W4385779844","https://openalex.org/W4391454556","https://openalex.org/W4401058734"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,66,88],"paper,":[2],"we":[3,52,117,171],"lay":[4],"the":[5,8,38,45,69,85,91,94,119,123,141,144,147,151,163,167],"groundwork":[6],"on":[7,14,44,65,166],"comparison":[9],"of":[10,40,48,72,93,122,146,153,183],"phylogenetic":[11,42],"networks":[12,43,136],"based":[13,165],"edge":[15],"contractions":[16,54,73],"and":[17,27,74,90],"expansions":[18,75],"as":[19,22,68],"edit":[20],"operations,":[21],"originally":[23],"proposed":[24],"by":[25],"Robinson":[26],"Foulds":[28],"to":[29,60,77,104,162],"compare":[30],"trees.":[31,185],"We":[32,83,125,157],"prove":[33,127],"that":[34,55,128],"these":[35],"operations":[36],"connect":[37],"space":[39],"all":[41],"same":[46],"set":[47],"leaves,":[49],"even":[50,139],"if":[51],"forbid":[53],"create":[56],"cycles.":[57],"This":[58],"allows":[59],"define":[61],"an":[62],"operational":[63],"distance":[64,89],"space,":[67],"minimum":[70],"number":[71,152],"required":[76],"transform":[78],"one":[79],"network":[80],"into":[81],"another.":[82],"highlight":[84],"difference":[86],"between":[87,98,109,134],"computation":[92],"maximum":[95,131,142],"common":[96,107,132,148],"contraction":[97,133],"two":[99,135],"networks.":[100],"Given":[101],"its":[102],"ability":[103],"outline":[105],"a":[106,130,174,181],"structure":[108],"them,":[110],"which":[111],"can":[112],"provide":[113,159,173],"valuable":[114],"biological":[115],"insights,":[116],"study":[118],"algorithmic":[120],"aspects":[121],"latter.":[124],"first":[126],"computing":[129],"is":[137,155],"NP-hard,":[138],"when":[140],"degree,":[143],"size":[145],"contraction,":[149],"or":[150],"leaves":[154],"bounded.":[156],"also":[158],"lower":[160],"bounds":[161],"problem":[164],"Exponential-Time":[168],"Hypothesis.":[169],"Nonetheless,":[170],"do":[172],"polynomial-time":[175],"algorithm":[176],"for":[177],"weakly":[178],"galled":[179,184],"trees,":[180],"generalization":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}