%0 Journal Article
%T On multiple occurrences shortest common superstring problem
%A A. Gorbenko
%A V. Popov
%J Applied Mathematical Sciences
%D 2013
%I 
%X In this paper, we consider multiple occurrences shortest commonsuperstring problem. In particular, we consider an approach to solvethe problem. This approach is based on an explicit reduction from theproblem to the satisfiability problem.
%K multiple occurrences shortest common superstring problem
%K satisfiability problem
%K NP-complete
%U http://www.m-hikari.com/ams/ams-2013/ams-13-16-2013/popovAMS13-16-2013-4.pdf