A branch-and-cut approach to the repetition-free longest common subsequence problem

We present a branch-and-cut approach to solve the following problem. Given two sequences x and y over a finite alphabet, find a repetition-free longest common subsequence of x and y. Implementation details of an efficient separation routine and several heuristics are described. We can solve medium size instances of the problem to optimality.