%0 Journal Article
%T Common Permutation Problem
%A Mari¨¢n Dvorsky
%J Computer Science
%D 2008
%I arXiv
%X In this paper we show that the following problem is NP-complete: Given an alphabet $\Sigma$ and two strings over $\Sigma$, the question is whether there exists a permutation of $\Sigma$ which is a subsequence of both of the given strings.
%U http://arxiv.org/abs/0803.4261v1