Abstract
The problems of finding a longest common subsequence and a shortest common supersequence of a set of strings are well-known. They can be solved in polynomial time for two strings (in fact the problems are dual in this case), or for any fixed number of strings, by dynamic programming. But both problems are NP-hard in general for an arbitrary number k of strings. Here we study the related problems of finding a minimum-length maximal common subsequence and a maximum-length minimal common supersequence. We describe dynamic programming algorithms for the case of two strings (for which case the problems are no longer dual), which can be extended to any fixed number of strings. We also show that the minimum maximal common subsequence problem is NP-hard in general for k strings, and we prove a strong negative approximability result for this problem. The complexity of the maximum minimal common supersequence problem for general k remains open, though we conjecture that it too is NP-hard.
Supported by a postgraduate research studentship from the Science and Engineering Research Council.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico and C. Guerra. The longest common subsequence problem revisited. Algorithmica, 2:315–336, 1987.
S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proc. 33rd IEEE Symp. Found. Comp. Sci., pages 14–23, 1992.
M.R. Garey and D.S. Johnson. Computers and Intractability. Freeman, San Francisco, CA., 1979.
M.M. Halldórsson. Approximating the minimum maximal independence number. Information Processing Letters, 46:169–172, 1993.
D.S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Communications of the A.C.M., 18:341–343, 1975.
D.S. Hirschberg. Algorithms for the longest common subsequence problem. Journal of the A.C.M., 24:664–675, 1977.
J.W. Hunt and T.G. Szymanski. A fast algorithm for computing longest common subsequences. Communications of the A.C.M., 20:350–353, 1977.
R.W. Irving. On approximating the minimum independent dominating set. Information Processing Letters, 37:197–200, 1991.
T. Jiang and M. Li. On the approximation of shortest common supersequences and longest common subsequences. Submitted for publication, 1992.
D. Maier. The complexity of some problems on subsequences and supersequences. Journal of the A.C.M., 25:322–336, 1978.
C.H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425–440, 1991.
K-J. Raiha and E. Ukkonen. The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science, 16:187–198, 1981.
V.G. Timkovskii. Complexity of common subsequence and supersequence problems and related problems. English Translation from Kibernetika, 5:1–13, 1989.
E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100–118, 1985.
S. Wu, U. Manber, G. Myers, and W. Miller. An O(NP) sequence comparison algorithm. Information Processing Letters, 35:317–323, 1990.
M. Yannakakis and F. Gavril. Edge dominating sets in graphs. SIAM J. Appl. Math., 38:364–372, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Irving, R.W., Fraser, C.B. (1994). Maximal common subsequences and minimal common supersequences. In: Crochemore, M., Gusfield, D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58094-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-58094-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58094-2
Online ISBN: 978-3-540-48450-9
eBook Packages: Springer Book Archive