1 citations · 1 across the 5 of their papers we have counts for
11 papers
Computing palindromes on a trie in linear time
Takuya Mieno, Mitsuru Funakoshi, Shunsuke Inenaga
A trie is a rooted tree such that each edge is labeled by a single character from the alphabet, and the labels of out-going edges from the same node are mutually dist…
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-…
RePair Grammars are the Smallest Grammars for Fibonacci Words
Takuya Mieno, Shunsuke Inenaga, Takashi Horiyama
Grammar-based compression is a loss-less data compression scheme that represents a given string by a context-free grammar that generates only . While computing the smallest…
Cartesian Tree Subsequence Matching
Tsubasa Oizumi, Takeshi Kai, Takuya Mieno +2
Park et al. [TCS 2020] observed that the similarity between two (numerical) strings can be captured by the Cartesian trees: The Cartesian tree of a string is a binary tree recursiv…
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…
Minimal unique palindromic substrings after single-character substitution
Mitsuru Funakoshi, Takuya Mieno
A palindrome is a string that reads the same forward and backward. A palindromic substring of a string is called a minimal unique palindromic substring (MUPS) of if …