Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
From MaRDI portal
(Redirected from Publication:1663866)
Abstract: We establish necessary and sufficient conditions for consistent root reconstruction in continuous-time Markov models with countable state space on bounded-height trees. Here a root state estimator is said to be consistent if the probability that it returns to the true root state converges to 1 as the number of leaves tends to infinity. We also derive quantitative bounds on the error of reconstruction. Our results answer a question of Gascuel and Steel and have implications for ancestral sequence reconstruction in a classical evolutionary model of nucleotide insertion and deletion.
Recommendations
- Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
- Sufficient condition for root reconstruction by parsimony on binary trees with general weights
- Sufficient conditions for two tree reconstruction techniques to succeed on sufficiently long sequences
- Optimal phylogenetic reconstruction
- How much can evolved characters tell us about the tree that generated them?
Cites work
- scientific article; zbMATH DE number 46153 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- scientific article; zbMATH DE number 1220667 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3405304 (Why is no real title available?)
- A survey of results for deletion channels and related synchronization channels
- Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
- Asymptotic theory with hierarchical autocorrelation: Ornstein-Uhlenbeck tree models
- Broadcasting on trees and the Ising model.
- Continuous time Markov processes. An introduction.
- Continuous-time Markov chains. An applications-oriented approach
- Elements of Information Theory
- Global alignment of molecular sequences via ancestral state reconstruction
- Inferring ancestral sequences in taxon-rich phylogenies
- Information flow on trees
- Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
- Inverting random functions
- On the extremality of the disordered state for the Ising model on the Bethe lattice
- On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
- Phylogeny. Discrete and random processes in evolution
- Probability Inequalities for Sums of Bounded Random Variables
- Probability. Theory and examples.
- Reconstruction for Colorings on Trees
- Reconstruction for the Potts model
- Reconstruction of random colourings
- Reconstruction on trees: Beating the second eigenvalue
- Reconstruction threshold for the hardcore model
- Testing Statistical Hypotheses
Cited in
(9)- When can we reconstruct the ancestral state? Beyond Brownian motion
- When can we reconstruct the ancestral state? A unified theory
- An impossibility result for phylogeny reconstruction from \(k\)-mer counts
- Ancestral state reconstruction with large numbers of sequences and edge-length estimation
- Reconstructibility of a general DNA evolution model
- Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods
- Sufficient condition for root reconstruction by parsimony on binary trees with general weights
- Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling
- Reconstruction on trees: exponential moment bounds for linear estimators
This page was built for publication: Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663866)
