On the approximation of finding various minimal, maximal, and consistent sequences
In this paper we investigate the complexity of finding various kinds of common super- and subsequences with respect to one or two given sets of strings. We show how these problems can be related to finding sequences having a fixed character composition. This leads to a unified approach for characterizing the complexity of such problems. Moreover, we derive interesting results on the approximability of problems which are dual to the well known Shortest Common Supersequence and Longest Common Subsequence problems.
KeywordsPolynomial Time Approximation Scheme Longe Common Subsequence Consistent Sequence Longe Common Subsequence Binary Alphabet
Unable to display preview. Download preview PDF.
- 1.S. Arora, C. Lund, R. Motwani, R. Sundan, M. Szegedy, Proof verification and hardness of approximation problems, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science (1992) 14–23.Google Scholar
- 5.C. Papadimitriou, M. Yannakakis, Optimization, Approximation and Complexity Classes, 20th ACM Symp. on Theory of Computing, (1988) 229–234.Google Scholar
- 7.K.-J. Räihä, E. Ukkonen, The shortest common supersequence problem over binary alphabet is NP-complete. Theoret. Comput. Sci. 16 (1981) 187–198.Google Scholar
- 8.V. G. Timkovsky, Complexity of common subsequence and supersequence problems and related problems, Cybernetics 25 (1990), 565–580.Google Scholar
- 9.L.G. Valiant, A theory of the learnable. Comm. ACM. 27 (1984) 1134–1142.Google Scholar
- 10.L. Zhang, The Approximation of Longest Common Non-Supersequences and Shortest Common Non-Subsequences is Hard, submitted for publication.Google Scholar