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
- Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
- Phase transitions in phylogeny
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
- Tree structures for proximity data
Cited in
(11)- Recovering a tree from the leaf colourations it generates under a Markov model
- Phylogenetic information complexity: is testing a tree easier than finding it?
- Consistency of Bayesian inference of resolved phylogenetic trees
- Cutting down very simple trees
- A note on distinguishing random trees populations
- Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees
- Inverting random functions. III: Discrete MLE revisited
- Asymptotic Guarantees for Bayesian Phylogenetic Tree Reconstruction
- Inferring ancestral sequences in taxon-rich phylogenies
- On the variational distance of two trees
- Paired bondage in 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)
