Abstract
We describe an algorithm for comparing two RNA secondary structures coded in the form of trees that introduces two novel operations, called node fusion and edge fusion, besides the tree edit operations of deletion, insertion and relabelling 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bouthinon, D., Soldano, H.: A new method to predict the consensus secondary structure of a set of unaligned RNA sequences. Bioinformatics 15(10), 785–798 (1999)
Brown, J.W.: The ribonuclease p database. Nucleic Acids Research 24(1), 314 (1999)
el Mabrouk, N., Lisacek, F.: Very fast identification of RNA motifs in genomic DNA. application to tRNA search in the yeast genome. J. Mol. Biol. 264(1), 46–55 (1996)
Winkelmans, T., Wuyts, J., Van de Peer, Y., De Wachter, R.: The european database on small subunit ribosomal rna. Nucleic Acids Research 30(1), 183–185 (2002)
Lisacek, F., Diaz, Y., Michel, F.: Automatic identification of group I intron cores in genomic DNA sequences. J. Mol. Biol. 235(4), 1206–1217 (1994)
Shapiro, B.A., Zhang, K.: Comparing multiple RNA secondary structures using tree comparisons. Comput. Appl. Biosci. 6(4), 309–318 (1990)
Shapiro, B.: An algorithm for multiple rna secondary structures. Comput. Appl. Biosci. 4(3), 387–393 (1988)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245–1262 (1989)
Zuker, M.: Mfold web server for nucleic acid folding and hybridization prediction. Nucleic Acids Res. 31(13), 3406–3415 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allali, J., Sagot, MF. (2004). Novel Tree Edit Operations for RNA Secondary Structure Comparison. In: Jonassen, I., Kim, J. (eds) Algorithms in Bioinformatics. WABI 2004. Lecture Notes in Computer Science(), vol 3240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30219-3_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-30219-3_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23018-2
Online ISBN: 978-3-540-30219-3
eBook Packages: Springer Book Archive