Advertisement
Published in:
2007 | OriginalPaper | Chapter
Algorithms for Computing the Longest Parameterized Common Subsequence
Authors : Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Waleń
Published in: Combinatorial Pattern Matching
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
(
n
2
) and
time. Furthermore, we show how to compute two variants of LCS, RELAG and RIFIG in
time.