1 citations · 1 across the 4 of their papers we have counts for
4 papers
Exploring Repetitiveness Measures for Two-Dimensional Strings
Giuseppe Romana, Marinella Sciortino, Cristian Urbina
Detecting and measuring repetitiveness of strings is a problem that has been extensively studied in data compression and text indexing. However, when the data are structured in a n…
Computing matching statistics on Wheeler DFAs
Alessio Conte, Nicola Cotumaccio, Travis Gagie +3
Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPI…
Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform
Travis Gagie, Giovanni Manzini, Marinella Sciortino
The Burrows-Wheeler Transform (BWT) is often taught in undergraduate courses on algorithmic bioinformatics, because it underlies the FM-index and thus important tools such as Bowti…
Universal Lyndon Words
Arturo Carpi, Gabriele Fici, Stepan Holub +2
A word over an alphabet is a Lyndon word if there exists an order defined on for which is lexicographically smaller than all of its conjugates (other than itself).…