In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as 4 and 2. We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.
Mendeley saves you time finding and organizing research
Choose a citation style from the tabs below