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