A new distance for high level RNA secondary structure comparison - Archive ouverte HAL Access content directly
Journal Articles IEEE/ACM Transactions on Computational Biology and Bioinformatics Year : 2005

A new distance for high level RNA secondary structure comparison

Abstract

We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two new operations, called node fusion and edge fusion, besides the tree edit operations of deletion, insertion, and relabeling classically used in the literature. This allows us to address some serious limitations of the more traditional tree edit operations when the trees represent RNAs and what is searched for is a common structural core of two RNAs. Although the algorithm complexity has an exponential term, this term depends only on the number of successive fusions that may be applied to a same node, not on the total number of fusions. The algorithm remains therefore efficient in practice and is used for illustrative purposes on ribosomal as well as on other types of RNAs.
Fichier principal
Vignette du fichier
tcbb0_.pdf (1.39 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00306658 , version 1 (21-10-2008)

Identifiers

Cite

Julien Allali, Marie-France Sagot. A new distance for high level RNA secondary structure comparison. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2005, 2, pp.3--14. ⟨hal-00306658⟩
324 View
89 Download

Altmetric

Share

Gmail Facebook X LinkedIn More