Tree Edit Distance, Alignment Distance and Inclusion

Wesurveytheproblemofcomparinglabeledtrees basedonsimplelocaloperationsofdeleting, inserting and relabeling nodes. These operations lead to the tree edit distance, alignment distance and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem.