Local Similarity Between Quotiented Ordered Trees

Abstract : In this paper we propose a dynamic programming algorithm to evaluate local similarity between ordered quotiented trees using a constrained edit scoring scheme. A quotiented tree is a tree defined with an additional equivalent relation on vertices and such that the quotient graph is also a tree. The core of the method relies on two adaptations of an algorithm proposed by Zhang et al. [K. Zhang, D. Shasha, Simple fast algorithms for the editing distance between trees and related problems (1989) 1245-1262] for comparing ordered rooted trees. After some preliminary definitions and the description of this tree edit algorithm, we propose extensions to globally and locally compare two quotiented trees. This last method allows to find the region in each tree with the highest similarity. Algorithms are currently being used in genomic analysis to evaluate variability between RNA secondary structures.
Type de document :
Article dans une revue
Journal of Discrete Algorithms, Elsevier, 2007, 5 (1), pp.23-35
Liste complète des métadonnées

Littérature citée [25 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00307119
Contributeur : Pascal Ferraro <>
Soumis le : lundi 1 décembre 2008 - 16:31:29
Dernière modification le : jeudi 18 janvier 2018 - 01:46:30
Document(s) archivé(s) le : samedi 26 novembre 2016 - 00:16:18

Fichier

view.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00307119, version 1

Citation

Pascal Ferraro, Aïda Ouangraoua, Laurent Tichit, Serge Dulucq. Local Similarity Between Quotiented Ordered Trees. Journal of Discrete Algorithms, Elsevier, 2007, 5 (1), pp.23-35. 〈hal-00307119〉

Partager

Métriques

Consultations de la notice

162

Téléchargements de fichiers

84