A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks
Phylogenetic networks are increasingly being considered better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic networks that have received a lot of attention recently is the class of orchard networks, which is composed of networks that...
Uloženo v:
| Vydáno v: | Journal of computational biology Ročník 31; číslo 4; s. 360 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
United States
01.04.2024
|
| Témata: | |
| ISSN: | 1557-8666, 1557-8666 |
| On-line přístup: | Zjistit podrobnosti o přístupu |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Phylogenetic networks are increasingly being considered better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic networks that have received a lot of attention recently is the class of orchard networks, which is composed of networks that can be reduced to a single leaf using cherry reductions. Cherry reductions, also called cherry-picking operations, remove either a leaf of a simple cherry (sibling leaves sharing a parent) or a reticulate edge of a reticulate cherry (two leaves whose parents are connected by a reticulate edge). In this article, we present a fixed-parameter tractable algorithm to solve the problem of finding a maximum agreement cherry-reduced subnetwork (MACRS) between two rooted binary level-1 networks. This is the first exact algorithm proposed to solve the MACRS problem. As proven in an earlier work, there is a direct relationship between finding an MACRS and calculating a distance based on cherry operations. As a result, the proposed algorithm also provides a distance that can be used for the comparison of level-1 networks.Phylogenetic networks are increasingly being considered better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic networks that have received a lot of attention recently is the class of orchard networks, which is composed of networks that can be reduced to a single leaf using cherry reductions. Cherry reductions, also called cherry-picking operations, remove either a leaf of a simple cherry (sibling leaves sharing a parent) or a reticulate edge of a reticulate cherry (two leaves whose parents are connected by a reticulate edge). In this article, we present a fixed-parameter tractable algorithm to solve the problem of finding a maximum agreement cherry-reduced subnetwork (MACRS) between two rooted binary level-1 networks. This is the first exact algorithm proposed to solve the MACRS problem. As proven in an earlier work, there is a direct relationship between finding an MACRS and calculating a distance based on cherry operations. As a result, the proposed algorithm also provides a distance that can be used for the comparison of level-1 networks. |
|---|---|
| AbstractList | Phylogenetic networks are increasingly being considered better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic networks that have received a lot of attention recently is the class of orchard networks, which is composed of networks that can be reduced to a single leaf using cherry reductions. Cherry reductions, also called cherry-picking operations, remove either a leaf of a simple cherry (sibling leaves sharing a parent) or a reticulate edge of a reticulate cherry (two leaves whose parents are connected by a reticulate edge). In this article, we present a fixed-parameter tractable algorithm to solve the problem of finding a maximum agreement cherry-reduced subnetwork (MACRS) between two rooted binary level-1 networks. This is the first exact algorithm proposed to solve the MACRS problem. As proven in an earlier work, there is a direct relationship between finding an MACRS and calculating a distance based on cherry operations. As a result, the proposed algorithm also provides a distance that can be used for the comparison of level-1 networks.Phylogenetic networks are increasingly being considered better suited to represent the complexity of the evolutionary relationships between species. One class of phylogenetic networks that have received a lot of attention recently is the class of orchard networks, which is composed of networks that can be reduced to a single leaf using cherry reductions. Cherry reductions, also called cherry-picking operations, remove either a leaf of a simple cherry (sibling leaves sharing a parent) or a reticulate edge of a reticulate cherry (two leaves whose parents are connected by a reticulate edge). In this article, we present a fixed-parameter tractable algorithm to solve the problem of finding a maximum agreement cherry-reduced subnetwork (MACRS) between two rooted binary level-1 networks. This is the first exact algorithm proposed to solve the MACRS problem. As proven in an earlier work, there is a direct relationship between finding an MACRS and calculating a distance based on cherry operations. As a result, the proposed algorithm also provides a distance that can be used for the comparison of level-1 networks. |
| Author | Landry, Kaari Lafond, Manuel Tremblay-Savard, Olivier |
| Author_xml | – sequence: 1 givenname: Kaari orcidid: 0000-0003-3292-5633 surname: Landry fullname: Landry, Kaari organization: Department of Computer Science, University of Manitoba, Winnipeg, Canada – sequence: 2 givenname: Olivier surname: Tremblay-Savard fullname: Tremblay-Savard, Olivier organization: Department of Computer Science, University of Manitoba, Winnipeg, Canada – sequence: 3 givenname: Manuel orcidid: 0000-0002-5305-7372 surname: Lafond fullname: Lafond, Manuel organization: Département d'informatique, Université de Sherbrooke, Sherbrooke, Canada |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/38117611$$D View this record in MEDLINE/PubMed |
| BookMark | eNpN0DtPwzAUBWALFdEHjKzII0uCH3HsjFFFAamiCMocOfZ1G0ic4iRA_z2VKBLTPdL5dIY7RSPfekDokpKYEpXdmKaMGWE8JpzKEzShQshIpWk6-pfHaNp1b4RQnhJ5hsZcUSpTSico5HhRfYONnnTQDfQQ8Dpo0-uyBpzXmzZU_bbBrg0H523lNzjfBIAGfI_nWwhhHz2DHQxY_DKUHvqvNrx3uPJ4CZ9QRxSvgtnqYPHjsTtHp07XHVwc7wy9Lm7X8_toubp7mOfLyHCm-kin3DottaY2yVzmnKHMJUTyUnCWSSEzrlImmeNCKEOINKC1IkJyzVQiCZuh69_dXWg_Buj6oqk6A3WtPbRDV7CMJAedJOJAr450KBuwxS5UjQ774u9P7AfEfWtZ |
| ContentType | Journal Article |
| DBID | CGR CUY CVF ECM EIF NPM 7X8 |
| DOI | 10.1089/cmb.2023.0317 |
| DatabaseName | Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed MEDLINE - Academic |
| DatabaseTitle | MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Biology Mathematics |
| EISSN | 1557-8666 |
| ExternalDocumentID | 38117611 |
| Genre | Journal Article |
| GroupedDBID | --- 0R~ 29K 34G 39C 4.4 53G 5GY ABBKN ABEFU ACGFO ADBBV AENEX AFOSN AI. ALMA_UNASSIGNED_HOLDINGS BAWUL BNQNF CAG CGR COF CS3 CUY CVF D-I DIK DU5 EBS ECM EIF EJD F5P IAO IER IGS IHR IM4 ITC MV1 NPM NQHIM O9- P2P R.V RIG RML RMSOB RNS TN5 TR2 UE5 VH1 7X8 SCNPE |
| ID | FETCH-LOGICAL-c328t-a63dfa7aa1d49f9ffc12f4073b53297579386272f3558c007ceaa80573a284702 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001150689900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1557-8666 |
| IngestDate | Thu Oct 02 09:54:28 EDT 2025 Mon Jul 21 06:02:53 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | orchard networks network distance MACRS cherry picking cherry operations phylogenetic networks |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c328t-a63dfa7aa1d49f9ffc12f4073b53297579386272f3558c007ceaa80573a284702 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-5305-7372 0000-0003-3292-5633 |
| PMID | 38117611 |
| PQID | 2904573445 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_2904573445 pubmed_primary_38117611 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Apr 20240401 |
| PublicationDateYYYYMMDD | 2024-04-01 |
| PublicationDate_xml | – month: 04 year: 2024 text: 2024-Apr |
| PublicationDecade | 2020 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States |
| PublicationTitle | Journal of computational biology |
| PublicationTitleAlternate | J Comput Biol |
| PublicationYear | 2024 |
| SSID | ssj0013607 |
| Score | 2.4243414 |
| Snippet | Phylogenetic networks are increasingly being considered better suited to represent the complexity of the evolutionary relationships between species. One class... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | 360 |
| SubjectTerms | Algorithms Biological Evolution Models, Genetic Phylogeny |
| Title | A Fixed-Parameter Tractable Algorithm for Finding Agreement Cherry-Reduced Subnetworks in Level-1 Orchard Networks |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/38117611 https://www.proquest.com/docview/2904573445 |
| Volume | 31 |
| WOSCitedRecordID | wos001150689900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS8NAEF7UKuiDR73qxQq-bpv7eJJQLD7YWKRC38pmDy3YtDZV7L93JtmqL4LgSwjkIOxOZr7Zne8bQq4Cbfk-jx0mIRgxT3ghy5SEs4z7ltBaK6nLZhNhmkaDQdwzC26FKatc-sTSUcuJwDXylhMD-Ahdz_Ovp68Mu0bh7qppobFKai5AGSzpCgc_dhGCki4NIRM8MeB0o7FpRXFLjLMmdg5vglGHv6PLMsp0dv77fbtk2-BLmlQGsUdWVF4nG1XHyUWdbHW_ZFqLfTJLaGf0oSTrcazRgiGmfWRNIZ2KJi9P8P7585gCroX7SvoLTSA_L1cUaRtFHRfsAbVflaTggfKqpLygo5zeYTESs-l9qcUkaWquHZDHzk2_fctMEwYmXCeaMx64UvOQc1t6sY61FrajIQt0M99FVi7835AUhY5GnXYBiEMoziOUWeQY-SznkKzlk1wdE5pxzwkDS9raziCtk5nUAXK-FKQ4ses5DXK5HNohGDnuXPBcTd6K4ffgNshRNT_DaaXGMXSRKhvY9skfnj4lmzDppvLmjNQ0_OLqnKyL9_momF2U1gPHtNf9BCQszwY |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Fixed-Parameter+Tractable+Algorithm+for+Finding+Agreement+Cherry-Reduced+Subnetworks+in+Level-1+Orchard+Networks&rft.jtitle=Journal+of+computational+biology&rft.au=Landry%2C+Kaari&rft.au=Tremblay-Savard%2C+Olivier&rft.au=Lafond%2C+Manuel&rft.date=2024-04-01&rft.eissn=1557-8666&rft.volume=31&rft.issue=4&rft.spage=360&rft_id=info:doi/10.1089%2Fcmb.2023.0317&rft_id=info%3Apmid%2F38117611&rft_id=info%3Apmid%2F38117611&rft.externalDocID=38117611 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1557-8666&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1557-8666&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1557-8666&client=summon |