TY - RPRT
T1 - Tree Edit Distance, Alignment Distance and Inclusion
AU - Bille, Philip
PY - 2003/3
Y1 - 2003/3
N2 - 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.
AB - 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.
M3 - Report
T3 - IT University Technical Report Series
BT - Tree Edit Distance, Alignment Distance and Inclusion
PB - IT-Universitetet i København
CY - Copenhagen
ER -