论文信息 - The Shortest Common Nonsubsequence Problem is NP-Complete

The Shortest Common Nonsubsequence Problem is NP-Complete

Abstract The Shortest Common Nonsubsequence (SCNS) problem is: Given a finite set L of strings over an alphabet Σ and an integer k∈ N , is there a string of length ⩽ k over Σ that is not a subsequence of any string in L? The SCNS problem is shown to be NP-complete for strings over an alphabet of size ⩾ 2.

Martin Middendorf

[1] Jean-Jacques Hébrard. An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences , 1991, Theor. Comput. Sci..

[2] David Maier,et al. The Complexity of Some Problems on Subsequences and Supersequences , 1978, JACM.

[3] Esko Ukkonen,et al. The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete , 1981, Theor. Comput. Sci..

[4] V. G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems , 1989 .