5 citations · 6 across the 3 of their papers we have counts for
6 papers
Computing the optimal BWT of very large string collections
Davide Cenzato, Veronica Guerrini, Zsuzsanna Lipták +1
It is known that the exact form of the Burrows-Wheeler-Transform (BWT) of a string collection depends, in most implementations, on the input order of the strings in the collection.…
Computing the original eBWT faster, simpler, and with less memory
Christina Boucher, Davide Cenzato, Zsuzsanna Lipták +2
Mantaci et al. [TCS 2007] defined the eBWT to extend the definition of the BWT to a collection of strings, however, since this introduction, it has been used more generally to desc…
When a Dollar Makes a BWT
Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo +1
The Burrows-Wheeler-Transform (BWT) is a reversible string transformation which plays a central role in text compression and is fundamental in many modern bioinformatics applicatio…
On Prefix Normal Words
Gabriele Fici, Zsuzsanna Lipták
We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length , no factor of length has more 's than the pre…
On the Parikh-de-Bruijn grid
Péter Burcsi, Zsuzsanna Lipták, W. F. Smyth
We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural in…
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs
Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta +4
We consider how to index strings, trees and graphs for jumbled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing…