A diagonal-based algorithm for the longest common increasing subsequence problem

From MaRDI portal
Publication:2310745

DOI10.1016/j.tcs.2020.02.024zbMath1433.68634OpenAlexW3008749970MaRDI QIDQ2310745

Kuo-Tsung Tseng, Kuo-Si Huang, Chang-Biau Yang, Shou-Fu Lo

Publication date: 6 April 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.02.024




Related Items (2)


Uses Software


Cites Work


This page was built for publication: A diagonal-based algorithm for the longest common increasing subsequence problem