New Algorithm for Ordered Tree-to-Tree Correction Problem
- 1 August 2001
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 40 (2) , 135-158
- https://doi.org/10.1006/jagm.2001.1170
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- On the Exponent of the All Pairs Shortest Path ProblemJournal of Computer and System Sciences, 1997
- Fast algorithms for the unit cost editing distance between treesJournal of Algorithms, 1990
- Matrix multiplication via arithmetic progressionsJournal of Symbolic Computation, 1990
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- An algorithm for finding all shortest paths using N2.81 infinite-precision multiplicationsInformation Processing Letters, 1976
- New Bounds on the Complexity of the Shortest Path ProblemSIAM Journal on Computing, 1976
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- Algorithm 97: Shortest pathCommunications of the ACM, 1962