AnO(ND) difference algorithm and its variations
- 1 November 1986
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 1 (1-4), 251-266
- https://doi.org/10.1007/bf01840446
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- A redisplay algorithmPublished by Association for Computing Machinery (ACM) ,1981
- Approximate String MatchingACM Computing Surveys, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- An information-theoretic lower bound for the longest common subsequence problemInformation Processing Letters, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- The source code control systemIEEE Transactions on Software Engineering, 1975
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- A note on two problems in connexion with graphsNumerische Mathematik, 1959