{"id":"https://openalex.org/W2595167122","doi":"https://doi.org/10.1186/s13015-017-0098-8","title":"On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model","display_name":"On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model","publication_year":2017,"publication_date":"2017-03-14","ids":{"openalex":"https://openalex.org/W2595167122","doi":"https://doi.org/10.1186/s13015-017-0098-8","mag":"2595167122","pmid":"https://pubmed.ncbi.nlm.nih.gov/28316640"},"language":"en","primary_location":{"id":"doi:10.1186/s13015-017-0098-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-017-0098-8","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0098-8","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-0098-8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030956337","display_name":"Daniel Bork","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]},{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Bork","raw_affiliation_strings":["Department of Computer Science, Harvey Mudd College, Claremont, USA","School of Medicine, University of Pittsburgh, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Harvey Mudd College, Claremont, USA","institution_ids":["https://openalex.org/I133543626"]},{"raw_affiliation_string":"School of Medicine, University of Pittsburgh, Pittsburgh, USA","institution_ids":["https://openalex.org/I170201317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063439109","display_name":"Ricson Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ricson Cheng","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, Pittsburgh, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100769830","display_name":"Jincheng Wang","orcid":"https://orcid.org/0000-0001-9345-2388"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jincheng Wang","raw_affiliation_strings":["Department of Computer Science, Harvey Mudd College, Claremont, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Harvey Mudd College, Claremont, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059437163","display_name":"Jean C. Sung","orcid":null},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean Sung","raw_affiliation_strings":["Department of Computer Science, Harvey Mudd College, Claremont, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Harvey Mudd College, Claremont, USA","institution_ids":["https://openalex.org/I133543626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081839833","display_name":"Ran Libeskind-Hadas","orcid":"https://orcid.org/0000-0001-9120-1948"},"institutions":[{"id":"https://openalex.org/I133543626","display_name":"Harvey Mudd College","ror":"https://ror.org/025ecfn45","country_code":"US","type":"education","lineage":["https://openalex.org/I133543626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Libeskind-Hadas","raw_affiliation_strings":["Department of Computer Science, Harvey Mudd College, Claremont, USA"],"raw_orcid":"https://orcid.org/0000-0001-9120-1948","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Harvey Mudd College, Claremont, USA","institution_ids":["https://openalex.org/I133543626"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":0.673,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.68261885,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"6","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.49410000443458557,"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.49410000443458557,"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.4869999885559082,"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/T11287","display_name":"Cancer Genomics and Diagnostics","score":0.0032999999821186066,"subfield":{"id":"https://openalex.org/subfields/1306","display_name":"Cancer Research"},"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.7270680069923401},{"id":"https://openalex.org/keywords/gene-duplication","display_name":"Gene duplication","score":0.7193666696548462},{"id":"https://openalex.org/keywords/coalescence","display_name":"Coalescence (physics)","score":0.6575562357902527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5900485515594482},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5685084462165833},{"id":"https://openalex.org/keywords/maximum-parsimony","display_name":"Maximum parsimony","score":0.5267181992530823},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4781428575515747},{"id":"https://openalex.org/keywords/gene","display_name":"Gene","score":0.37683629989624023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36799705028533936},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.3620021641254425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3451061248779297},{"id":"https://openalex.org/keywords/computational-biology","display_name":"Computational biology","score":0.32795602083206177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31428417563438416},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3082849979400635},{"id":"https://openalex.org/keywords/genetics","display_name":"Genetics","score":0.14292964339256287}],"concepts":[{"id":"https://openalex.org/C193252679","wikidata":"https://www.wikidata.org/wiki/Q242125","display_name":"Phylogenetic tree","level":3,"score":0.7270680069923401},{"id":"https://openalex.org/C7602840","wikidata":"https://www.wikidata.org/wiki/Q746284","display_name":"Gene duplication","level":3,"score":0.7193666696548462},{"id":"https://openalex.org/C149792144","wikidata":"https://www.wikidata.org/wiki/Q2071902","display_name":"Coalescence (physics)","level":2,"score":0.6575562357902527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5900485515594482},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5685084462165833},{"id":"https://openalex.org/C22799545","wikidata":"https://www.wikidata.org/wiki/Q1805805","display_name":"Maximum parsimony","level":5,"score":0.5267181992530823},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4781428575515747},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.37683629989624023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36799705028533936},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.3620021641254425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3451061248779297},{"id":"https://openalex.org/C70721500","wikidata":"https://www.wikidata.org/wiki/Q177005","display_name":"Computational biology","level":1,"score":0.32795602083206177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31428417563438416},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3082849979400635},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.14292964339256287},{"id":"https://openalex.org/C44465124","wikidata":"https://www.wikidata.org/wiki/Q713623","display_name":"Clade","level":4,"score":0.0},{"id":"https://openalex.org/C87355193","wikidata":"https://www.wikidata.org/wiki/Q411","display_name":"Astrobiology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1186/s13015-017-0098-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-017-0098-8","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0098-8","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:28316640","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/28316640","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:europepmc.org:4205900","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/5349084","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1186/s13015-017-0098-8","is_oa":true,"landing_page_url":"https://doi.org/10.1186/s13015-017-0098-8","pdf_url":"https://almob.biomedcentral.com/track/pdf/10.1186/s13015-017-0098-8","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":[{"display_name":"Reduced inequalities","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10"}],"awards":[{"id":"https://openalex.org/G3462673547","display_name":"III: Small: RUI: Algorithms and Tools for Phylogenetic Tree Reconciliation","funder_award_id":"1419739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6418997412","display_name":null,"funder_award_id":"IIS-1419739","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2595167122.pdf","grobid_xml":"https://content.openalex.org/works/W2595167122.grobid-xml"},"referenced_works_count":9,"referenced_works":["https://openalex.org/W1595252626","https://openalex.org/W2011039300","https://openalex.org/W2039375254","https://openalex.org/W2117000771","https://openalex.org/W2120836981","https://openalex.org/W2132318428","https://openalex.org/W2132553324","https://openalex.org/W2170753094","https://openalex.org/W4210633230"],"related_works":["https://openalex.org/W2963820820","https://openalex.org/W2520823390","https://openalex.org/W4300265711","https://openalex.org/W2963207658","https://openalex.org/W2375151634","https://openalex.org/W2090308851","https://openalex.org/W3146310663","https://openalex.org/W171301151","https://openalex.org/W3215180053","https://openalex.org/W3144097773"],"abstract_inverted_index":{"BACKGROUND:":[0],"Phylogenetic":[1],"tree":[2,35,74],"reconciliation":[3,25,58],"is":[4,59,85,104],"a":[5,24,31,57],"widely-used":[6],"method":[7],"for":[8,88,121],"inferring":[9],"the":[10,18,28,45,63,67,72,76,89,94,102,122,142],"evolutionary":[11],"histories":[12],"of":[13,66,92,96,141],"genes":[14],"and":[15,33,40,56,109],"species.":[16],"In":[17,44],"duplication-loss-coalescence":[19],"(DLC)":[20],"model,":[21],"we":[22],"seek":[23],"that":[26,61,82,101,114],"explains":[27],"incongruence":[29],"between":[30],"gene":[32,37,73],"species":[34,77],"using":[36],"duplication,":[38],"loss,":[39],"deep":[41],"coalescence":[42],"events.":[43],"maximum":[46],"parsimony":[47],"framework,":[48],"costs":[49],"are":[50,111,132],"associated":[51],"with":[52],"these":[53],"event":[54],"types":[55],"sought":[60],"minimizes":[62],"total":[64],"cost":[65],"events":[68],"required":[69],"to":[70,134],"map":[71],"onto":[75],"tree.":[78],"RESULTS:":[79],"We":[80,98],"show":[81,100],"this":[83],"problem":[84,103,123],"NP-hard":[86],"even":[87],"special":[90],"case":[91],"minimizing":[93],"number":[95],"duplications.":[97],"then":[99],"APX-hard":[105],"when":[106],"both":[107],"duplications":[108],"losses":[110],"considered,":[112],"implying":[113],"no":[115],"polynomial-time":[116],"approximation":[117],"scheme":[118],"can":[119],"exist":[120],"unless":[124],"P":[125],"=":[126],"NP.":[127],"CONCLUSIONS:":[128],"These":[129],"intractability":[130],"results":[131],"likely":[133],"guide":[135],"future":[136],"research":[137],"on":[138],"algorithmic":[139],"aspects":[140],"DLC-reconciliation":[143],"problem.":[144]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}