143 citations · 363 across the 42 of their papers we have counts for
3 papers · 1 filter
On Computing Minimum Wheeler DFA From Their Language
Ruben Becker, Davide Cenzato, Nicola Prezza +1
Wheeler automata have recently emerged as a powerful generalization of the Burrows-Wheeler Transform, enabling optimal linear-time pattern matching on compressed labeled graphs --…
Faster Cache-Efficient Pattern Matching for Deterministic Wheeler Pangenome Graphs
Riccardo Maso, Nicola Prezza, Carlo Tosoni
Pattern matching on strings is regarded as one of the core operations in computer science. Although researchers proposed several solutions to this problem, some of the most elegant…
Incongruity-sensitive access to highly compressed strings
Ferdinando Cicalese, Zsuzsanna Lipták, Travis Gagie +3
Random access to highly compressed strings -- represented by straight-line programs or Lempel-Ziv parses, for example -- is a well-studied topic. Random access to such strings in s…