Add to ORKGWe investigate a probability-based model of character evolution. Using Erdos-Szekely path systems, a sharp upper bound for the probability of a given character evolving under this model is obtained in terms of its parsimony length. In the case of binary characters the conditions under which this bound is realised are determined
AbstractWe establish a log-supermodularity property for probability distributions on binary patterns...
Motivated by problems of pattern statistics, we study the limit distribution of the random variable ...
International audienceBifurcating Markov chains (BMC) are Markov chains indexed by a full binary tre...
The rate of evolutionary change associated with a character determines its utility for the reconstru...
In this note, some probabilistic models for replication of character strings are considered. These r...
Abstract:-We propose a simple model for the evolution of phenotypic characters based on a axiomatic ...
<p>Probability of observed pattern of correlated evolution between pairs of characters.</p
The j-state general Markov model of evolution ( due to Steel) is a stochastic model concerned with t...
Despite its intrinsic difficulty, ancestral character state reconstruction is an essential tool for ...
Studying Markov models for binary character evolution along the branches of unrooted four-trees, Cav...
We illustrate some ideas and results that arise in the analysis of waiting times to occurrences of w...
The effects of restrictions of available character space on the mean morphological distance between ...
Probabilistic models over strings have played a key role in developing methods allowing indels to be...
Felsenstein’s pruning algorithm allows one to calculate the probability of any particular data patte...
Inspired by the Dirac notation, a new set of symbols, the Probability Bracket Notation (PBN) is prop...
AbstractWe establish a log-supermodularity property for probability distributions on binary patterns...
Motivated by problems of pattern statistics, we study the limit distribution of the random variable ...
International audienceBifurcating Markov chains (BMC) are Markov chains indexed by a full binary tre...
The rate of evolutionary change associated with a character determines its utility for the reconstru...
In this note, some probabilistic models for replication of character strings are considered. These r...
Abstract:-We propose a simple model for the evolution of phenotypic characters based on a axiomatic ...
<p>Probability of observed pattern of correlated evolution between pairs of characters.</p
The j-state general Markov model of evolution ( due to Steel) is a stochastic model concerned with t...
Despite its intrinsic difficulty, ancestral character state reconstruction is an essential tool for ...
Studying Markov models for binary character evolution along the branches of unrooted four-trees, Cav...
We illustrate some ideas and results that arise in the analysis of waiting times to occurrences of w...
The effects of restrictions of available character space on the mean morphological distance between ...
Probabilistic models over strings have played a key role in developing methods allowing indels to be...
Felsenstein’s pruning algorithm allows one to calculate the probability of any particular data patte...
Inspired by the Dirac notation, a new set of symbols, the Probability Bracket Notation (PBN) is prop...
AbstractWe establish a log-supermodularity property for probability distributions on binary patterns...
Motivated by problems of pattern statistics, we study the limit distribution of the random variable ...
International audienceBifurcating Markov chains (BMC) are Markov chains indexed by a full binary tre...