Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem
The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree sp...
Uložené v:
| Vydané v: | Algorithms for molecular biology Ročník 19; číslo 1; s. 2 - 17 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
London
BioMed Central
08.01.2024
Springer Nature B.V BMC |
| Predmet: | |
| ISSN: | 1748-7188, 1748-7188 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in
O
(
|
Σ
|
3.726
(
n
+
k
)
+
|
Σ
|
1.726
n
k
)
time, where
n
is the number of leaves,
k
is the number of characters, and
Σ
is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. |
|---|---|
| AbstractList | The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in \(O(|\Sigma |^{3.726}(n+k) + |\Sigma |^{1.726}nk)\) time, where n is the number of leaves, k is the number of characters, and \(\Sigma\) is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in [Formula: see text] time, where n is the number of leaves, k is the number of characters, and [Formula: see text] is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in [Formula: see text] time, where n is the number of leaves, k is the number of characters, and [Formula: see text] is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony.The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in [Formula: see text] time, where n is the number of leaves, k is the number of characters, and [Formula: see text] is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. Abstract The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in $$O(|\Sigma |^{3.726}(n+k) + |\Sigma |^{1.726}nk)$$ O ( | Σ | 3.726 ( n + k ) + | Σ | 1.726 n k ) time, where n is the number of leaves, k is the number of characters, and $$\Sigma$$ Σ is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in O ( | Σ | 3.726 ( n + k ) + | Σ | 1.726 n k ) time, where n is the number of leaves, k is the number of characters, and Σ is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in $$O(|\Sigma |^{3.726}(n+k) + |\Sigma |^{1.726}nk)$$ O ( | Σ | 3.726 ( n + k ) + | Σ | 1.726 n k ) time, where n is the number of leaves, k is the number of characters, and $$\Sigma$$ Σ is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic technique is to produce a phylogeny that is optimal with respect to some objective function and that lies within a constrained version of tree space. The popular species tree estimation method ASTRAL, for example, returns a tree that (1) maximizes the quartet score computed with respect to the input gene trees and that (2) draws its branches (bipartitions) from the input constraint set. This technique has yet to be used for parsimony problems where the input are binary characters, sometimes with missing values. Here, we introduce the clade-constrained character parsimony problem and present an algorithm that solves this problem for the Dollo criterion score in $$O(|\Sigma |^{3.726}(n+k) + |\Sigma |^{1.726}nk)$$ O(|Σ|3.726(n+k)+|Σ|1.726nk) time, where n is the number of leaves, k is the number of characters, and $$\Sigma$$ Σ is the set of clades used as constraints. Dollo parsimony, which requires traits/mutations to be gained at most once but allows them to be lost any number of times, is widely used for tumor phylogenetics as well as species phylogenetics, for example analyses of low-homoplasy retroelement insertions across the vertebrate tree of life. This motivated us to implement our algorithm in a software package, called Dollo-CDP, and evaluate its utility for analyzing retroelement insertion presence / absence patterns for bats, birds, toothed whales as well as simulated data. Our results show that Dollo-CDP can improve upon heuristic search from a single starting tree, often recovering a better scoring tree. Moreover, Dollo-CDP scales to data sets with much larger numbers of taxa than branch-and-bound while still having an optimality guarantee, albeit a more restricted one. Lastly, we show that our algorithm for Dollo parsimony can easily be adapted to Camin-Sokal parsimony but not Fitch parsimony. |
| ArticleNumber | 2 |
| Author | Dai, Junyan Han, Yunheng Molloy, Erin K. Rubel, Tobias |
| Author_xml | – sequence: 1 givenname: Junyan surname: Dai fullname: Dai, Junyan organization: Department of Computer Science, University of Maryland – sequence: 2 givenname: Tobias surname: Rubel fullname: Rubel, Tobias organization: Department of Computer Science, University of Maryland – sequence: 3 givenname: Yunheng surname: Han fullname: Han, Yunheng organization: Department of Computer Science, University of Maryland – sequence: 4 givenname: Erin K. surname: Molloy fullname: Molloy, Erin K. email: ekmolloy@umd.edu organization: Department of Computer Science, University of Maryland, University of Maryland Institute for Advanced Computer Studies |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/38191515$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9kktv1DAURiNURB_wB1igSGzYpPj6EcdsEJpCqVQJFrDFcpzrTEaOPdgZpPn3ZCaltCxY2bLPPb62v_PiJMSARfESyCVAU7_NwAiIilBWEUK5qtST4gwkbyoJTXPyYH5anOe8IYQLRtiz4pQ1oECAOCt-XEXvY7W6-vquNOU2-n2I42B8NQ0jlsb3MQ3TeixdTOW0xtJ602FlY8hTMkPArvQm9VgeNeXWpDyMMezLbYqtx_F58dQZn_HF3XhRfP_08dvqc3X75fpm9eG2slzRqWISXNsyh04J3ilSU8FRoRUOJNSKtq520HSqFq1jxHIjuDWSC9UaQRRYdlHcLN4umo3epmE0aa-jGfRxIaZemzQN1qPmHGtsqHXYtBwZM1BzgdBRpqQxBmbX-8W13bUjdhbDfFX_SPp4Jwxr3cdfGoiUQtQHw5s7Q4o_d5gnPQ7ZovcmYNxlTRVQQUUtyIy-_gfdxF0K81sdKE6lrKWYqVcPW7rv5c8_zgBdAJtizgndPQJEH8Kil7DoOSz6GBat5iK2FOUZDj2mv2f_p-o3F_HBeA |
| Cites_doi | 10.1109/TCBB.2018.2865729 10.3390/genes13050766 10.1186/s12864-020-6519-y 10.1146/annurev.es.14.110183.001525 10.1101/gr.210948.116 10.1186/s12859-018-2129-y 10.1093/bioinformatics/btaa444 10.1093/sysbio/20.4.406 10.1093/sysbio/syab086 10.1017/9781316882313 10.1093/sysbio/syz019 10.1093/bioinformatics/btv234 10.1093/bioinformatics/bty589 10.1016/0025-5564(86)90161-6 10.1093/jhered/esz076 10.1080/106351500750049851 10.3390/genes14091830 10.1186/s13100-018-0143-2 10.1016/0025-5564(82)90125-0 10.1145/3107411.3107441 10.1186/s13015-017-0120-1 10.1017/S0370164600023993 10.37236/6797 10.1186/s12864-018-4621-1 10.1007/s10577-017-9570-z 10.1093/bioinformatics/btab093 10.1007/BF01681346 10.1093/bioinformatics/btw600 10.1093/molbev/msaa139 10.1007/BF01734359 10.1089/cmb.2011.0174 10.1186/1471-2148-10-302 10.1093/bioinformatics/btz211 10.1186/s12859-020-03736-7 10.1073/pnas.2133766100 10.1016/j.aam.2021.102252 10.1093/gbe/evv099 10.1093/genetics/16.2.97 10.1145/332306.332359 10.1093/bioinformatics/18.2.337 10.1093/sysbio/syv082 10.3390/genes13030399 10.1093/bioinformatics/btu462 10.1006/jagm.2000.1133 10.4230/LIPIcs.WABI.2017.2 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2023 2023. The Author(s). 2024. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2023 – notice: 2023. The Author(s). – notice: 2024. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION NPM 3V. 7QO 7QP 7QR 7TK 7X7 7XB 8FD 8FE 8FG 8FH 8FI 8FJ 8FK ABJCF ABUWG AEUYN AFKRA ARAPS AZQEC BBNVY BENPR BGLVJ BHPHI CCPQU DWQXO FR3 FYUFA GHDGH GNUQQ HCIFZ K9. L6V LK8 M0S M7P M7S P5Z P62 P64 PHGZM PHGZT PIMPY PJZUB PKEHL PPXIY PQEST PQGLB PQQKQ PQUKI PTHSS 7X8 5PM DOA |
| DOI | 10.1186/s13015-023-00249-9 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed ProQuest Central (Corporate) Biotechnology Research Abstracts Calcium & Calcified Tissue Abstracts Chemoreception Abstracts Neurosciences Abstracts Health & Medical Collection ProQuest Central (purchase pre-March 2016) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Natural Science Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) SciTech Premium Collection ProQuest Central (Alumni) One Sustainability ProQuest Central UK/Ireland Health Research Premium Collection ProQuest Central Essentials Biological Science Collection ProQuest Central Technology collection Natural Science Collection ProQuest One Community College ProQuest Central Engineering Research Database Health Research Premium Collection Health Research Premium Collection (Alumni) ProQuest Central Student SciTech Premium Collection ProQuest Health & Medical Complete (Alumni) ProQuest Engineering Collection ProQuest Biological Science Collection Health & Medical Collection (Alumni Edition) ProQuest Biological Science Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection Biotechnology and BioEngineering Abstracts ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) One Health & Nursing ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition Engineering collection MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database ProQuest Central Student Technology Collection Technology Research Database ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest One Health & Nursing ProQuest Natural Science Collection ProQuest Central ProQuest One Applied & Life Sciences ProQuest One Sustainability ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health Research Premium Collection Biotechnology Research Abstracts Health and Medicine Complete (Alumni Edition) Natural Science Collection ProQuest Central Korea Biological Science Collection Chemoreception Abstracts ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Engineering Database ProQuest Biological Science Collection ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) Biological Science Database ProQuest SciTech Collection Neurosciences Abstracts ProQuest Hospital Collection (Alumni) Biotechnology and BioEngineering Abstracts Advanced Technologies & Aerospace Database ProQuest Health & Medical Complete ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic Calcium & Calcified Tissue Abstracts ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database PubMed MEDLINE - Academic CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1748-7188 |
| EndPage | 17 |
| ExternalDocumentID | oai_doaj_org_article_44e6e82cfe8b4e33a1645e1d2397aaa1 PMC10775561 38191515 10_1186_s13015_023_00249_9 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: State of Maryland funderid: http://dx.doi.org/10.13039/100017027 |
| GroupedDBID | 0R~ 23M 2WC 53G 5GY 5VS 6J9 7X7 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AASML ABDBF ABJCF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK E3Z EBD EBLON EBS ESX F5P FYUFA GROUPED_DOAJ GX1 HCIFZ HMCUK HYE IAO IGS IHR ITC KQ8 L6V LK8 M48 M7P M7S M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PUEGO RBZ RNS ROL RPM RSV SBL SOJ TR2 TUS UKHRP WOQ WOW ~8M AAYXX AFFHD CITATION -A0 3V. ACRMQ ADINQ ALIPV C24 NPM 7QO 7QP 7QR 7TK 7XB 8FD 8FK AZQEC DWQXO FR3 GNUQQ K9. P64 PJZUB PKEHL PPXIY PQEST PQUKI 7X8 5PM |
| ID | FETCH-LOGICAL-c492t-371fbb3fef954d906254e9ec5f171692bf6f18d965bf30c4a54ca7459ba5091c3 |
| IEDL.DBID | BENPR |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001138235900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1748-7188 |
| IngestDate | Tue Oct 14 19:01:47 EDT 2025 Tue Nov 04 02:06:17 EST 2025 Sun Nov 09 12:14:42 EST 2025 Tue Oct 07 05:41:23 EDT 2025 Wed Feb 19 02:01:42 EST 2025 Sat Nov 29 05:10:44 EST 2025 Sat Sep 06 07:29:41 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Phylogenetics Retrotransposons Dollo Parsimony |
| Language | English |
| License | 2023. The Author(s). Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated in a credit line to the data. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c492t-371fbb3fef954d906254e9ec5f171692bf6f18d965bf30c4a54ca7459ba5091c3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| OpenAccessLink | https://www.proquest.com/docview/2914277675?pq-origsite=%requestingapplication% |
| PMID | 38191515 |
| PQID | 2914277675 |
| PQPubID | 55040 |
| PageCount | 17 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_44e6e82cfe8b4e33a1645e1d2397aaa1 pubmedcentral_primary_oai_pubmedcentral_nih_gov_10775561 proquest_miscellaneous_2912525650 proquest_journals_2914277675 pubmed_primary_38191515 crossref_primary_10_1186_s13015_023_00249_9 springer_journals_10_1186_s13015_023_00249_9 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-01-08 |
| PublicationDateYYYYMMDD | 2024-01-08 |
| PublicationDate_xml | – month: 01 year: 2024 text: 2024-01-08 day: 08 |
| PublicationDecade | 2020 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationTitle | Algorithms for molecular biology |
| PublicationTitleAbbrev | Algorithms Mol Biol |
| PublicationTitleAlternate | Algorithms Mol Biol |
| PublicationYear | 2024 |
| Publisher | BioMed Central Springer Nature B.V BMC |
| Publisher_xml | – name: BioMed Central – name: Springer Nature B.V – name: BMC |
| References | L Doronina (249_CR18) 2017; 27 L Doronina (249_CR41) 2023; 14 S Mirarab (249_CR10) 2015; 31 T Warnow (249_CR25) 2017 RR Hudson (249_CR42) 2002; 18 Y Yu (249_CR4) 2011; 18 EK Molloy (249_CR43) 2021; 71 S Mirarab (249_CR6) 2014; 30 249_CR13 249_CR35 S Ciccolella (249_CR15) 2020; 21 F Lammers (249_CR20) 2019; 10 RN Platt (249_CR21) 2015; 7 249_CR31 A Cloutier (249_CR17) 2019; 68 249_CR30 249_CR33 RA Fisher (249_CR36) 1923; 42 P Dibaeinia (249_CR12) 2021; 37 RL Graham (249_CR27) 1982; 60 WHE Day (249_CR29) 1986; 81 C Zhang (249_CR7) 2020; 37 P Vachaspati (249_CR47) 2018; 19 JM Korstian (249_CR22) 2022; 13 249_CR2 249_CR1 P Vachaspati (249_CR8) 2016; 33 M Islam (249_CR24) 2020; 21 L Liu (249_CR40) 2010; 10 L Doronina (249_CR19) 2022; 13 WM Fitch (249_CR26) 1971; 20 D Sankoff (249_CR34) 1975; 9 MS Springer (249_CR45) 2019; 111 A-H Salem (249_CR23) 2003; 100 M El-Kebir (249_CR16) 2018; 34 J Felsenstein (249_CR32) 1983; 14 C Zhang (249_CR11) 2018; 19 AM Shedlock (249_CR39) 2000; 49 J Yin (249_CR46) 2019; 35 P Bonizzoni (249_CR14) 2019; 16 S Wright (249_CR37) 1931; 16 RN Platt (249_CR38) 2018; 26 D Bryant (249_CR5) 2001; 38 R Bouckaert (249_CR28) 2021; 131 D Mallo (249_CR44) 2015; 65 MS Bayzid (249_CR3) 2018 EK Molloy (249_CR9) 2020; 36 |
| References_xml | – volume: 16 start-page: 1410 issue: 5 year: 2019 ident: 249_CR14 publication-title: IEEE/ACM Trans Comput Biol Bioinf doi: 10.1109/TCBB.2018.2865729 – volume: 13 start-page: 766 issue: 5 year: 2022 ident: 249_CR19 publication-title: Genes doi: 10.3390/genes13050766 – volume: 21 start-page: 136 issue: 1 year: 2020 ident: 249_CR24 publication-title: BMC Genomics doi: 10.1186/s12864-020-6519-y – volume: 14 start-page: 313 year: 1983 ident: 249_CR32 publication-title: Ann Rev Ecol Syst doi: 10.1146/annurev.es.14.110183.001525 – volume: 27 start-page: 997 year: 2017 ident: 249_CR18 publication-title: Genome Res doi: 10.1101/gr.210948.116 – volume: 19 start-page: 153 issue: 6 year: 2018 ident: 249_CR11 publication-title: BMC Bioinformatics doi: 10.1186/s12859-018-2129-y – volume: 36 start-page: 57 year: 2020 ident: 249_CR9 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btaa444 – volume: 20 start-page: 406 issue: 4 year: 1971 ident: 249_CR26 publication-title: Syst Biol doi: 10.1093/sysbio/20.4.406 – volume: 71 start-page: 721 issue: 3 year: 2021 ident: 249_CR43 publication-title: Syst Biol doi: 10.1093/sysbio/syab086 – volume-title: Computational Phylogenetics: an introduction to designing methods for phylogeny estimation year: 2017 ident: 249_CR25 doi: 10.1017/9781316882313 – volume: 68 start-page: 937 issue: 6 year: 2019 ident: 249_CR17 publication-title: Syst Biol doi: 10.1093/sysbio/syz019 – volume: 31 start-page: 44 issue: 12 year: 2015 ident: 249_CR10 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btv234 – volume: 34 start-page: 671 issue: 17 year: 2018 ident: 249_CR16 publication-title: Bioinformatics doi: 10.1093/bioinformatics/bty589 – volume: 81 start-page: 33 issue: 1 year: 1986 ident: 249_CR29 publication-title: Math Biosci doi: 10.1016/0025-5564(86)90161-6 – volume: 111 start-page: 147 issue: 2 year: 2019 ident: 249_CR45 publication-title: J Hered doi: 10.1093/jhered/esz076 – ident: 249_CR30 – volume: 49 start-page: 808 year: 2000 ident: 249_CR39 publication-title: Syst Biol doi: 10.1080/106351500750049851 – volume: 14 start-page: 1830 issue: 9 year: 2023 ident: 249_CR41 publication-title: Genes doi: 10.3390/genes14091830 – volume: 10 start-page: 5 year: 2019 ident: 249_CR20 publication-title: Mob DNA doi: 10.1186/s13100-018-0143-2 – volume: 60 start-page: 133 issue: 2 year: 1982 ident: 249_CR27 publication-title: Math Biosci doi: 10.1016/0025-5564(82)90125-0 – ident: 249_CR13 doi: 10.1145/3107411.3107441 – year: 2018 ident: 249_CR3 publication-title: Algorithms Mol Biol doi: 10.1186/s13015-017-0120-1 – volume: 42 start-page: 321 year: 1923 ident: 249_CR36 publication-title: Proc R Soc Edinb doi: 10.1017/S0370164600023993 – ident: 249_CR35 doi: 10.37236/6797 – volume: 19 start-page: 252 year: 2018 ident: 249_CR47 publication-title: BMC Genom doi: 10.1186/s12864-018-4621-1 – volume: 26 start-page: 25 year: 2018 ident: 249_CR38 publication-title: Chromosome Res doi: 10.1007/s10577-017-9570-z – volume: 37 start-page: 2317 issue: 16 year: 2021 ident: 249_CR12 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btab093 – volume: 9 start-page: 240 year: 1975 ident: 249_CR34 publication-title: Math Program doi: 10.1007/BF01681346 – volume: 33 start-page: 631 issue: 5 year: 2016 ident: 249_CR8 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btw600 – volume: 37 start-page: 3292 issue: 11 year: 2020 ident: 249_CR7 publication-title: Mol Biol Evol doi: 10.1093/molbev/msaa139 – ident: 249_CR33 doi: 10.1007/BF01734359 – volume: 18 start-page: 1543 issue: 11 year: 2011 ident: 249_CR4 publication-title: J Comput Biol doi: 10.1089/cmb.2011.0174 – volume: 10 start-page: 302 year: 2010 ident: 249_CR40 publication-title: BMC Evol Biol doi: 10.1186/1471-2148-10-302 – volume: 35 start-page: 3961 issue: 20 year: 2019 ident: 249_CR46 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btz211 – volume: 21 start-page: 313 issue: Suppl 1 year: 2020 ident: 249_CR15 publication-title: BMC Bioinformatics doi: 10.1186/s12859-020-03736-7 – volume: 100 start-page: 12787 issue: 22 year: 2003 ident: 249_CR23 publication-title: Proc Natl Acad Sci USA doi: 10.1073/pnas.2133766100 – volume: 131 year: 2021 ident: 249_CR28 publication-title: Adv Appl Math doi: 10.1016/j.aam.2021.102252 – volume: 7 start-page: 1664 issue: 6 year: 2015 ident: 249_CR21 publication-title: Genome Biol Evol doi: 10.1093/gbe/evv099 – ident: 249_CR31 – volume: 16 start-page: 97 issue: 2 year: 1931 ident: 249_CR37 publication-title: Genetics doi: 10.1093/genetics/16.2.97 – ident: 249_CR1 doi: 10.1145/332306.332359 – volume: 18 start-page: 337 issue: 2 year: 2002 ident: 249_CR42 publication-title: Bioinformatics doi: 10.1093/bioinformatics/18.2.337 – volume: 65 start-page: 334 issue: 2 year: 2015 ident: 249_CR44 publication-title: Syst Biol doi: 10.1093/sysbio/syv082 – volume: 13 start-page: 399 issue: 3 year: 2022 ident: 249_CR22 publication-title: Genes doi: 10.3390/genes13030399 – volume: 30 start-page: 541 issue: 17 year: 2014 ident: 249_CR6 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btu462 – volume: 38 start-page: 237 issue: 1 year: 2001 ident: 249_CR5 publication-title: J Algorithms doi: 10.1006/jagm.2000.1133 – ident: 249_CR2 doi: 10.4230/LIPIcs.WABI.2017.2 |
| SSID | ssj0045303 |
| Score | 2.31828 |
| Snippet | The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this algorithmic... Abstract The last decade of phylogenetics has seen the development of many methods that leverage constraints plus dynamic programming. The goal of this... |
| SourceID | doaj pubmedcentral proquest pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Publisher |
| StartPage | 2 |
| SubjectTerms | Algorithms Bioinformatics Biomedical and Life Sciences Cellular and Medical Topics Computational Biology/Bioinformatics Constraints Dollo Dynamic programming Genes Homoplasy Leaves Life Sciences Objective function Optimization Parsimony Phylogenetics Phylogeny Physiological Polynomials Retrotransposons Selected papers from WABI 2023 Vertebrates |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELZQBRIXxJtAQUbiBlY3sZ3Y3KAP9YCqHkDqCcuPMV0pJKvdLdL-e8ZOsrA81EuvsWWN5rPH38T2N4S8KZEy1E5zBrHBBKUCzazjklmBKVBoQM1sFnH91JydqYsLff5bqa90J2yQBx4cdyAE1KAqH0E5AZxb5PcSylDhRmqtzYnPrNFTMjXEYCExMk9PZFR9sMJIXaaXyJxljTymd7ahrNb_L4r5903JP45L8y50cp_cG-kj_TCY_YDcgu4huTMUlNw8Il-PENaeHR6dv6eWLvp2k14d25alEvLUtt_65Xx9-Z0iU6XI_KhvbQDmE0dMpSIg0DbdDKd5GLrApBeh7DZ0LDvzmHw5Of58eMrGCgrMC12tMXqU0TkeIWopQpIklgI0eBmzSk7lYh1LFXQtXeQzL6wU3jZCamcTkfD8Cdnr-g6eEaq5tKIEpULDBXdZCS-AhDr4gIPMCvJ2cqhZDEIZJicYqjaD-w2632T3G12Qj8nn255J5Dp_QOjNCL25DvqC7E-ImXHlrUylS5xmSaKmIK-3zbhm0kGI7aC_yn0qiVxPotVPB4C3luQMFkleQdQO9Dum7rZ088usy10mOUHkowV5N82SX3b93xfPb8IXL8jdCofLP4fUPtlbL6_gJbntf6znq-WrvDh-Aq76Ei8 priority: 102 providerName: Directory of Open Access Journals – databaseName: SpringerLink Core Collection dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB5BAakX3qWBgozEDSw2sZ3Y3KCl4oCqSjzUE5ZjT9qVQrLa3SLtv2fsTRYtlAPcotixRuOZ8Tex_Q3Ai5wgQ1kbwbGpKEEp0HBXC8WdpBQoVKgnLpG4fqxOTvTZmTkdLoUtxtPu45ZkitTJrXX5ekHRNo-3iQVPPHfcXIcbKrLNxBz909cx_kpFUXm8HnPld1tLUGLqvwpe_nlK8ret0rQCHd_5P9nvwu0BcbK3axO5B9ewuw-31jUoVw_g2xFZQs8Pj07fMMdmfbuKF5Vdy2PVeeba834-XV58ZwRuGYFF5lsXkPsIK2N1CQysjYfJWRqGzShPptnvVmyoVPMQvhy__3z4gQ9FF7iXplhSwMmbuhYNNkbJEFmMlUSDXjWJWKeom7LJdTClqhsx8dIp6V0llaldxB5e7MFO13e4D8wI5WSOWodKSFEn8ryACsvgAw0yyeDlOA92tubWsCkn0aVda8ySxmzSmDUZvItTtekZebHTi35-bgc3s1JiibrwDepaohCOskGFeSgIdjnn8gwOxom2g7MubGFysszIapPB800zuVncO3Ed9pepT6EIHiqS-tHaLjaSpKSXcGEGestitkTdbummF4nKO48MhARhM3g1Gs4vuf6ui8f_1v0J7Bb0lP4c6QPYWc4v8Snc9D-W08X8WfKenzWQFdc priority: 102 providerName: Springer Nature |
| Title | Dollo-CDP: a polynomial-time algorithm for the clade-constrained large Dollo parsimony problem |
| URI | https://link.springer.com/article/10.1186/s13015-023-00249-9 https://www.ncbi.nlm.nih.gov/pubmed/38191515 https://www.proquest.com/docview/2914277675 https://www.proquest.com/docview/2912525650 https://pubmed.ncbi.nlm.nih.gov/PMC10775561 https://doaj.org/article/44e6e82cfe8b4e33a1645e1d2397aaa1 |
| Volume | 19 |
| WOSCitedRecordID | wos001138235900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: BioMed Central customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: RBZ dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: DOA dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M~E dateStart: 20060101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: M7S dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection (ProQuest) customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLink customDbUrl: eissn: 1748-7188 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0045303 issn: 1748-7188 databaseCode: RSV dateStart: 20060101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELZoCxIX3tBAWRmJG1jdxHZic0H0JZBgFbWAFg5Ejj1pK6XJsrtF2n_P2JtstbwuXCwldiw7Mx5_48c3hDyPETKkpeYMqgwdlAQ0MyWXzAh0gVwGamgCiev7bDRS47HOuwW3WXessreJwVC71vo18t1Ex_i5px55PfnOfNQov7vahdDYIFueqQz1fGvvcJQf97ZYSLTQ_VUZle7O0GLH_kYyZ4Erj-m16Siw9v8Jav5-YvKXbdMwGx3d_t9-3CG3OhxK3ywV5y65Bs09cmMZmXJxn3w7QP1o2f5B_ooaOmnrhb--bGrmY9FTU59ilfOzC4qQlyKEpLY2Dpj1YNPHnABHa3_EnIZq6AS9Z9SJZkG7-DUPyKejw4_7b1kXioFZoZM5mqG4KkteQaWlcJ7bWArQYGUV6HaSskqrWDmdyrLiQyuMFNZkQurSeERi-UOy2bQNbBOquTQiBqVcxgUvA6WeAwmpsw4rGUbkRS-RYrJk3CiCp6LSYim_AuVXBPkVOiJ7Xmirkp4tO7xop6dFN_gKISAFldgKVCmAc4M-ooTYJQjGjDFxRHZ6WRXdEJ4VV4KKyLNVNg4-v6NiGmgvQ5lEImiU2OpHSw1ZtSS4wogWI6LWdGetqes5zflZIPiOPS8hAtuIvOzV7Kpdf_8Xj__djSfkZoIFw_qR2iGb8-klPCXX7Y_5-Ww6IBvZOAupGnSjaBAWKAb-OGwe0hNMc_kV8_N3H_Iv-HR88vknBBAptw |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bb9MwFLbGAMEL90tggJHgCaw1jp3aSAjByrRppdrDkPY049gnW6UuKW0H6p_iN3LsNJ3K7W0PvMaOZSefz_mOL98h5EWKlCEvdMag7GKAwkEzW2SSWYEhkO-C6tgo4trvDgbq8FDvr5Ef7V2YcKyytYnRUPvahTXyTa5TfD1Ij7wbf2Uha1TYXW1TaDSw2IP5dwzZpm93e_h_X3K-_fFga4ctsgowJzSf4YxKy6LISii1FD7I9EoBGpwso3IML8q8TJXXuSzKrOOElcLZrpC6sMG5ugzbvUQuI43gnXhUcL-1_EKiP2gv5qh8c4r-IQ33nzMWlfmYXnF-MUfAn4jt7-czf9mkjb5v--b_9tVukRsLlk3fN9PiNlmD6g652uTdnN8lRz1Ef822evtvqKXjejQPl7PtiM2Gp0Dt6BiHMDs5pUjoKRJk6kbWA3OBSoeMGuDpKBygp7EZOraTKSK-mtNFdp575POFDO4-Wa_qCh4SqjNpRQpK-W4msiIKBnqQkHvnsZFOQl61CDDjRk_ExDhM5abBi0G8mIgXoxPyIYBkWTNogccH9eTYLEyLEQJyUNyVoAoBWWYxApaQeo5U01qbJmSjxYZZGKipOQdGQp4vi9G0hP0iW0F9FutwiZRYYq8fNIhc9iQG-siFE6JWsLrS1dWSangS5cvToLqItD0hr1tYn_fr79_i0b-H8Yxc2zn41Df93cHeY3Kd40txpUxtkPXZ5AyekCvu22w4nTyNc5aSLxcN95_iC3zB |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwELagPNQLz0IDBYzEDaxuYjuxuUGXFYhqteKlnrAcP9qVQrLaTZH23zN2koWFckBcY8ea2DPjb2LPNwg9SwEy5KWkxPkCApTMSaJLyolmEALZwomRjiSux8V0Kk5O5OyXLP542304kuxyGgJLU90eLqzvTFzkhyvwvGnILKYkct4ReRldYRDJhEtdHz5-GXwx4-Chh1SZC9_b2o4ia_9FUPPPG5O_HZvG3Why8_-_4xa60SNR_KpTndvokqvvoGtdbcr1XfR1DBrSkKPx7CXWeNFU65DArCsSqtFjXZ02y3l79g0D6MUAIrGptHXEBLgZqk44i6twyRzHYfAC4mfQinqN-wo2e-jz5M2no7ekL8ZADJNZC44o9WVJvfOSMxvYjTlz0hnuI-FOVvrcp8LKnJeejgzTnBldMC5LHTCJoffQTt3Ubh9hSblmqRPCFpTRMpLqWcddbo2FQUYJej6siVp0nBsqxioiV92MKZgxFWdMyQS9Dsu26Rn4suODZnmqevNTjLncicx4J0rmKNUQJXKX2gzgmNY6TdDBsOiqN-KVymQKGhvYbhL0dNMM5hfOVHTtmvPYJ-MAGzlIfb_TkY0kMRgGvJggsaU9W6Jut9Tzs0jxnQZmQoC2CXoxKNFPuf4-Fw_-rfsTdH02nqjjd9P3D9FuBg_jzyVxgHba5bl7hK6a7-18tXwcjeoHTc4hnw |
| 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=Dollo-CDP%3A+a+polynomial-time+algorithm+for+the+clade-constrained+large+Dollo+parsimony+problem&rft.jtitle=Algorithms+for+molecular+biology&rft.au=Dai%2C+Junyan&rft.au=Rubel%2C+Tobias&rft.au=Han%2C+Yunheng&rft.au=Molloy%2C+Erin+K&rft.date=2024-01-08&rft.issn=1748-7188&rft.eissn=1748-7188&rft.volume=19&rft.issue=1&rft.spage=2&rft_id=info:doi/10.1186%2Fs13015-023-00249-9&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1748-7188&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1748-7188&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1748-7188&client=summon |