Literature DB >> 29994484

Computing the Diameter of the Space of Maximum Parsimony Reconciliations in the Duplication-Transfer-Loss Model.

Jordan Haack, Eli Zupke, Andrew Ramirez, Yi-Chieh Wu, Ran Libeskind-Hadas.   

Abstract

Phylogenetic tree reconciliation is widely used in the fields of molecular evolution, cophylogenetics, parasitology, and biogeography to study the evolutionary histories of pairs of entities. In these contexts, reconciliation is often performed using maximum parsimony under the Duplication-Transfer-Loss (DTL) event model. In general, the number of maximum parsimony reconciliations (MPRs) can grow exponentially with the size of the trees. While a number of previous efforts have been made to count the number of MPRs, find representative MPRs, and compute the frequencies of events across the space of MPRs, little is known about the structure of MPR space. In particular, how different are MPRs in terms of the events that they comprise? One way to address this question is to compute the diameter of MPR space, defined to be the maximum number of DTL events that distinguish any two MPRs in the solution space. We show how to compute the diameter of MPR space in polynomial time and then apply this algorithm to a large biological dataset to study the variability of events.

Mesh:

Year:  2018        PMID: 29994484     DOI: 10.1109/TCBB.2018.2849732

Source DB:  PubMed          Journal:  IEEE/ACM Trans Comput Biol Bioinform        ISSN: 1545-5963            Impact factor:   3.710


  4 in total

1.  Efficiently sparse listing of classes of optimal cophylogeny reconciliations.

Authors:  Yishu Wang; Arnaud Mary; Marie-France Sagot; Blerina Sinaimeri
Journal:  Algorithms Mol Biol       Date:  2022-02-15       Impact factor: 1.405

2.  Deciphering Microbial Gene Family Evolution Using Duplication-Transfer-Loss Reconciliation and RANGER-DTL.

Authors:  Mukul S Bansal
Journal:  Methods Mol Biol       Date:  2022

3.  Hierarchical clustering of maximum parsimony reconciliations.

Authors:  Ross Mawhorter; Ran Libeskind-Hadas
Journal:  BMC Bioinformatics       Date:  2019-11-27       Impact factor: 3.169

4.  An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model.

Authors:  Santi Santichaivekin; Ross Mawhorter; Ran Libeskind-Hadas
Journal:  BMC Bioinformatics       Date:  2019-12-17       Impact factor: 3.169

  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.