The AHU algorithm has been the state of the art since the 1970s for determining in linear
time whether two unordered rooted trees are isomorphic or not. However, it has been …

Frequent pattern mining is a relevant method to analyse structured data, like sequences,
trees or graphs. It consists in identifying characteristic substructures of a dataset. This paper …

The simple random walk on Z p shows two drastically different behaviors depending on the
value of p: it is recurrent when p∈{1, 2} while it escapes (with a rate increasing with p) as …

Tree data appear naturally in many scientific domains. Their intrinsically non-Euclidean
nature and the combinatorial explosion phenomenon make their analysis delicate. In this …

Given two messages–as linear sequences of letters, it is immediate to determine whether
one can be transformed into the other by simple substitution cipher of the letters. On the …

Self-nested trees present a systematic form of redundancy in their subtrees and thus achieve
optimal compression rates by directed acrylic graph (DAG) compression. A method for …

Reverse search is a convenient method for enumerating structured objects, that can be used
both to address theoretical issues and to solve data mining problems. This method has …

Abstract The Aho, Hopcroft and Ullman (AHU) algorithm has been the state of the art since
the 1970s for determining in linear time whether two unordered rooted trees are isomorphic …

In this paper, authors are interested in the problem of lossless compression of unlabeled
semi-ordered trees. Semi-ordered trees are a class of trees that present an order between …

We investigate some aspects of the problem of the estimation of birth distributions (BD) in
multi-type Galton-Watson (MGW) trees with unobserved types. More precisely, we consider …