Algorithms for the Longest Common Subsequence Problem
- 1 October 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 24 (4), 664-675
- https://doi.org/10.1145/322033.322044
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- 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
- An Extension of the String-to-String Correction ProblemJournal of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences of the United States of America, 1972
- A general method applicable to the search for similarities in the amino acid sequence of two proteinsJournal of Molecular Biology, 1970