The shortest common parameterized supersequence problem

Abstract

In this paper, we consider the problem of the shortest common parameterized supersequence. In particular, we consider an explicit reduction from the problem to the satisfiability problem. Keywords: parameterized supersequence, satisfiability, NP-completeThe well-known problem of the shortest common supersequence (SCS) is a classical distance measure for strings. Another well-studied string comparison measure is that of parameterized matching, where two equal-length strings are a parameterized-match if there exists a bijection on the alphabets such that one string matches the other under the bijection (see e.g. [1,2]). For instance, it is considered the periodicity of parameterized strings. These results and some other studies about the periodicity of parameterized strings showed considerable differences between parameterized strings and ordinary strings.