An efficient algorithm for enumerating longest common increasing subsequences

DOI10.1007/978-3-030-89543-3_3OpenAlexW3208750826MaRDI QIDQ2695270

Qun Lin, Chao-Yuan Huang, Ming-Jer Tsai

Publication date: 30 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89543-3_3

zbMATH Keywords

triedata structureLCIS

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Faster algorithms for computing longest common increasing subsequences
• A fast algorithm for computing a longest common increasing subsequence
• A linear space algorithm for computing a longest common increasing subsequence
• Efficient algorithms for finding a longest common increasing subsequence
• A diagonal-based algorithm for the longest common increasing subsequence problem

This page was built for publication: An efficient algorithm for enumerating longest common increasing subsequences