I. Tomohiro

activity

20132023

most citedThe "Runs" Theorem

106 citations · 150 across the 16 of their papers we have counts for

collaborators

22 papers

cs.DS2023

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching

Kento Iseri, Tomohiro I, Diptarama Hendrian +3

A parameterized string (p-string) is a string over an alphabet $(Σ_{s} \cup Σ_{p})$ , where $Σ_{s}$ and $Σ_{p}$ are disjoint alphabets for static symbols (s-symbols) and for paramet…

cs.DS2022

PalFM-index: FM-index for Palindrome Pattern Matching

Shinya Nagashita, Tomohiro I

The palindrome pattern matching (pal-matching) is a kind of generalized pattern matching, in which two strings $x$ and $y$ of same length are considered to match (pal-match) if the…

cs.DS2022

Substring Complexities on Run-length Compressed Strings

Akiyoshi Kawamoto, Tomohiro I

Let $S_{T} (k)$ denote the set of distinct substrings of length $k$ in a string $T$ , then the $k$ -th substring complexity is defined by its cardinality $∣ S_{T} (k) ∣$ . Recently, $δ= \…

cs.DS2022★ 1 cited

Longest (Sub-)Periodic Subsequence

Hideo Bannai, Tomohiro I, Dominik Köppl

We present an algorithm computing the longest periodic subsequence of a string of length $n$ in $O (n^{7})$ time with $O (n^{4})$ words of space. We obtain improvements when restricting…

cs.DS2022

Computing Longest (Common) Lyndon Subsequences

Hideo Bannai, Tomohiro I, Tomasz Kociumaka +2

Given a string $T$ with length $n$ whose characters are drawn from an ordered alphabet of size $σ$ , its longest Lyndon subsequence is a longest subsequence of $T$ that is a Lyndon…

cs.DS2021★ 1 cited

Load-Balancing Succinct B Trees

Tomohiro I, Dominik Köppl

We propose a B tree representation storing $n$ keys, each of $k$ bits, in either (a) $nk + O (nk / l g n)$ bits or (b) $nk + O (nk l g l g n / l g n)$ bits of space supporting all B t…