A relation between edit distance for ordered trees and edit distance for Euler strings
From MaRDI portal
Publication:845840
DOI10.1016/j.ipl.2006.06.002zbMath1185.68829MaRDI QIDQ845840
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.06.002
Related Items
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes, A bisection algorithm for grammar-based compression of ordered trees, A metric for rooted trees with unlabeled vertices based on nested parentheses, Approximating tree edit distance through string edit distance
Cites Work
- Unnamed Item
- A survey on tree edit distance and related problems
- 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
- Fast algorithms for the unit cost editing distance between trees
- Low distortion embeddings for edit distance