DOI,IST REx ID,Title of publication
10.1016/S0022-0000(03)00078-3,3209,On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems