Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Takuya Mieno"'
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783031270505
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cda328e566906ba85309923eb5fd943d
https://doi.org/10.1007/978-3-031-27051-2_12
https://doi.org/10.1007/978-3-031-27051-2_12
Autor:
Yuta Fujishige, Yuto Nakashima, Hideo Bannai, Masayuki Takeda, Takuya Mieno, Shunsuke Inenaga
Publikováno v:
Algorithmica. 84:670-693
A substring u of a string T is called a minimal unique substring (MUS) of T if u occurs exactly once in T and any proper substring of u occurs at least twice in T. In this paper, we study the problem of computing MUSs for a sliding window over a give
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b0d3bddfaecc200a298f95a702826315
https://doi.org/10.1007/s00453-021-00864-1
https://doi.org/10.1007/s00453-021-00864-1
Publikováno v:
Theoretical Computer Science. 845:230-242
Given a string T of length n, a substring u = T [ i . . j ] of T is called a shortest unique substring (SUS) for an interval [ s , t ] if (a) u occurs exactly once in T, (b) u contains the interval [ s , t ] (i.e. i ≤ s ≤ t ≤ j ), and (c) every
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d16630d6b1a8c9b7355aceb55535d762
https://doi.org/10.1016/j.tcs.2020.09.017
https://doi.org/10.1016/j.tcs.2020.09.017
Publikováno v:
String Processing and Information Retrieval ISBN: 9783031206429
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f784cf62785d22043a34989f2a56c22
https://doi.org/10.1007/978-3-031-20643-6_3
https://doi.org/10.1007/978-3-031-20643-6_3
Autor:
Takuya Mieno, Mitsuru Funakoshi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031066771
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::04c6c54bde2b10236b6e66cb39599186
https://doi.org/10.1007/978-3-031-06678-8_31
https://doi.org/10.1007/978-3-031-06678-8_31
Autor:
Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf5a03f3113007bbd610f3f7ce47a8fb
http://arxiv.org/abs/2105.08496
http://arxiv.org/abs/2105.08496
Autor:
Takuya Mieno, Mitsuru Funakoshi
Publikováno v:
String Processing and Information Retrieval ISBN: 9783030866914
SPIRE
SPIRE
A palindrome is a string that reads the same forward and backward. A palindromic substring w of a string T is called a minimal unique palindromic substring (MUPS) of T if w occurs only once in T and any proper palindromic substring of w occurs at lea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8039a0a4135549774223d027a4be42f
https://doi.org/10.1007/978-3-030-86692-1_4
https://doi.org/10.1007/978-3-030-86692-1_4
Autor:
Yuto Nakashima, Masayuki Takeda, Takumi Ideue, Shunsuke Inenaga, Mitsuru Funakoshi, Takuya Mieno
Publikováno v:
String Processing and Information Retrieval ISBN: 9783030866914
SPIRE
SPIRE
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:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c23c1e21f037fa33c289cb7f5e1301a
https://doi.org/10.1007/978-3-030-86692-1_10
https://doi.org/10.1007/978-3-030-86692-1_10
Publikováno v:
String Processing and Information Retrieval ISBN: 9783030592110
SPIRE
SPIRE
We revisit the so-called “Three Squares Lemma” by Crochemore and Rytter [Algorithmica 1995] and, using arguments based on Lyndon words, derive a more general variant which considers three overlapping squares which do not necessarily share a commo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d31a7b99957d801b850d0f5db5de1f07
https://doi.org/10.1007/978-3-030-59212-7_19
https://doi.org/10.1007/978-3-030-59212-7_19
Autor:
Yuta Fujishige, Yuki Kuhara, Hideo Bannai, Yuto Nakashima, Tooru Akagi, Shunsuke Inenaga, Masayuki Takeda, Takuya Mieno
Publikováno v:
SOFSEM 2020: Theory and Practice of Computer Science ISBN: 9783030389185
SOFSEM
SOFSEM
A substring u of a string T is called a minimal unique substring (MUS) of T if u occurs exactly once in T and any proper substring of u occurs at least twice in T. A string w is called a minimal absent word (MAW) of T if w does not occur in T and any
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f61e8e80a64583833c7c476101a0cc2
https://doi.org/10.1007/978-3-030-38919-2_13
https://doi.org/10.1007/978-3-030-38919-2_13