10 citations · 45 across the 21 of their papers we have counts for
24 papers
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…
Dynamic Similarity Search on Integer Sketches
Shunsuke Kanda, Yasuo Tabei
Similarity-preserving hashing is a core technique for fast similarity searches, and it randomly maps data points in a metric space to strings of discrete symbols (i.e., sketches) i…
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…
Succinct Trit-array Trie for Scalable Trajectory Similarity Search
Shunsuke Kanda, Koh Takeuchi, Keisuke Fujii +1
Massive datasets of spatial trajectories representing the mobility of a diversity of moving objects are ubiquitous in research and industry. Similarity search of a large collection…
R-enum: Enumeration of Characteristic Substrings in BWT-runs Bounded Space
Takaaki Nishimoto, Yasuo Tabei
Enumerating characteristic substrings (e.g., maximal repeats, minimal unique substrings, and minimal absent words) in a given string has been an important research topic because th…
-Bit Sketch Trie: Scalable Similarity Search on Integer Sketches
Shunsuke Kanda, Yasuo Tabei
Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping i…