Critical threshold for ancestral reconstruction by maximum parsimony on general phylogenies

08/08/2017
by   Sebastien Roch, et al.
0

We consider the problem of inferring an ancestral state from observations at the leaves of a tree, assuming the state evolves along the tree according to a two-state symmetric Markov process. We establish a general branching rate condition under which maximum parsimony, a common reconstruction method requiring only the knowledge of the tree, succeeds better than random guessing uniformly in the depth of the tree. We thereby generalize previous results of (Zhang et al., 2010) and (Gascuel and Steel, 2010). Our results apply to both deterministic and i.i.d. edge weights.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs

In this draft we prove an interesting structural property related to the...
research
05/11/2020

Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems

Consider a Markov process with state space [k], which jumps continuously...
research
02/22/2023

Broadcasting with Random Matrices

Motivated by the theory of spin-glasses in physics, we study the so-call...
research
02/05/2021

Reconstructing Arbitrary Trees from Traces in the Tree Edit Distance Model

In this paper, we consider the problem of reconstructing trees from trac...
research
02/17/2021

Robust Estimation of Tree Structured Markov Random Fields

We study the problem of learning tree-structured Markov random fields (M...
research
06/22/2019

The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations

The tree reconstruction problem is to collect and analyze massive data a...

Please sign up or login with your details

Forgot password? Click here to reset