Efficient merged longest common subsequence algorithms for similar sequences. - Kuo-Tsung Tseng; De-Sheng Chan; Chang-Biau Yang; Shou-Fu Lo (Theor. Comput. Sci., 2018)

A diagonal-based algorithm for the longest common increasing subsequence problem. - Shou-Fu Lo; Kuo-Tsung Tseng; Chang-Biau Yang; Kuo-Si Huang (Theor. Comput. Sci., 2020)