From the 2 of 21 linked papers with an AI index.
2 citations · 3 across the 8 of their papers we have counts for
21 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…
Compact Enumeration of Maximal Closed Substrings in Run-Length Encoded Strings
Haruki Umezaki, Hiroki Shibata, Yuto Nakashima +1
A string is closed if , or if has a non-empty proper border occurring only as its prefix and suffix. A maximal closed substring (MCS) is a maximal occurrence of a cl…
Output-Sensitive Construction of CDAWGs from BWT-Runs
Yuta Tsuruzono, Hiroki Arimura, Shunsuke Inenaga
The compact directed acyclic word graph (CDAWG) of a string can be viewed in two equivalent ways: as the edge-compacted DAWG of the string, and as the DAG obtained from the suffix…
Fully Persistent Dynamic LCE via AVL Trees and AVL Grammars
Taiki Kaneda, Hiroki Arimura, Shunsuke Inenaga
We study fully persistent dynamic strings with equality and longest common extension (LCE) queries. Straightforward full persistence is problematic for the splay-based FeST structu…
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)…