Computing approximate tree edit distance using relaxation labeling
From MaRDI portal
Recommendations
- Efficiently computing weighted tree edit distance using relaxation labeling
- A survey on tree edit distance and related problems
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- A constrained edit distance between unordered labeled trees
- A new measure of edit distance between labeled trees
Cited in
(7)- XML application schema matching using similarity measure and relaxation labeling
- Edit distance-based kernel functions for structural pattern classification
- Learning Tree Languages
- Heuristics for the generalized median graph problem
- Tree edit distance from information theory
- Efficiently computing weighted tree edit distance using relaxation labeling
- A survey of graph edit distance
This page was built for publication: Computing approximate tree edit distance using relaxation labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417661)