Efficiently computing weighted tree edit distance using relaxation labeling
From MaRDI portal
Recommendations
- Computing approximate tree edit distance using relaxation labeling
- A survey on tree edit distance and related problems
- Approximating Tree Edit Distance Through String Edit Distance
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Efficient computation of the tree edit distance
Cited in
(4)
This page was built for publication: Efficiently computing weighted 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 Q4786057)