An O(n^3)-Time Algorithm for Tree Edit Distance

Erik D. Demaine Shay Mozes Benjamin Rossman Oren Weimann

Published in: CoRR (2006)

Keyphrases

optimal solution
np hard
tree edit distance
k means
dynamic programming
matching algorithm
feature selection
search space
distance measure
clustering method
relaxation labeling