4 papers
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 po…
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…
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…
NP-Completeness for the Space-Optimality of Double-Array Tries
Hideo Bannai, Keisuke Goto, Shunsuke Kanda +1
Indexing a set of strings for prefix search or membership queries is a fundamental task with many applications such as information retrieval or database systems. A classic abstract…