Title of article
A branch-and-cut approach to the repetition-free longest common subsequence problem
Author/Authors
Ferreira، نويسنده , , Carlos E. and Tjandraatmadja، نويسنده , , Christian، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
8
From page
527
To page
534
Abstract
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.
Keywords
Branch-and-cut , Longest common subsequence , integer programming
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455453
Link To Document