Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Shou-Fu Lo"'
Autor:
Shou-Fu Lo, 羅守莆
106
The longest common increasing subsequences (LCIS) problem is to find out a common increasing subsequence with the maximal length of two given sequences. In this thesis, we propose an algorithm for solving the LCIS problem in O((n+L(m-L))logl
The longest common increasing subsequences (LCIS) problem is to find out a common increasing subsequence with the maximal length of two given sequences. In this thesis, we propose an algorithm for solving the LCIS problem in O((n+L(m-L))logl
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/c4377t
Publikováno v:
Theoretical Computer Science. 815:69-78
The longest common increasing subsequences (LCIS) problem is to find out a common increasing subsequence with the maximal length of two given sequences A and B. In this paper, we propose an algorithm for solving the LCIS problem with O ( ( n + L ( m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b55b9aa4e11e1d50f4d2b6a75c50dfa
https://doi.org/10.1016/j.tcs.2020.02.024
https://doi.org/10.1016/j.tcs.2020.02.024
Publikováno v:
Theoretical Computer Science. 708:75-90
Given a pair of merging sequences A, B and a target sequence T, the merged longest common subsequence (MLCS) problem is to find out the longest common subsequence (LCS) between sequences E ( A , B ) and T, where E ( A , B ) is obtained from merging t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b3309f67fdbbc81365249b7aa68fa116
https://doi.org/10.1016/j.tcs.2017.10.027
https://doi.org/10.1016/j.tcs.2017.10.027