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

DOI10.1007/978-3-540-95891-8_12zbMath1197.68039OpenAlexW2126396628WikidataQ58061294 ScholiaQ58061294MaRDI QIDQ5901383

Kouichi Hirata, Tetsuji Kuboyama, Taku Aratsu

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

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

Related Items (1)

A string matching based algorithm for performance evaluation of mathematical expression recognition

Cites Work

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

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