Phase transition in the sample complexity of likelihood-based phylogeny inference
From MaRDI portal
Publication:682796
DOI10.1007/s00440-017-0793-xzbMath1379.92041arXiv1508.01964OpenAlexW2964002726MaRDI QIDQ682796
Publication date: 5 February 2018
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.01964
Problems related to evolution (92D15) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Genetics and epigenetics (92D10)
Related Items
Consistency and convergence rate of phylogenetic inference via regularization, Combinatorial statistics and the sciences, Unnamed Item, Sufficient condition for root reconstruction by parsimony on binary trees with general weights, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies
- On the inference of large phylogenies with long branches: how long is too long?
- Global alignment of molecular sequences via ancestral state reconstruction
- Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
- On the variational distance of two trees
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Gibbs measures and phase transitions
- Taxonomy with confidence
- Recovering a tree from the leaf colourations it generates under a Markov model
- 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
- Phylogenetic mixtures: concentration of measure in the large-tree limit
- Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
- Fast phylogeny reconstruction through learning of ancestral sequences
- A few logs suffice to build (almost) all trees. II
- A signal-to-noise analysis of phylogeny estimation by neighbor-joining: Insufficiency of polynomial length sequences
- Evolutionary Trees Can be Learned in Polynomial Time in the Two-State General Markov Model
- Phylogeny
- Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
- Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
- Toward Extracting All Phylogenetic Information from Matrices of Evolutionary Distances
- Finding a maximum likelihood tree is hard
- A few logs suffice to build (almost) all trees (I)
- Phase transitions in phylogeny
- Computational Phylogenetics
- Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
- Reconstruction for the Potts model
- A Large-Deviation Analysis of the Maximum-Likelihood Learning of Markov Tree Structures
- Learning Latent Tree Graphical Models
- Testing Statistical Hypotheses
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- Computational Genome Analysis
- Note on the Consistency of the Maximum Likelihood Estimate
- Learning nonsingular phylogenies and hidden Markov models
- Subtree transfer operations and their induced metrics on evolutionary trees
