On the parameterized complexity of the repetition free longest common subsequence problem