We investigate four variants of the longest common subsequence problem. Given two
sequences X, Y and a constrained pattern P of lengths m, n, and ρ, respectively, the …

Given strings S1, S2, and P, the constrained longest common subsequence problem for S1
and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 which …

In this paper, we study the classic and well-studied longest common subsequence (LCS)
problem and a recent variant of it, namely the constrained LCS (CLCS) problem. In the …

In this paper, we generalize the inclusion constrained longest common subsequence
(CLCS) problem to the hybrid CLCS problem which is the combination of the sequence …

The problem of finding the longest common subsequence (LCS) of two given strings A 1 and
A 2 is a well-studied problem. The constrained longest common subsequence (C-LCS) for …

We propose efficient algorithms for enumerating maximal common subsequences (MCSs) of
two strings. Efficiency of the algorithms are estimated by the preprocessing-time, space, and …

Abstract The Longest Common Subsequence (LCS) of two or more strings is a fundamental
well-studied problem which has a wide range of applications throughout computational …

The 2-LCPS problem, first introduced by Chowdhury et al.(2014)[17], asks one to compute
(the length of) a longest common palindromic subsequence between two given strings A …

A common subsequence of two strings is maximal if inserting any character into it no longer
yields a common subsequence. The present article proposes a (sub) linearithmic-time …

We consider a variant of the classical Longest Common Subsequence problem called
Doubly-Constrained Longest Common Subsequence (DC-LCS). Given two strings s1 and …