A linear tree edit distance algorithm for similar ordered trees
From MaRDI portal
Recommendations
Cited in
(17)- A constrained edit distance algorithm between semi-ordered trees
- A VLSI algorithm for calculating the tree to tree distance
- New algorithm for ordered tree-to-tree correction problem
- Forest Alignment with Affine Gaps and Anchors
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Fast Algorithms for Computing Tree LCS
- An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity
- Forest alignment with affine gaps and anchors, applied in RNA structure comparison
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- scientific article; zbMATH DE number 1445367 (Why is no real title available?)
- Algorithms and Computation
- Weighted edit distance computation: strings, trees, and Dyck
- Faster algorithms for bounded tree edit distance
- Fast algorithms for computing tree LCS
- Faster algorithm for bounded tree edit distance in the low-distance regime
- Local similarity between quotiented ordered trees
- Comparing similar ordered trees in linear-time
This page was built for publication: A linear tree edit distance algorithm for similar ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713555)