Representing and extending ensembles of parsimonious evolutionary histories with a directed acyclic graph
In many situations, it would be useful to know not just the best phylogenetic tree for a given data set, but the collection of high-quality trees. This goal is typically addressed using Bayesian techniques, however, current Bayesian methods do not scale to large data sets. Furthermore, for large data sets with relatively low signal one cannot even store every good tree individually, especially when the trees are required to be bifurcating. In this paper, we develop a novel object called the "history subpartition directed acyclic graph" (or "history sDAG" for short) that compactly represents an ensemble of trees with labels (e.g. ancestral sequences) mapped onto the internal nodes. The history sDAG can be built efficiently and can also be efficiently trimmed to only represent maximally parsimonious trees. We show that the history sDAG allows us to find many additional equally parsimonious trees, extending combinatorially beyond the ensemble used to construct it. We argue that this object could be useful as the "skeleton" of a more complete uncertainty quantification.
Code (1)
Tasks
Uncertainty QuantificationSimilar Papers 제목 키워드 기반
Densely sampled phylogenies frequently deviate from maximum parsimony in simple and local ways
Why do phylogenetic algorithms fail when they return incorrect answers? This simple question has not been answered in detail, even for maximum parsimony (MP), the simplest phylogenetic criterion. Understanding MP has rec…
Developing parsimonious ensembles using predictor diversity within a reinforcement learning framework
Heterogeneous ensembles that can aggregate an unrestricted number and variety of base predictors can effectively address challenging prediction problems. In particular, accurate ensembles that are also parsimonious, i.e.…
Diversityreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1Dimensions of Level-1 Group-Based Phylogenetic Networks
Phylogenetic networks represent evolutionary histories of sets of taxa where horizontal evolution or hybridization has occurred. Placing a Markov model of evolution on a phylogenetic network gives a model that is particu…
Developing parsimonious ensembles using ensemble diversity within a reinforcement learning framework
Heterogeneous ensembles built from the predictions of a wide variety and large number of diverse base predictors represent a potent approach to building predictive models for problems where the ideal base/individual pred…
Diversityreinforcement-learningReinforcement LearningReinforcement Learning (RL)Parsimonious evolutionary scenario for the origin of allostery and coevolution patterns in proteins
Proteins display generic properties that are challenging to explain by direct selection, notably allostery, the capacity to be regulated through long-range effects, and evolvability, the capacity to adapt to new selectiv…