Computing a longest common subsequence that is almost increasing on sequences having no repeated elements

Johra Muhammad Moosa, M. Sohel Rahman, Fatema Tuz Zohora. Computing a longest common subsequence that is almost increasing on sequences having no repeated elements. J. Discrete Algorithms, 20:12-20, 2013. [doi]

Abstract

Abstract is missing.