New algorithm for ordered tree-to-tree correction problem
From MaRDI portal
Recommendations
Cited in
(14)- A survey on tree matching and XML retrieval
- Algorithms for finding a most similar subforest
- Approximating tree edit distance through string edit distance
- Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
- Faster algorithms for guided tree edit distance
- Ordered tree alignment with genetic programming
- A survey on tree edit distance and related problems
- Algorithms and Computation
- A relation between edit distance for ordered trees and edit distance for Euler strings
- Fast algorithms for computing tree LCS
- Fast Algorithms for Computing Tree LCS
- A multi-labeled tree edit distance for comparing ``Clonal trees of tumor progression
- Further comments on the subtree isomorphism for ordered trees
- Algebraic dynamic programming on trees
This page was built for publication: New algorithm for ordered tree-to-tree correction problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2746431)