5 citations · 5 across the 4 of their papers we have counts for
11 papers
Dynamic Grammar-Compressed Self-Index in -Optimal Space
Takaaki Nishimoto, Yasuo Tabei
A compressed self-index stores a string in compressed form while supporting locate queries without decompression. For highly repetitive strings, such as those arising in web crawls…
Dynamic r-index: An Updatable Self-Index in LCP-bounded Time
Takaaki Nishimoto, Yasuo Tabei
A self-index is a compressed data structure that supports locate queries -- reporting all positions where a given pattern occurs in a string while maintaining the string in compres…
Dynamic Suffix Array in Optimal Compressed Space
Takaaki Nishimoto, Yasuo Tabei
Big data, encompassing extensive datasets, has seen rapid expansion, notably with a considerable portion being textual data, including strings and texts. Simple compression methods…
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space
Takaaki Nishimoto, Shunsuke Kanda, Yasuo Tabei
The compression of highly repetitive strings (i.e., strings with many repetitions) has been a central research topic in string processing, and quite a few compression methods for t…
A Separation of and via Thue--Morse Words
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I +3
We prove that for , the size of the smallest bidirectional scheme for the th Thue--Morse word is . Since Kutsukake et al. [SPIRE 2020] show that the…
Optimal-Time Queries on BWT-runs Compressed Indexes
Takaaki Nishimoto, Yasuo Tabei
Indexing highly repetitive strings (i.e., strings with many repetitions) for fast queries has become a central research topic in string processing, because it has a wide variety of…