A distance for partially labeled trees
Jorge Calvo, David Rizo and José Iñesta
Lecture Notes in Computer Science Volume 6669, pp. 492-499, 2011. ISSN 0302-9743

## Abstract

Trees are a powerful data structure for representing data for which hierarchical relations can be defined. It has been applied in a number of fields like image analysis, natural language processing, protein structure, or music retrieval, to name a few. Procedures for comparing trees are very relevant in many tasks where tree representations are involved. The computation of these measures is usually time consuming and different authors have proposed algorithms that are able to compute them in a reasonable time, by means of approximated versions of the similarity measure. Other methods require that the trees are fully labeled for the distance to be computed. The measure utilized in this paper is able to deal with trees labeled only at the leaves that runs in $O(|T_1|\times|T_2|)$ time. Experiments and comparative results are provided.

EPrint Type: Article Project Keyword UNSPECIFIED Computational, Information-Theoretic Learning with Statistics 8415 Jose F. Bernabeu Briones 10 December 2011