On the variational distance of two trees
DOI10.1214/105051606000000196zbMath1111.62111arXivmath/0610323OpenAlexW2038969923MaRDI QIDQ862218
László A. Székely, Mike A. Steel
Publication date: 5 February 2007
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610323
Cavender-Farris-Neyman modelJukes-Cantor modelphylogeny reconstruction\(q\)-state Potts modelsequence evolutionsymmetric binary channeltree-based Markov processYule-Harding distribution
Applications of statistics to biology and medical sciences; meta analysis (62P10) Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for the existence of certain quadratic invariants under a phylogenetic tree
- On the variational distance of two trees
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- Modeling the covarion hypothesis of nucleotide substitution
- Information flow on trees
- Broadcasting on trees and the Ising model.
- A few logs suffice to build (almost) all trees. II
- Optimal phylogenetic reconstruction
- Efficient algorithms for inverting evolution
- A few logs suffice to build (almost) all trees (I)
- A central limit theorem for the parsimony length of trees
- Phase transitions in phylogeny
This page was built for publication: On the variational distance of two trees