From the 1 of 8 linked papers with an AI index.
2 citations · 3 across the 2 of their papers we have counts for
8 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…
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…
On Occurrence-Preserving Morphisms
Kaisei Kishi, Peaker Guo, Cristian Urbina +1
A \emph{morphism} is a mapping that transforms words through letter-wise substitution, where each symbol is consistently replaced by a fixed word. In the field of combinatorics on…
String Representation Based on Substring Equation Systems
Hiroki Shibata, Hideo Bannai
Repetitiveness measures quantify how much repetitive structure a string contains and serve as parameters for compressed representations and indexing data structures. Many compressi…
Sensitivity of Repetitiveness Measures to String Reversal
Hideo Bannai, Yuto Fujie, Peaker Guo +4
We study the impact that string reversal can have on several repetitiveness measures. First, we exhibit an infinite family of strings where the number, , of runs in the run-leng…
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…