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

DOI10.3233/FI-2010-282zbMath1218.68074OpenAlexW1854095105MaRDI QIDQ5892565

Taku Aratsu, Kouichi Hirata, Tetsuji Kuboyama

Publication date: 14 June 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2010-282

zbMATH Keywords

tree edit distancestring edit distancebinary tree representationbinary tree code

Mathematics Subject Classification ID

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

Related Items (2)

On the hardness of computing the edit distance of shallow trees ⋮ Unnamed Item

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