Efficient Computation of the Tree Edit Distance

DOI10.1145/2699485zbMath1474.68229arXiv1201.0230OpenAlexW2028509346MaRDI QIDQ5012520

Nikolaus Augsten, Mateusz Pawlik

Publication date: 25 November 2021

Published in: ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.0230

zbMATH Keywords

approximate matchingsimilarity searchtree edit distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (5)

Algebraic dynamic programming on trees ⋮ On the hardness of computing the edit distance of shallow trees ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• TED

This page was built for publication: Efficient Computation of the Tree Edit Distance