The Complexity of Some Problems on Subsequences and Supersequences

@article{Maier1978TheCO,
  title={The Complexity of Some Problems on Subsequences and Supersequences},
  author={David Maier},
  journal={J. ACM},
  year={1978},
  volume={25},
  pages={322-336}
}
  • D. Maier
  • Published 1 April 1978
  • Computer Science
  • J. ACM
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 

Figures from this paper

Complexity of common subsequence and supersequence problems and related problems
The article examines polynomial-time and intractable longest common subsequence and subword problems and shortest common supersequence and superword problems, both old and new. The results provide a
A linear space algorithm for the LCS problem
TLDR
This paper presents a new linear-space algorithm, based on the divide and conquer technique, that has runtime complexity O(n(m-p), where p is the length of the LCS.
Solving the Shortest Common Supersequence Problem
TLDR
The SCS problem is reduced to a shortest path problem on a digraph and suitably use algorithm A *.
Finite automata based algorithms on subsequences and supersequences of degenerate strings
The Shortest Common Nonsubsequence Problem is NP-Complete
  • M. Middendorf
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1993
Algorithms for Computing Variants of the Longest Common Subsequence Problem
TLDR
New variants are defined, introducing the notion of gap-constraints in LCS problem and efficient algorithms to solve them are presented.
On the Approximation of Finding Various Minimal, Maximal, and Consistent Sequences
TLDR
It is shown how these problems can be related to finding sequences having a fixed character composition and derived interesting results on the approximability of problems which are dual to the well known Shortest Common Supersequence and Longest Common Subsequence problems.
...
...

References

SHOWING 1-10 OF 41 REFERENCES
On computing the length of longest increasing subsequences
  • M. Fredman
  • Computer Science, Mathematics
    Discret. Math.
  • 1975
Bounds on the Complexity of the Longest Common Subsequence Problem
TLDR
It is shown that unless a bound on the total number of distinct symbols is assumed, every solution to the problem can consume an amount of time that is proportional to the product of the lengths of the two strings.
A linear space algorithm for computing maximal common subsequences
The problem of finding a longest common subsequence of two strings has been solved in quadratic time and space. An algorithm is presented which will solve this problem in quadratic time and in linear
STRING-MATCHING AND OTHER PRODUCTS
TLDR
By exploiting the formal similarity of string-matching with integer multiplication, a new algorithm has been obtained with a running time which is only slightly worse than linear.
Matching sequences under deletion-insertion constraints.
  • D. Sankoff
  • Biology
    Proceedings of the National Academy of Sciences of the United States of America
  • 1972
TLDR
An economical algorithm is elaborated for finding subsequences satisfying deletion/insertion constraints and is useful in the study of genetic homology based on nucleotide or amino-acid sequences.
Bounds for the String Editing Problem
TLDR
It is shown that if the operations on symbols of the strings are restricted to tests of equality, then O(nm) operations are necessary (and sufficient) to compute the distance between two strings.
Linear Pattern Matching Algorithms
TLDR
A linear time algorithm for obtaining a compacted version of a bi-tree associated with a given string is presented and indicated how to solve several pattern matching problems, including some from [4] in linear time.
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
    STOC
  • 1971
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a
The Design and Analysis of Computer Algorithms
TLDR
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
An Algorithm for the Distance Between Two Finite Sequences
  • P. Sellers
  • Computer Science
    J. Comb. Theory, Ser. A
  • 1974
...
...