Zobrazeno 1 - 10
of 1 775
pro vyhledávání: '"TAKEDA, Masayuki"'
The directed acyclic word graph (DAWG) of a string $y$ of length $n$ is the smallest (partial) DFA which recognizes all suffixes of $y$ with only $O(n)$ nodes and edges. In this paper, we show how to construct the DAWG for the input string $y$ from t
Externí odkaz:
http://arxiv.org/abs/2307.01428
Autor:
Funakoshi, Mitsuru, Mieno, Takuya, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki
Palindromes are popular and important objects in textual data processing, bioinformatics, and combinatorics on words. Let $S = XaY$ be a string, where $X$ and $Y$ are of the same length and $a$ is either a single character or the empty string. Then,
Externí odkaz:
http://arxiv.org/abs/2210.02067
Autor:
Kanemura, Hiroaki, Yokoyama, Toshihide, Nakajima, Ryu, Nakamura, Atsushi, Kuroda, Hiroaki, Kitamura, Yoshitaka, Shoda, Hiroyasu, Mamesaya, Nobuaki, Miyata, Yoshihiro, Okamoto, Tatsuro, Okishio, Kyoichi, Oki, Masahide, Sakairi, Yuichi, Chen-Yoshikawa, Toyofumi Fengshi, Aoki, Tadashi, Ohira, Tatsuo, Matsumoto, Isao, Ueno, Kiyonobu, Miyazaki, Takuro, Matsuguma, Haruhisa, Yokouchi, Hideoki, Otani, Tomoyuki, Ito, Akihiko, Sakai, Kazuko, Chiba, Yasutaka, Nishio, Kazuto, Yamamoto, Nobuyuki, Okamoto, Isamu, Nakagawa, Kazuhiko, Takeda, Masayuki
Publikováno v:
In JTO Clinical and Research Reports April 2024 5(4)
Autor:
Ideue, Takumi, Mieno, Takuya, Funakoshi, Mitsuru, Nakashima, Yuto, Inenaga, Shunsuke, Takeda, Masayuki
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 (Kreft & Navarro, TCS 2013). One of the interests for LZ-End factorizations
Externí odkaz:
http://arxiv.org/abs/2106.01173
Counting substrings/subsequences that preserve some property (e.g., palindromes, squares) is an important mathematical interest in stringology. Recently, Glen et al. studied the number of Lyndon factors in a string. A string $w = uv$ is called a Lynd
Externí odkaz:
http://arxiv.org/abs/2106.01190
Autor:
Akagi, Tooru, Köppl, Dominik, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki
Pattern matching is the most central task for text indices. Most recent indices leverage compression techniques to make pattern matching feasible for massive but highly-compressible datasets. Within this kind of indices, we propose a new compressed t
Externí odkaz:
http://arxiv.org/abs/2105.13744
Autor:
Akagi, Tooru, Kuhara, Yuki, Mieno, Takuya, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki
A string $w$ is called a minimal absent word (MAW) for another string $T$ if $w$ does not occur in $T$ but the proper substrings of $w$ occur in $T$. For example, let $\Sigma = \{\mathtt{a, b, c}\}$ be the alphabet. Then, the set of MAWs for string $
Externí odkaz:
http://arxiv.org/abs/2105.08496
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) problem in the setting where the two parties have their strings in a
Externí odkaz:
http://arxiv.org/abs/2103.03468
Let $\Sigma$ and $\Pi$ be disjoint alphabets, respectively called the static alphabet and the parameterized alphabet. Two strings $x$ and $y$ over $\Sigma \cup \Pi$ of equal length are said to parameterized match (p-match) if there exists a renaming
Externí odkaz:
http://arxiv.org/abs/2012.10092
Autor:
Mieno, Takuya, Watanabe, Kiichi, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki
The palindromic tree (a.k.a. eertree) for a string $S$ of length $n$ is a tree-like data structure that represents the set of all distinct palindromic substrings of $S$, using $O(n)$ space [Rubinchik and Shur, 2018]. It is known that, when $S$ is ove
Externí odkaz:
http://arxiv.org/abs/2006.02134