A survey on tree edit distance and related problems
A survey on tree edit distance and related problems
Philip Bille
2005 · DOI: 10.1016/j.tcs.2004.12.030
Theoretical Computer Science · 841 Citations
TLDR
This work surveys the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes and presents one or more of the central algorithms for solving the problem.