Let $\Sigma$ be an alphabet. For two strings $X$, $Y$, and a constrained string $P$ over the alphabet $\Sigma$, the constrained longest common subsequence and substring problem for two strings $X$ and $Y$ with respect to $P$ is to find a longest string $Z$ which is a subsequence of $X$, a substring of $Y$, and has $P$ as a subsequence. In this paper, we propose an algorithm for the constrained longest common subsequence and substring problem for two strings with a constrained string.

翻译：设 $\Sigma$ 为一个字母表。对于两个字符串 $X$、$Y$ 以及字母表 $\Sigma$ 上的约束字符串 $P$，两个字符串 $X$ 和 $Y$ 关于 $P$ 的受限最长公共子序列与子串问题是寻找一个最长的字符串 $Z$，使得 $Z$ 是 $X$ 的子序列、$Y$ 的子串，并且包含 $P$ 作为子序列。本文针对带约束字符串的两字符串受限最长公共子序列与子串问题提出一种算法。