The Complexity of Some Problems on Subsequences and Supersequences

The complexity of finding the Longest Common Subsequence (LCS) and the Shortest Common Supersequence (SCS) of an arbRrary number of sequences IS considered We show that the yes/no version of the LCS problem is NP-complete for sequences over an alphabet of size 2, and that the yes/no SCS problem is NPcomplete for sequences over an alphabet of size 5

[1]  Chak-Kuen Wong,et al.  Bounds for the String Editing Problem , 1976, JACM.

[2]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[3]  Daniel S. Hirschberg,et al.  A linear space algorithm for computing maximal common subsequences , 1975, Commun. ACM.

[4]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[5]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  Robert A. Wagner,et al.  An Extension of the String-to-String Correction Problem , 1975, JACM.

[8]  M O Dayhoff.  Computer aids to protein sequence determination. , 1965, Journal of theoretical biology.

[9]  D Sankoff,et al.  A test for nucleotide sequence homology. , 1973, Journal of molecular biology.

[10]  M. O. Dayhoff.  Computer analysis of protein evolution. , 1969, Scientific American.

[11]  M. Fischer,et al.  STRING-MATCHING AND OTHER PRODUCTS , 1974 .

[12]  Christus,et al.  A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins , 2022 .

[13]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[14]  D Sankoff,et al.  Matching sequences under deletion-insertion constraints. , 1972, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Michael L. Fredman,et al.  On computing the length of longest increasing subsequences , 1975, Discret. Math..

[16]  Peter H. Sellers,et al.  An Algorithm for the Distance Between Two Finite Sequences , 1974, J. Comb. Theory, Ser. A.

[17]  Daniel S. Hirschberg,et al.  The longest common subsequence problem. , 1975 .

[18]  D. Knuth,et al.  Selected combinatorial research problems. , 1972 .

[19]  Alfred V. Aho,et al.  Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.

[20]  Robert A. Wagner.  On the complexity of the Extended String-to-String Correction Problem , 1975, STOC '75.