Longest common parameterized subsequences with fixed common substring

In this paper we consider the problem of the longest common parameterizedsubsequence with fixed common substring (STR-IC-LCPS). Inparticular, we show that STR-IC-LCPS is NP-complete. We describean approach to solve STR-IC-LCPS. This approach is based on anexplicit reduction from the problem to the satisfiability problem.