2 citations · 2 across the 3 of their papers we have counts for
5 papers
Grammar Index By Induced Suffix Sorting
Tooru Akagi, Dominik Köppl, Yuto Nakashima +3
Pattern matching is the most central task for text indices. Most recent indices leverage compression techniques to make pattern matching feasible for massive but highly-compressibl…
Counting Distinct (Non-)Crossing Substrings in Optimal Time
Haruki Umezaki, Hiroki Shibata, Dominik Köppl +3
Let be a string of length . The problem of counting factors crossing a position -- Problem 64 from the textbook ``125 Problems in Text Algorithms'' [Crochemore, Lecroq, and…
The Smallest String Attractors of Fibonacci and Period-Doubling Words
Mutsunori Banbara, Hideo Bannai, Peaker Guo +3
A string attractor of a string is a set of positions of such that any substring of has an occurrence that crosses a position in , i.e., there is a…
Bijective BWT based compression schemes
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
We investigate properties of the bijective Burrows-Wheeler transform (BBWT). We show that for any string , a bidirectional macro scheme of size can be induced from the…
Edit and Alphabet-Ordering Sensitivity of Lex-parse
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi +2
We investigate the compression sensitivity [Akagi et al., 2023] of lex-parse [Navarro et al., 2021] for two operations: (1) single character edit and (2) modification of the alphab…