A fast algorithm for computing longest common subsequences
- 1 May 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (5), 350-353
- https://doi.org/10.1145/359581.359603
Abstract
No abstract availableKeywords
This publication has 4 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
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974