This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arlazarov, V.L., E.A. Dinic, M.A. Kronrod and I.A. Faradzev. On Economic Construction of the Transitive Closure of a Directed Graph. Dokl. Akad. Nauk SSSR 194, 1970, pp.487–488 (in Russian). English translation in Soviet Math. Dokl. 11:5. pp.1209–1210.
Aho, A.V., D.S. Hirschberg and J.D. Ullman. Bounds on the Complexity of the Longest Common Subsequence Problem. J.ACM 23:1, January 1976, pp.1–12.
Aho, A.V., J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
Chvatal, V. and D. Sankoff. Longest Common Subsequences of Two Random Sequences. STAN-CS-75-477, Stanford University, Stanford, California, January 1975.
Hirschberg, D.S. A Linear Space Algorithm for Computing Maximal Common Subsequences. Comm. ACM 18:6, June 1975, pp.341–343.
Hirschberg, D.S. Algorithms for the Longest Common Subsequence Problem. J.ACM to appear.
Hirschberg, D.S. The Longest Common Subsequence Problem. PhD thesis, Princeton University, Princeton, N.J., August 1975.
Hirschberg, D.S. manuscript in preparation.
Karp, R.M. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations. R.E. Miller and J.W. Thatcher, eds., Plenum Press, New York, 1972, pp.85–103.
Lowrance, R. and R.A. Wagner. An Extension of String-to-String Correction Problem. J.ACM 22:2, April 1975, pp.177–183.
Maier, D. The Complexity of some problems on Subsequences and Supersequences. TR-219, Computer Science Laboratory, Princeton University, November 1976.
Maier, D. private communication.
Morris, J.H. and V.R. Pratt. A Linear Pattern-Matching Algorithm. TR-40, Computing Center, University of California at Berkeley, 1970.
Needleman, S.B., and C.D. Wunsch. A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. J.Mol. Biology 48, pp. 443–453.
Paterson, M.S. Unpublished manuscript. University of Warwick, England, 1974.
Sankoff, D. Matching Sequences Under Deletion/Insertion Constraints. Proc. Nat. Acad. Sci. USA 69, 1, January 1972, pp.4–6.
Szymanski, T.G. A Special Case of the Maximal Common Subsequence Problem. TR-170, Computer Sciences Laboratory, Princeton University, January 1975.
van Emde Boas, P. An O(n log log n) On-line Algorithm for the Insert-Extract Min Problem. TR 74-221, Dept. of Computer Science, Cornell Univ., Ithaca, New York, December 1974.
van Emde Boas, P. Preserving Order in a Forest in less than Logarithmic Time. Preceedings of the 16th Annual Symposium on the Foundations of Computer Science, October 1975, pp.75–84.
Wagner, R.A. On the Complexity of the Extended String-to-String Correction Problem. Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, 1975, pp. 218–223.
Wong, C.K. and A.K. Chandra. Bounds for the String Editing Problem. J. ACM 23:1, January 1976, pp. 13–16.
Weiner, P. Linear Pattern Matching Algorithms. 14th SWAT (1973), pp.1–11.
Wagner, R.A. and M.J. Fischer. The String-to-String Correction Problem. J. ACM 21:1, January 1974, pp.168–173.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirschberg, D.S. (1977). Complexity of common subsequence problems. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_107
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive