Estéban Gabory

activity

20242026

collaborators

6 papers

cs.DS2026

Algorithms and Indexing Lower Bounds for Variable String Matching

EstÃ©ban Gabory

A \emph{generalized degenerate string} (GD) is a sequence $T = T_{1} \dots T_{n}$ of nonempty finite sets of strings, called \emph{segments}, such that all strings in a segment have the s…

cs.DS2025

Balancing Two-Dimensional Straight-Line Programs

Itai Boneh, EstÃ©ban Gabory, PaweÅ Gawrychowski +1

We consider building, given a straight-line program (SLP) consisting of $g$ productions deriving a two-dimensional string $T$ of size $N \times N$ , a structure capable of providing…

cs.DM2025

Unclustered BWTs of any Length over Non-Binary Alphabets

Gabriele Fici, EstÃ©ban Gabory, Giuseppe Romana +1

We prove that for every integer $n > 0$ and for every alphabet $I^£_{k}$ of size $k \geq 3$ , there exists a necklace of length $n$ whose Burrows-Wheeler Transform (BWT) is completely…

math.CO2025

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform

Gabriele Fici, EstÃ©ban Gabory

We define generalized de Bruijn words as those words having a Burrows-Wheeler transform that is a concatenation of permutations of the alphabet. We show that generalized de Bruijn…

cs.DS2025

String Consensus Problems with Swaps and Substitutions

String consensus problems aim at finding a string that minimizes some given distance with respect to an input set of strings. In particular, in the Closest string problem, we are g…

cs.DS2024

Elastic-Degenerate String Comparison

Esteban Gabory, Moses Njagi Mwaniki, Nadia Pisanti +4

An elastic-degenerate (ED) string $T$ is a sequence of $n$ sets $T [1], \dots, T [n]$ containing $m$ strings in total whose cumulative length is $N$ . We call $n$ , $m$ , and $N$ the len…