A faster algorithm computing string edit distances
- 1 February 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 20 (1) , 18-31
- https://doi.org/10.1016/0022-0000(80)90002-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- 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