3 citations · 4 across the 15 of their papers we have counts for
26 papers
Minimal Absent Words on Run-Length Encoded Strings
Tooru Akagi, Kouta Okabe, Takuya Mieno +2
A string is called a minimal absent word (MAW) for another string if does not occur (as a substring) in and any proper substring of occurs in . State-of-the-…
Counting Lyndon Subsequences
Ryo Hirakawa, Yuto Nakashima, Shunsuke Inenaga +1
Counting substrings/subsequences that preserve some property (e.g., palindromes, squares) is an important mathematical interest in stringology. Recently, Glen et al. studied the nu…
Position Heaps for Cartesian-tree Matching on Strings and Tries
Akio Nishimoto, Noriki Fujisato, Yuto Nakashima +1
The Cartesian-tree pattern matching is a recently introduced scheme of pattern matching that detects fragments in a sequential data stream which have a similar structure as a query…
On the approximation ratio of LZ-End to LZ77
Takumi Ideue, Takuya Mieno, Mitsuru Funakoshi +3
A family of Lempel-Ziv factorizations is a well-studied string structure. The LZ-End factorization is a member of the family that achieved faster extraction of any substrings (Kref…
Compressed Communication Complexity of Hamming Distance
Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga +2
We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP…
The Parameterized Suffix Tray
Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga +2
Let and be disjoint alphabets, respectively called the static alphabet and the parameterized alphabet. Two strings and over of equal length are said to pa…