Bounds on the Complexity of the Longest Common Subsequence Problem
- 1 January 1976
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 23 (1) , 1-12
- https://doi.org/10.1145/321921.321922
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Preserving order in a forest in less than logarithmic timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- A system for typesetting mathematicsCommunications of the ACM, 1975
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- On the Optimality of Some Set AlgorithmsJournal of the ACM, 1972
- Recommendations with Respect to the Behavioral and Social Aspects of Human GeneticsProceedings of the National Academy of Sciences, 1972
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970