Related papers: Mutation effects in ordered trees

We study the growth of a time-ordered rooted tree by probabilistic attachment of new vertices to leaves. We construct a likelihood function of the leaves based on the connectivity of the tree. We take such connectivity to be induced by the…

We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts.

The purpose of this paper is to analyze certain statistics of a recently introduced non-uniform random tree model, biased recursive trees. This model is based on constructing a random tree by establishing a correspondence with non-uniform…

Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly…

This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…

We investigate conditioning Galton-Watson trees on general recursive-type events, such as the event that the tree survives until a specific level. It turns out that the conditioned tree is again a type of Galton-Watson tree, with different…

Understanding if and how mutants reach fixation in populations is an important question in evolutionary biology. We study the impact of population growth has on the success of mutants. To systematically understand the effects of growth we…

Trees of finite cone type have appeared in various contexts. In particular, they come up as simplified models of regular tessellations of the hyperbolic plane. The spectral theory of the associated Laplacians can thus be seen as induced by…

Understanding why we age is a long-lived open problem in evolutionary biology. Aging is prejudicial to the individual and evolutionary forces should prevent it, but many species show signs of senescence as individuals age. Here, I will…

The reconstruction of large phylogenetic trees from data that violates clocklike evolution (or as a supertree constructed from any m input trees) raises a difficult question for biologists - how can one assign relative dates to the vertices…

Tree-structured data naturally appear in various fields, particularly in biology where plants and blood vessels may be described by trees, but also in computer science because XML documents form a tree structure. This paper is devoted to…

The inheritance of characteristics induced by the environment has often been opposed to the theory of evolution by natural selection. Yet, while evolution by natural selection requires new heritable traits to be produced and transmitted, it…

We study random trees which are invariant in law under the operation of contracting each edge independently with probability $p\in(0,1)$. We show that all such trees can be constructed through Poissonian sampling from a certain class of…

We study three different kinds of embeddings of tree patterns: weakly-injective, ancestor-preserving, and lca-preserving. While each of them is often referred to as injective embedding, they form a proper hierarchy and their computational…

The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…

Most new mutations are deleterious and are eventually eliminated by natural selection. But in an adapting population, the rapid amplification of beneficial mutations can hinder the removal of deleterious variants in nearby regions of the…

A Markov tree is a random vector indexed by the nodes of a tree whose distribution is determined by the distributions of pairs of neighbouring variables and a list of conditional independence relations. Upon an assumption on the tails of…

In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…

Besides serving as prediction models, classification trees are useful for finding important predictor variables and identifying interesting subgroups in the data. These functions can be compromised by weak split selection algorithms that…

The precise analysis of the variance of the profile of a suffix tree has been a longstanding open problem. We analyze three regimes of the asymptotic growth of the variance of the profile of a suffix tree built from a randomly generated…