_id,doi,title
3209,10.1016/S0022-0000(03)00078-3,On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems