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]
@article{MoosaRZ13,
title = {Computing a longest common subsequence that is almost increasing on sequences having no repeated elements},
author = {Johra Muhammad Moosa and M. Sohel Rahman and Fatema Tuz Zohora},
year = {2013},
doi = {10.1016/j.jda.2012.12.005},
url = {http://dx.doi.org/10.1016/j.jda.2012.12.005},
researchr = {https://researchr.org/publication/MoosaRZ13},
cites = {0},
citedby = {0},
journal = {J. Discrete Algorithms},
volume = {20},
pages = {12-20},
}