# Complexity of common subsequence problems

Section C Computability, Decidability & Arithmetic Complexity

First Online:

## Keywords

Input String Quadratic Time Longe Common Subsequence Alphabet Size Longe Common Subsequence
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- ADKF.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.Google Scholar
- AHiu.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.Google Scholar
- AHoU.Aho, A.V., J.E. Hopcroft and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.Google Scholar
- CS.Chvatal, V. and D. Sankoff. Longest Common Subsequences of Two Random Sequences. STAN-CS-75-477, Stanford University, Stanford, California, January 1975.Google Scholar
- H1.Hirschberg, D.S. A Linear Space Algorithm for Computing Maximal Common Subsequences. Comm. ACM 18:6, June 1975, pp.341–343.Google Scholar
- H2.Hirschberg, D.S. Algorithms for the Longest Common Subsequence Problem. J.ACM to appear.Google Scholar
- H3.Hirschberg, D.S. The Longest Common Subsequence Problem. PhD thesis, Princeton University, Princeton, N.J., August 1975.Google Scholar
- H4.Hirschberg, D.S. manuscript in preparation.Google Scholar
- Ka.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.Google Scholar
- LW.Lowrance, R. and R.A. Wagner. An Extension of String-to-String Correction Problem. J.ACM 22:2, April 1975, pp.177–183.Google Scholar
- M1.Maier, D. The Complexity of some problems on Subsequences and Supersequences. TR-219, Computer Science Laboratory, Princeton University, November 1976.Google Scholar
- M2.Maier, D. private communication.Google Scholar
- MP.Morris, J.H. and V.R. Pratt. A Linear Pattern-Matching Algorithm. TR-40, Computing Center, University of California at Berkeley, 1970.Google Scholar
- NW.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.Google Scholar
- Pa.Paterson, M.S. Unpublished manuscript. University of Warwick, England, 1974.Google Scholar
- Sa.Sankoff, D. Matching Sequences Under Deletion/Insertion Constraints. Proc. Nat. Acad. Sci. USA 69, 1, January 1972, pp.4–6.Google Scholar
- Sz.Szymanski, T.G. A Special Case of the Maximal Common Subsequence Problem. TR-170, Computer Sciences Laboratory, Princeton University, January 1975.Google Scholar
- vEB.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.Google Scholar
- vEB2.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.Google Scholar
- Wa.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.Google Scholar
- WC.Wong, C.K. and A.K. Chandra. Bounds for the String Editing Problem. J. ACM 23:1, January 1976, pp. 13–16.Google Scholar
- We.Weiner, P. Linear Pattern Matching Algorithms. 14th SWAT (1973), pp.1–11.Google Scholar
- WF.Wagner, R.A. and M.J. Fischer. The String-to-String Correction Problem. J. ACM 21:1, January 1974, pp.168–173.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1977