Sciweavers

CPM
2007
Springer
185views Combinatorics» more  CPM 2007»
14 years 5 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 ...
Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahm...