Maximal Common Subsequences and Minimal Common Supersequences

Information and Computation

Volumn 124, Issue 2, 1996, Pages 145-153

  Fraser, Campbell B ^a   Irving, Robert W ^a   Middendorf, Martin ^b  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043066376     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0011     Document Type: Article

References (16)

1. Apostolico, A. and Guerra, C. (1987), The longest common subsequence problem revisited, Algorithmica 2, 315-336.
2. Garey, M. R. and Johnson, D. S. (1979), "Computers and Intractability," Freeman, San Francisco.
3. Halldórsson, M. M. (1993), Approximating the minimum maximal independence number, Inform. Process. Lett. 46, 169-172.
4. Hirschberg, D. S. (1975), A linear space algorithm for computing maximal common subsequences, Comm. ACM 18, 341-343.
5. Hirschberg, D. S. (1977), Algorithms for the longest common subsequence problem, J. Assoc. Comput. Mach. 24, 664-675.
6. Hunt, J. W. and Szymanski, T. G. (1977), A fast algorithm for computing longest common subsequences, Comm. ACM 20, 350-353.
7. Irving, R. W. (1991), On approximating the minimum independent dominating set, Inform. Process. Lett. 37, 197-200.
8. Jiang, T. and Li, M. (1994), On the approximation of shortest common supersequences and longest common subsequences, in "Proceedings of the 21st International Colloquium on Automata, Languages and Programming, Jerusalem 1994." Springer-Verlag LNCS, Vol. 820, pp. 191-202.
9. Maier, D. (1978), The complexity of some problems on subsequences and supersequences, J. Assoc. Comput. Mach. 25, 322-336.
10. Middendorf, M. (1992), "Zur Komplexität von Einbettungsproblemen für Wortmengen," Ph.D. Thesis, Fachbereich Mathematik, Universität Hannover.
11. Papadimitriou, C. H. and Yannakakis, M. (1991), Optimization, approximation, and complexity classes, J. Comput. System Sci. 43, 425-440.
12. Räihä, K.J., and Ukkonen, E. (1981), The shortest common supersequence problem over binary alphabet is NP-complete, Theoret. Comp. Sci. 16, 187-198.
13. Timkovskii, V. G. (1989), Complexity of common subsequence and supersequence problems and related problems, English translation from Kibernetika 5, 1-13.
14. Ukkonen, E. (1985), Algorithms for approximate string matching, Inform. and Control 64, 100-118.
15. Wu, S., Manber, U., Myers, G., and Miller, W. (1990), An O(NP) sequence comparison algorithm, Inform. Process. Lett. 35, 317-323.
16. Yannakakis, M. and Gavril, F. (1980), Edge dominating sets in graphs, SIAM J. Appl. Math. 38, 364-372.