[HTML][HTML] Efficient merged longest common subsequence algorithms for similar sequences
KT Tseng, DS Chan, CB Yang, SF Lo - Theoretical Computer Science, 2018 - Elsevier
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 …
common subsequence (MLCS) problem is to find out the longest common subsequence …
[HTML][HTML] A diagonal-based algorithm for the longest common increasing subsequence problem
SF Lo, KT Tseng, CB Yang, KS Huang - Theoretical Computer Science, 2020 - Elsevier
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 …
increasing subsequence with the maximal length of two given sequences A and B. In this …