|
On multiple occurrences shortest common superstring problemKeywords: multiple occurrences shortest common superstring problem , satisfiability problem , NP-complete Abstract: 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.
|