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]

Authors

Johra Muhammad Moosa

This author has not been identified. Look up 'Johra Muhammad Moosa' in Google

M. Sohel Rahman

This author has not been identified. Look up 'M. Sohel Rahman' in Google

Fatema Tuz Zohora

This author has not been identified. Look up 'Fatema Tuz Zohora' in Google