Teasing Apart Two Trees

DOI10.1017/S0963548307008656MaRDI QIDQ5428367zbMATH OpenOpenAlexFDO

Authors László A. Székely, Mike Steel

Publication date 22 November 2007

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548307008656

Mathematics Subject Classification ID

Problems related to evolution (92D15) Trees (05C05) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05)

Recommendations

• Phylogenetic information complexity: is testing a tree easier than finding it?
• Optimal phylogenetic reconstruction
• A few logs suffice to build (almost) all trees (I)
• Algorithms for phylogeny reconstruction in a new mathematical model
• The complexity of reconstructing trees from qualitative characters and subtrees

Cites work

• Broadcasting on trees and the Ising model.
• Five surprising properties of parsimoniously colored trees
• Information flow on trees
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Inverting random functions
• Phase transitions in phylogeny
• Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
• Tree structures for proximity data

Cited in

(9)

• A note on distinguishing random trees populations
• Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees
• Phylogenetic information complexity: is testing a tree easier than finding it?
• Consistency of Bayesian inference of resolved phylogenetic trees
• Cutting down very simple trees
• Paired bondage in trees
• Inverting random functions. III: Discrete MLE revisited
• Inferring ancestral sequences in taxon-rich phylogenies
• On the variational distance of two trees

This page was built for publication: Teasing Apart Two Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428367)