%0 Journal Article
%T Longest common parameterized subsequences with fixed common substring
%A A. Gorbenko
%A V. Popov
%J Applied Mathematical Sciences
%D 2013
%I 
%X 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.
%K parameterized pattern matching
%K satisfiability
%K NP-complete
%U http://www.m-hikari.com/ams/ams-2013/ams-13-16-2013/popovAMS13-16-2013-5.pdf