Search Results for author: Shunsuke Inenaga

Found 3 papers, 3 papers with code

Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph

1 code implementation4 Aug 2023 Hiroki Arimura, Shunsuke Inenaga, Yasuaki Kobayashi, Yuto Nakashima, Mizuki Sue

In this paper, we present the first study of the computational complexity of converting an automata-based text index structure, called the Compact Directed Acyclic Word Graph (CDAWG), of size $e$ for a text $T$ of length $n$ into other text indexing structures for the same text, suitable for highly repetitive texts: the run-length BWT of size $r$, the irreducible PLCP array of size $r$, and the quasi-irreducible LPF array of size $e$, as well as the lex-parse of size $O(r)$ and the LZ77-parse of size $z$, where $r, z \le e$.

c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches

1 code implementation16 Apr 2019 Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Given a dynamic set $K$ of $k$ strings of total length $n$ whose characters are drawn from an alphabet of size $\sigma$, a keyword dictionary is a data structure built on $K$ that provides locate, prefix search, and update operations on $K$.

Computing All Distinct Squares in Linear Time for Integer Alphabets

1 code implementation11 Oct 2016 Hideo Bannai, Shunsuke Inenaga, Dominik Köppl

Given a string on an integer alphabet, we present an algorithm that computes the set of all distinct squares belonging to this string in time linear to the string length.

Data Structures and Algorithms

Cannot find the paper you are looking for? You can Submit a new open access paper.