A relation between edit distance for ordered trees and edit distance for Euler strings

DOI10.1016/J.IPL.2006.06.002zbMATH Open1185.68829OpenAlexW1969871814MaRDI QIDQ845840FDOQ845840

Tatsuya Akutsu

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

Recommendations

• Approximating tree edit distance through string edit distance
• scientific article; zbMATH DE number 1305084
• Approximating Tree Edit Distance Through String Edit Distance
• Fast algorithms for the unit cost editing distance between trees
• On the editing distance between unordered labeled trees

zbMATH Keywords

algorithmsalignmentedit distanceordered treesEuler string

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cites Work

• The Tree-to-Tree Correction Problem
• A survey on tree edit distance and related problems
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
• New algorithm for ordered tree-to-tree correction problem
• Title not available (Why is that?)
• Fast algorithms for the unit cost editing distance between trees
• Low distortion embeddings for edit distance

Cited In (7)

• 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?
• Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
• Sublinear DTD Validity
• A bisection algorithm for grammar-based compression of ordered trees
• Approximate joins for XML at label level

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)