On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet

@article{Middendorf1995OnFM,
  title={On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet},
  author={Martin Middendorf},
  journal={Theor. Comput. Sci.},
  year={1995},
  volume={145},
  pages={317-327}
}
In this paper we investigate the complexity of finding various kinds of common superand subsequences with respect to one or two given sets of strings. We show that Longest Minimal Common Supersequence, Shortest Maximal Common Subsequence, and Shortest Maximal Common Non-Supersequence are MAX SNP-hard over a binary alphabet. Moreover, we show that Shortest Common Supersequence, Longest Common Subsequence, Longest Common Non-Supersequence, Shortest Common Non-Subsequence, and Longest Minimal… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

On the complexity of learning strings and supersequences , Theoret

  • C. B. Fraser, R. W. Irving, M. Middendorf
  • Comput . Sci .
  • 1992

Timkovsky, String Non-Inclusion Optimization Problems, submitted. V.G. Timkovsky, Complexity of common subsequence and supersequence problems and related problems, Cybernetics

  • V.G.A.R. Rubinov
  • 1990

Similar Papers

Loading similar papers…