1 citations · 3 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
Unclustered BWTs of any Length over Non-Binary Alphabets
Gabriele Fici, Estéban Gabory, Giuseppe Romana +1
We prove that for every integer and for every alphabet of size , there exists a necklace of length whose Burrows-Wheeler Transform (BWT) is completely u…
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…
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…