Teasing Apart Two Trees
From MaRDI portal
Publication:5428367
DOI10.1017/S0963548307008656zbMATH Open1130.05021OpenAlexW2154501034MaRDI QIDQ5428367FDOQ5428367
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
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
Problems related to evolution (92D15) Trees (05C05) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05)
Cites Work
- Tree structures for proximity data
- Broadcasting on trees and the Ising model.
- Inverting random functions
- Information flow on trees
- Five surprising properties of parsimoniously colored trees
- Phase transitions in phylogeny
- Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
- Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
Cited In (8)
- Cutting down very simple trees
- Inferring ancestral sequences in taxon-rich phylogenies
- Phylogenetic information complexity: is testing a tree easier than finding it?
- Analyzing the fitch method for reconstructing ancestral states on ultrametric phylogenetic trees
- Consistency of Bayesian inference of resolved phylogenetic trees
- Paired bondage in trees
- Inverting random functions. III: Discrete MLE revisited
- 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)
