Zobrazeno 1 - 2
of 2
pro vyhledávání: '"De-Sheng Chan"'
Autor:
De-Sheng Chan, 詹德勝
104
Given a pair of merging sequences A and B and a target sequence T, the merged longest common subsequence (MLCS) problem is to find out a longest common subsequence (LCS) between sequences E(A, B) and T, where E(A, B) is obtained from merging
Given a pair of merging sequences A and B and a target sequence T, the merged longest common subsequence (MLCS) problem is to find out a longest common subsequence (LCS) between sequences E(A, B) and T, where E(A, B) is obtained from merging
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/24037039819259156519
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
