A relation between edit distance for ordered trees and edit distance for Euler strings
From MaRDI portal
(Redirected from Publication:845840)
Recommendations
Cites work
- scientific article; zbMATH DE number 1305084 (Why is no real title available?)
- A survey on tree edit distance and related problems
- Fast algorithms for the unit cost editing distance between trees
- Low distortion embeddings for edit distance
- New algorithm for ordered tree-to-tree correction problem
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- The Tree-to-Tree Correction Problem
Cited in
(9)- Approximating tree edit distance through string edit distance
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- Which XML schemas are streaming bounded repairable?
- Sublinear DTD validity
- Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
- A bisection algorithm for grammar-based compression of ordered trees
- Approximating tree edit distance through string edit distance for binary tree codes
- Approximate joins for XML at label level
- Approximating Tree Edit Distance Through String Edit Distance
This page was built for publication: A relation between edit distance for ordered trees and edit distance for Euler strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845840)