2 papers
cs.DS2026
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…
cs.DS2024
Random Wheeler Automata
Ruben Becker, Davide Cenzato, Sung-Hwan Kim +3
Wheeler automata were introduced in 2017 as a tool to generalize existing indexing and compression techniques based on the Burrows-Wheeler transform. Intuitively, an automaton is s…