From the 2 of 11 linked papers with an AI index.
1 citations · 1 across the 4 of their papers we have counts for
11 papers
Sliding suffix trees revisited
Laurentius Leonard, Shunsuke Inenaga, Hideo Bannai +1
The paper introduces a new algorithm that updates edge labels in sliding suffix trees in O(1) worst‑case time per node insertion or deletion, improving on previous amortized‑time m…
Relaxation of Square-Freeness
Hiroki Shibata, Takuya Mieno, Dominik Köppl +1
The paper studies nonrepetitive sequences under relaxed equivalence relations, introducing ℓ⁺-squares and constructing infinite words that avoid such squares for parameterized and…
Almost succinct representation of maximal palindromes
Takuya Mieno, Tomohiro I, Valerio Stancanelli
Palindromes are strings that read the same forward and backward. The computation of palindromic structures within strings is a fundamental problem in string algorithms, being motiv…
Online computation of maximal closed substrings
Hiroki Shibata, Haruki Umezaki, Takuya Mieno +2
A non-empty string is closed if it has length one or its longest border appears exactly twice in the string. An occurrence of a closed substring is a maximal closed substring (MCS)…
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…
Online Computation of Palindromes and Suffix Trees on Tries
Hiroki Shibata, Mitsuru Funakoshi, Takuya Mieno +5
We consider the problems of computing maximal palindromes and distinct palindromes in a trie. A trie is a natural generalization of a string, which can be seen as a single-path tre…