%0 Conference Paper %1 dulucq2003analysis %A Dulucq, Serge %A Touzet, Hélène %B Proceedings of the 14th Annual Conference on Combinatorial Pattern Matching %C Berlin, Heidelberg %D 2003 %I Springer-Verlag %K 2013 algorithms decomposition distance edit graph strategy tree %P 83--95 %T Analysis of Tree Edit Distance Algorithms %U http://dl.acm.org/citation.cfm?id=1756553.1756560 %X 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. %@ 3-540-40311-6

@inproceedings{dulucq2003analysis, abstract = {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.}, acmid = {1756560}, added-at = {2014-03-05T14:53:09.000+0100}, address = {Berlin, Heidelberg}, author = {Dulucq, Serge and Touzet, H{\'e}l\`{e}ne}, biburl = {https://www.bibsonomy.org/bibtex/2801cec345072c0e36c10a111732ac84d/s_nkeha}, booktitle = {Proceedings of the 14th Annual Conference on Combinatorial Pattern Matching}, description = {Analysis of tree edit distance algorithms}, interhash = {6129c5338f6c58574f156c6098e8e91a}, intrahash = {801cec345072c0e36c10a111732ac84d}, isbn = {3-540-40311-6}, keywords = {2013 algorithms decomposition distance edit graph strategy tree}, location = {Morelia, Michoac\&\#225;n, Mexico}, numpages = {13}, pages = {83--95}, publisher = {Springer-Verlag}, series = {CPM'03}, timestamp = {2014-03-05T14:53:09.000+0100}, title = {Analysis of Tree Edit Distance Algorithms}, url = {http://dl.acm.org/citation.cfm?id=1756553.1756560}, year = 2003 }