Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Tadatoshi Utashima"'
Autor:
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Publikováno v:
Algorithmica.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92ce15489b3ef2b7d768248c88cf1a46
https://doi.org/10.1007/s00453-023-01106-2
https://doi.org/10.1007/s00453-023-01106-2
Autor:
Kenya Kobayashi, Guohui Lin, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::070d027ef0b114956b3d132a512f48f0
https://doi.org/10.1007/978-3-030-96731-4_32
https://doi.org/10.1007/978-3-030-96731-4_32
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783030364113
COCOA
COCOA
In this paper, we study exact, exponential-time algorithms for a variant of the classic Longest Common Subsequence problem called the r-Repetition Longest Common Subsequence problem (or r-RLCS, for short): Given two sequences X and Y over an alphabet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::49b114d7bcc293953c07425b0bc07b9c
https://doi.org/10.1007/978-3-030-36412-0_1
https://doi.org/10.1007/978-3-030-36412-0_1