1 citations · 3 across the 7 of their papers we have counts for
6 papers · 1 filter
Algorithms and Indexing Lower Bounds for Variable String Matching
Estéban Gabory
A \emph{generalized degenerate string} (GD) is a sequence of nonempty finite sets of strings, called \emph{segments}, such that all strings in a segment have the s…
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 productions deriving a two-dimensional string of size , a structure capable of providing…
String Consensus Problems with Swaps and Substitutions
Estéban Gabory, Laurent Bulteau, Gabriele Fici +1
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…
Elastic-Degenerate String Comparison
Esteban Gabory, Moses Njagi Mwaniki, Nadia Pisanti +4
An elastic-degenerate (ED) string is a sequence of sets containing strings in total whose cumulative length is . We call , , and the len…
Space-Efficient Indexes for Uncertain Strings
Esteban Gabory, Chang Liu, Grigorios Loukides +2
Strings in the real world are often encoded with some level of uncertainty. In the character-level uncertainty model, an uncertain string of length on an alphabet is a…
Elastic-Degenerate String Matching with 1 Error
Giulia Bernardini, Estéban Gabory, Solon P. Pissis +3
An elastic-degenerate string is a sequence of finite sets of strings of total length , introduced to represent a set of related DNA sequences, also known as a pangenome. The…