The combinatorics of discrete time-trees: theory and open problems

Recommendations

Cites work

A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
Birth-death models and coalescent point processes: the shape and probability of reconstructed phylogenies
Fast Convergence of Markov Chain Monte Carlo Algorithms for Phylogenetic Reconstruction with Homogeneous Data on Closely Related Species
Geometry of the space of phylogenetic trees
scientific article; zbMATH DE number 1865935 (Why is no real title available?)
Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny
Maximum likelihood estimation of a migration matrix and effective population sizes in n subpopulations by using a coalescent approach
On computing the nearest neighbor interchange distance
Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
Short Encodings of Evolving Structures
Some notes on the nearest neighbour interchange distance
The space of ultrametric phylogenetic trees

Cited in

(12)

Some combinatorial aspects of time-stamp systems
The geometry of partial fitness orders and an efficient method for detecting genetic interactions
Walks in phylogenetic treespace
Tree decomposition of Reeb graphs, parametrized complexity, and applications to phylogenetics
Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
A note on the relaxation time of two Markov chains on rooted phylogenetic tree spaces
Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
Ranked subtree prune and regraft
Spaces of ranked tree-child networks
Computing nearest neighbour interchange distances between ranked phylogenetic trees
Discrete coalescent trees
rrnni

Describes a project that uses

Uses Software

This page was built for publication: The combinatorics of discrete time-trees: theory and open problems