Phase transitions in phylogeny
From MaRDI portal
Publication:4461189
DOI10.1090/S0002-9947-03-03382-8zbMath1041.92018arXivmath/0304491OpenAlexW1846857138MaRDI QIDQ4461189
Publication date: 29 March 2004
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0304491
Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Applications of branching processes (60J85) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Phase transitions (general) in equilibrium statistical mechanics (82B26)
Related Items
Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges, Reconstructibility of a general DNA evolution model, Towards optimal distance functions for stochastic substitution models, Robust reconstruction on trees is determined by the second eigenvalue., Reconstruction of random colourings, On the variational distance of two trees, Consistency and convergence rate of phylogenetic inference via regularization, Fast phylogeny reconstruction through learning of ancestral sequences, On the inference of large phylogenies with long branches: how long is too long?, A phase transition for a random cluster model on phylogenetic trees., The tightness of the Kesten-Stigum reconstruction bound of symmetric model with multiple mutations, Phase transition in the sample complexity of likelihood-based phylogeny inference, GIBBS MEASURES ON CAYLEY TREES: RESULTS AND OPEN PROBLEMS, Teasing Apart Two Trees, Global alignment of molecular sequences via ancestral state reconstruction, Reconstruction for the Potts model, Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture, Unnamed Item, Information reconstruction on an infinite tree for a \(4\times 4\)-state asymmetric model with community effects, Sufficient condition for root reconstruction by parsimony on binary trees with general weights, Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels, Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree, Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods, An impossibility result for phylogeny reconstruction from \(k\)-mer counts, Broadcasting on random recursive trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short proof for a theorem of Harper about Hamming-spheres
- Gibbs measures and phase transitions
- Markov random fields on an infinite tree
- Remarks on the limiting Gibbs states on a (d+1)-tree
- Taxonomy with confidence
- Recovering a tree from the leaf colourations it generates under a Markov model
- Information flow on trees
- A phase transition for a random cluster model on phylogenetic trees.
- On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
- The Ising model and percolation on trees and tree-like graphs
- Reconstruction on trees: Beating the second eigenvalue
- Broadcasting on trees and the Ising model.
- Robust reconstruction on trees is determined by the second eigenvalue.
- On the extremality of the disordered state for the Ising model on the Bethe lattice
- A few logs suffice to build (almost) all trees. II
- Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
- A few logs suffice to build (almost) all trees (I)
- Percolation
- Optimal numberings and isoperimetric problems on graphs
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
