Repetition-free longest common subsequence

We study the following problem. Given two sequences xx and yy over a finite alphabet, find a repetition-free longest common subsequence of xx and yy. We show several algorithmic results, a computational complexity result, and we describe a preliminary experimental study based on the proposed algorithms. We also show that this problem is APX-hard.