A linear space algorithm for computing maximal common subsequences
- 1 June 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 18 (6), 341-343
- https://doi.org/10.1145/360825.360861
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Bounds on the complexity of the longest common subsequence problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- The String-to-String Correction ProblemJournal of the ACM, 1974