CSDL Home IEEE/ACM Transactions on Computational Biology and Bioinformatics 2005 vol.2 Issue No.01 - January-March
Issue No.01 - January-March (2005 vol.2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TCBB.2005.2
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.
Tree comparison, edit operation, distance, RNA, secondary structure.
Julien Allali, Marie-France Sagot, "A New Distance for High Level RNA Secondary Structure Comparison", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.2, no. 1, pp. 3-14, January-March 2005, doi:10.1109/TCBB.2005.2