The constrained longest common subsequence (CLCS) problem is to find a longest common subsequence that contains a specific subsequence.Note a CLCS may be shorter than an LCS.

• 我们考虑两个具有相同基因的基因组，而这两个基因组里的基因顺序及基因方向不完全相同。