SearcharxivSearch

arXiv subjects

Gilles Didier

Publications and source records attributed to Gilles Didier.

3 recordsLinked to original sources

Phylogenetic dynamics of MRCA ages and empirical moments of a Brownian trait

We study the temporal dynamics of the first two empirical moments of Brownian traits on phylogenetic trees. For a fixed tree, we characterize the distributions of their empirical mean and empirical variance across all lineages extant at any given time. In particular, we show that the variance of the empirical mean and the expected empirical variance are piecewise linear between diversification events. For lineage-homogeneous random trees, both the variance of the empirical mean and the expected empirical variance can be expressed in terms of the expected age of the most recent common ancestor (MRCA) of a uniformly sampled pair of extant lineages. In this representation, the expected MRCA age enters the two quantities with opposite signs, pointing to a structural opposition between the variance of the empirical mean and the expected empirical variance. For generalized birth-death processes with time-dependent speciation and extinction rates, we derive an explicit formula for the distribution of the MRCA age of a uniformly sampled pair of extant lineages. This yields integral expressions, at any time, for both the variance of the empirical mean and the expected empirical variance. In the constant-rate birth-death case, we further obtain closed-form expressions for the expected empirical variance and describe its asymptotic behavior in the supercritical, critical and subcritical regimes.

q-bio.PE

Designing optimal- and fast-on-average pattern matching algorithms

Given a pattern $w$ and a text $t$, the speed of a pattern matching algorithm over $t$ with regard to $w$, is the ratio of the length of $t$ to the number of text accesses performed to search $w$ into $t$. We first propose a general method for computing the limit of the expected speed of pattern matching algorithms, with regard to $w$, over iid texts. Next, we show how to determine the greatest speed which can be achieved among a large class of algorithms, altogether with an algorithm running this speed. Since the complexity of this determination make it impossible to deal with patterns of length greater than 4, we propose a polynomial heuristic. Finally, our approaches are compared with 9 pre-existing pattern matching algorithms from both a theoretical and a practical point of view, i.e. both in terms of limit expected speed on iid texts, and in terms of observed average speed on real data. In all cases, the pre-existing algorithms are outperformed.

cs.DS

Optimal pattern matching algorithms

We study a class of finite state machines, called \defi{$w$-matching machines}, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern $w$. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern $w$. Defining the order of a matching machine or of an algorithm as the maximum difference between the current and accessed positions during a search (standard algorithms are generally of order $|w|$), we show that being given a pattern $w$, an order $k$ and an iid model, there exists an optimal $w$-matching machine, i.e. with the greatest asymptotic speed under the model among all the machines of order $k$, of which the set of states belongs to a finite and enumerable set. It shows that it is possible to determine: 1) the greatest asymptotic speed among a large class of algorithms, with regard to a pattern and an iid model, and 2) a $w$-matching machine, thus an algorithm, achieving this speed.

cs.CC