Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Narisawa, Kazuyuki"'
We propose a new indexing structure for parameterized strings, called parameterized position heap. Parameterized position heap is applicable for parameterized pattern matching problem, where the pattern matches a substring of the text if there exists
Externí odkaz:
http://arxiv.org/abs/1702.02321
Autor:
Ueki, Yohei, Diptarama, Kurihara, Masatoshi, Matsuoka, Yoshiaki, Narisawa, Kazuyuki, Yoshinaka, Ryo, Bannai, Hideo, Inenaga, Shunsuke, Shinohara, Ayumi
We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least $k$ length substrings. First, we show an $O(mn)$ time algorithm for the problem which gives a better worst-ca
Externí odkaz:
http://arxiv.org/abs/1609.03668
Autor:
Narisada, Shintaro, Hendrian, Diptarama, Narisawa, Kazuyuki, Inenaga, Shunsuke, Shinohara, Ayumi
Publikováno v:
Theoretical Computer Science, 2019
In this paper, we introduce new types of approximate palindromes called single-arm-gapped palindromes (shortly SAGPs). A SAGP contains a gap in either its left or right arm, which is in the form of either $wguc u^R w^R$ or $wuc u^Rgw^R$, where $w$ an
Externí odkaz:
http://arxiv.org/abs/1609.03000
Autor:
I, Tomohiro, Matsubara, Wataru, Shimohira, Kouji, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki, Narisawa, Kazuyuki, Shinohara, Ayumi
We solve the problems of detecting and counting various forms of regularities in a string represented as a Straight Line Program (SLP). Given an SLP of size $n$ that represents a string $s$ of length $N$, our algorithm compute all runs and squares in
Externí odkaz:
http://arxiv.org/abs/1304.7067
Autor:
I, Tomohiro, Matsubara, Wataru, Shimohira, Kouji, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki, Narisawa, Kazuyuki, Shinohara, Ayumi
Publikováno v:
In Information and Computation February 2015 240:74-89
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Interdisciplinary Information Sciences. 21(1):37-47
Special Section: Nowcast and Forecast of Road Traffic by Data Fusion of Various Sensing Data
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=jairo_______::2c7ba4cd11c87439c5e85bc757c3c52b
http://hdl.handle.net/10097/00065042
http://hdl.handle.net/10097/00065042
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
SOFSEM 2017: Theory & Practice of Computer Science; 2017, p375-386, 12p
Autor:
Ueki, Yohei, Diptarama, Kurihara, Masatoshi, Matsuoka, Yoshiaki, Narisawa, Kazuyuki, Yoshinaka, Ryo, Bannai, Hideo, Inenaga, Shunsuke, Shinohara, Ayumi
Publikováno v:
SOFSEM 2017: Theory & Practice of Computer Science; 2017, p363-374, 12p