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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00307119
Contributor : Pascal Ferraro <>
Submitted on : Monday, December 1, 2008 - 4:31:29 PM
Last modification on : Tuesday, April 2, 2019 - 12:26:01 PM
Long-term archiving on : Saturday, November 26, 2016 - 12:16:18 AM

File

view.pdf
Files produced by the author(s)

Identifiers

  • 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⟩

Share

Metrics

Record views

192

Files downloads

174