Results 1 to 10 of about 486,413 (227)
Rearrangement operations on unrooted phylogenetic networks [PDF]
Rearrangement operations transform a phylogenetic tree into another one and hence induce a metric on the space of phylogenetic trees. Popular operations for unrooted phylogenetic trees are NNI (nearest neighbour interchange), SPR (subtree prune and ...
Remie Janssen, Jonathan Klawitter
doaj +2 more sources
Uncertainty in phylogenetic tree estimates [PDF]
Estimating phylogenetic trees is an important problem in evolutionary biology, environmental policy and medicine. Although trees are estimated, their uncertainties are discarded by mathematicians working in tree space.
Bell, Rayna C., Willis, Amy D.
core +4 more sources
On the number of vertices of each rank in phylogenetic trees and their generalizations [PDF]
We find surprisingly simple formulas for the limiting probability that the rank of a randomly selected vertex in a randomly selected phylogenetic tree or generalized phylogenetic tree is a given integer.
Miklós Bóna
doaj +3 more sources
Folding and unfolding phylogenetic trees and networks [PDF]
Phylogenetic networks are rooted, labelled directed acyclic graphs which are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any phylogenetic network $N$ can be 'unfolded' to obtain a MUL-tree $U(N)$ and, conversely, a MUL-tree $T$ can in certain ...
C Semple+17 more
arxiv +4 more sources
The space of ultrametric phylogenetic trees [PDF]
The reliability of a phylogenetic inference method from genomic sequence data is ensured by its statistical consistency. Bayesian inference methods produce a sample of phylogenetic trees from the posterior distribution given sequence data.
Drummond, Alexei J., Gavryushkin, Alex
core +5 more sources
Data on the solution and processing time reached when constructing a phylogenetic tree using a quantum-inspired computer [PDF]
Phylogenetic trees provide insight into the evolutionary trajectories of species and molecules. However, because (2n-5)! Phylogenetic trees can be constructed from a dataset containing n sequences, but this method of phylogenetic tree construction is not
Wataru Onodera+4 more
doaj +2 more sources
The Identifiability of Tree Topology for Phylogenetic Models, Including Covarion and Mixture Models [PDF]
For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model predicts, it must be possible to recover the tree parameter.
Elizabeth S. Allman, John A. Rhodes
openalex +5 more sources
On the Matrix Condition of Phylogenetic Tree. [PDF]
Phylogenetic comparative analyses use trees of evolutionary relationships between species to understand their evolution and ecology. A phylogenetic tree of n taxa can be algebraically transformed into an n by n squared symmetric phylogenetic covariance matrix C where each element [Formula: see text] in C represents the affinity between extant species ...
Jhwueng DC, O'Meara BC.
europepmc +6 more sources
Characterization of a Branch of the Phylogenetic Tree [PDF]
We use a combination of analytic models and computer simulations to gain insight into the dynamics of evolution. Our results suggest that certain interesting phenomena should eventually emerge from the fossil record. For example, there should be a ``tortoise and hare effect'': Those genera with the smallest species death rate are likely to survive much
Stuart Samuel, Gezhi Weng
openalex +6 more sources
Locating a tree in a phylogenetic network [PDF]
Phylogenetic trees and networks are leaf-labelled graphs that are used to describe evolutionary histories of species. The Tree Containment problem asks whether a given phylogenetic tree is embedded in a given phylogenetic network. Given a phylogenetic network and a cluster of species, the Cluster Containment problem asks whether the given cluster is a ...
Charles Semple+2 more
arxiv +6 more sources