| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428579 | Information Processing Letters | 2012 | 5 Pages |
Longest common subsequence is a widely used measure to compare strings, in particular in computational biology. Recently, several variants of the longest common subsequence have been introduced to tackle the comparison of genomes. In particular, the Repetition Free Longest Common Subsequence (RFLCS) problem is a variant of the LCS problem that asks for a longest common subsequence of two input strings with no repetition of symbols. In this paper, we investigate the parameterized complexity of RFLCS. First, we show that the problem does not admit a polynomial kernel. Then, we present a randomized FPT algorithm for the RFLCS problem, improving the time complexity of the existent FPT algorithm.
► We consider a variant of the longest common subsequence problem (RFLCS). ► We investigate the parameterized complexity of RFLCS. ► We show that RFLCS does not admit a polynomial kernel. ► We present a more efficient FPT algorithm for the RFLCS problem.
