Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Bi-Shiang Lin"'
Autor:
Bi-Shiang Lin, 林必祥
106
Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS) between A and each suffix of B. The data structure for the consecutive suffix alignment
Given two sequences A and B of lengths m and n, respectively, the consecutive suffix alignment problem is to compute the longest common subsequence (LCS) between A and each suffix of B. The data structure for the consecutive suffix alignment
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/3t4sv9
Publikováno v:
Theoretical Computer Science. :113944
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e73568e420ab813d2a405df921731cea
https://doi.org/10.1016/j.tcs.2023.113944
https://doi.org/10.1016/j.tcs.2023.113944
Publikováno v:
SSRN Electronic Journal.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0f17a684036c1ceadba740645455ba7e
https://doi.org/10.2139/ssrn.4178085
https://doi.org/10.2139/ssrn.4178085