A phase transition for a random cluster model on phylogenetic trees.

DOI10.1016/j.mbs.2003.10.004zbMath1047.92032arXivq-bio/0406044OpenAlexW2090729411WikidataQ46076531 ScholiaQ46076531MaRDI QIDQ1429803

Elchanan Mossel, Mike A. Steel

Publication date: 27 May 2004

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/q-bio/0406044

zbMATH Keywords

Phylogenetic treePhase transitionRandom cluster model

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Biochemistry, molecular biology (92C40)

Related Items

Phylogenetic information complexity: is testing a tree easier than finding it?, Robust reconstruction on trees is determined by the second eigenvalue., Closure operations in phylogenetics, Combinatorial statistics and the sciences, Mixed-up trees: the structure of phylogenetic mixtures, The matroid structure of representative triple sets and triple-closure computation, Phylogenetic mixtures and linear invariants for equal input models, GIBBS MEASURES ON CAYLEY TREES: RESULTS AND OPEN PROBLEMS, Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture, Sequence length bounds for resolving a deep phylogenetic divergence, Phase transitions in phylogeny, Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods, Gibbs measures of Potts model on Cayley trees: A survey and applications

Uses Software

• fastDNAml

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• Tree reconstruction from multi-state characters
• Gibbs measures and phase transitions
• Inverting random functions
• On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
• Steps toward accurate reconstructions of phylogenies from gene-order data.
• Broadcasting on trees and the Ising model.
• Tree structures for proximity data
• A few logs suffice to build (almost) all trees (I)
• Percolation
• Phase transitions in phylogeny
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Four Characters Suffice to Convexly Define a Phylogenetic Tree