The string-to-string correction problem with block moves
- 1 November 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 2 (4), 309-321
- https://doi.org/10.1145/357401.357404
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Computer-Aided Software Engineering in a distributed workstation environmentACM SIGPLAN Notices, 1984
- The LOCUS distributed operating systemACM SIGOPS Operating Systems Review, 1983
- A redisplay algorithmPublished by Association for Computing Machinery (ACM) ,1981
- A technique for isolating differences between filesCommunications of the ACM, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications 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, 1972