1 citations · 1 across the 4 of their papers we have counts for
4 papers
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…
Approximate Cartesian Tree Matching: an Approach Using Swaps
Bastien Auvray, Julien David, Richard Groult +1
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 pattern matching in degenerate strings with the Burrows-Wheeler transform
Jacqueline W. Daykin, Richard Groult, Yannick Guesnet +6
A degenerate or indeterminate string on an alphabet is a sequence of non-empty subsets of . Given a degenerate string of length , we present a new method based on the…