Local Similarity Between Quotiented Ordered Trees - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Discrete Algorithms Année : 2007

Local Similarity Between Quotiented Ordered Trees

Résumé

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
view.pdf (386.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00307119 , version 1 (01-12-2008)

Identifiants

  • HAL Id : hal-00307119 , version 1

Citer

Pascal Ferraro, Aïda Ouangraoua, Laurent Tichit, Serge Dulucq. Local Similarity Between Quotiented Ordered Trees. Journal of Discrete Algorithms, 2007, 5 (1), pp.23-35. ⟨hal-00307119⟩
98 Consultations
98 Téléchargements

Partager

Gmail Facebook X LinkedIn More