Given two indeterminate equal-length strings p and t with a set of characters per position in
both strings, we obtain a determinate string p_w from p and a determinate string t_w from t …

A Cartesian tree is associated with a string of numbers and is structured as a heap from
which the original string can be recovered. Although Cartesian trees have been introduced …

Cartesian tree matching is the problem of finding all substrings in a given text which have
the same Cartesian trees as that of a given pattern. In this paper, we deal with Cartesian tree …

Cartesian trees have been introduced 40 years ago. They are associated to strings of
numbers. They are structured as heap and original strings can be recovered by symmetrical …

String matching is a fundamental problem in computer science, with a myriad of direct
applications into several distinct areas of computing, including information retrieval, data …

String matching is a fundamental problem in computer science [1], with a myriad of direct
applications into several distinct areas of computing, including information retrieval, data …

Ce stage est financé par la fédération de recherche NormaSTIC. Il est partagé entre
l'université de Rouen ou l'université de Caen (avec un unique lieu de résidence pour la/le …