Skip to main content
Journal Article

Analysis of tree edit distance algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2676 83-95
DOI: 10.1007/3-540-44888-8_7
31Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Dulucq, S., & Touzet, H. (2003). Analysis of tree edit distance algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2676, 83–95. https://doi.org/10.1007/3-540-44888-8_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free