Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

DOI10.1007/978-3-540-95891-8_12MaRDI QIDQ5901383zbMATH OpenOpenAlexWikidataFDO

Authors Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-95891-8_12

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Approximating tree edit distance through string edit distance for binary tree codes
• Approximating tree edit distance through string edit distance
• Approximating Tree Edit Distance Through String Edit Distance
• A relation between edit distance for ordered trees and edit distance for Euler strings
• \(1+\varepsilon\) approximation of tree edit distance in quadratic time

Cites work

• A relation between edit distance for ordered trees and edit distance for Euler strings
• A survey on tree edit distance and related problems
• An Optimal Decomposition Algorithm for Tree Edit Distance
• Approximating Tree Edit Distance Through String Edit Distance
• Property testing of regular tree languages
• Simple Fast Algorithms for the Editing Distance between Trees and Related Problems

Cited in

(4)

• Approximating tree edit distance through string edit distance
• Approximating Tree Edit Distance Through String Edit Distance
• Approximating tree edit distance through string edit distance for binary tree codes
• A string matching based algorithm for performance evaluation of mathematical expression recognition

This page was built for publication: Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901383)