Sciweavers

Share
CPM
2007
Springer

Algorithms for Computing the Longest Parameterized Common Subsequence

10 years 10 months ago
Algorithms for Computing the Longest Parameterized Common Subsequence
In this paper, we revisit the classic and well-studied longest common subsequence (LCS) problem and study some new variants, first introduced and studied by Rahman and Iliopoulos [Algorithms for Computing Variants of the Longest Common Subsequence Problem, ISAAC 2006]. Here we define a generalization of these variants, the longest parameterized common subsequence (LPCS) problem, and show how to solve it in O(n2 ) and O(n + R log n) time. Furthermore, we show how to compute two variants of LCS, RELAG and RIFIG in O(n + R) time.
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where CPM
Authors Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
Comments (0)
books