1[2]Costas S.Iliopouslos,M.Sohel Rahman.New efficient algorithms for the lcs and constrained lcs problems,England,UK.Information processing letters.106(2008)13-18.
2[3]G.S.Brodal,K.Kaligosi,I.Katriel,M.Kutz,Faster algorithms for computing longest common increasing subsequences,in:M.Lewenstein,G.Valiente (Eds.),Annual Symposium on Combinatorial Pattern Matching(CPM),In:Lecture Notes in Computer Science,vol.4009,Springer,2006.330-341.
3[4]M.S.Rahman,C.S.Iliopoulos,Algorithms for computing variants of the longest common subsequence.
