4 papers
25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
Maxime Crochemore, Thierry Lecroq, Wojtek Rytter
This very preliminary text is related to ``Algorithms on Texts'', also called ``Algorithmic Stringology''. It is an extension of the book ``125 Problems in Text Algorithms'' provid…
Cartesian Forest Matching
Bastien Auvray, Julien David, Richard Groult +1
In this paper, we introduce the notion of Cartesian Forest, which generalizes Cartesian Trees, in order to deal with partially ordered sequences. We show that algorithms that solve…
Approximate Cartesian Tree Matching with One Difference
Bastien Auvray, Julien David, Samah Ghazawi +3
Cartesian tree pattern matching consists of finding all the factors of a text that have the same Cartesian tree than a given pattern. There already exist theoretical and practical…
Efficient Computation of Periods and Covers Using Sampling
Thierry Lecroq, Francesco Pio Marino
Identifying regularities in strings, such as \emph{periods} and \emph{covers}, is crucial for applications in text compression, computational biology, and pattern recognition. \emp…