RNA Secondary structure comparison: exact analysis of the Zhang--Shasha tree edit algorithm

Authors:
Serge Dulucq;Laurent Tichit
Affiliations:
LaBRI, Université Bordeaux I, 351 cours de la Liberation CNRS U.R.a. 1304, Talence 33405 cedex, France;LaBRI, Université Bordeaux I, 351 cours de la Liberation CNRS U.R.a. 1304, Talence 33405 cedex, France
Venue:
Theoretical Computer Science
Year:
2003

Citing 7
Cited 8

Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
The tree inclusion problem

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Linear trees and RNA secondary structure

Discrete Applied Mathematics
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The String-to-String Correction Problem

Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
Alignment of Trees - An Alternative to Tree Edit

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching

Pure Multiple RNA Secondary Structure Alignments: A Progressive Profile Approach

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An algebraic view of the relation between largest common subtrees and smallest common supertrees

Theoretical Computer Science
Local similarity between quotiented ordered trees

Journal of Discrete Algorithms
Comparing similar ordered trees in linear-time

Journal of Discrete Algorithms
Learning probabilistic models of tree edit distance

Pattern Recognition
Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm

Theoretical Computer Science
A linear tree edit distance algorithm for similar ordered trees

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Indexing for subtree similarity-search using edit distance

Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data

Quantified Score

Hi-index	5.23

Visualization

Abstract

We are interested in RNA secondary structure comparison, using an approach which consists to represent these structures by labeled ordered trees. Following the problem considered, this tree representation can be rough (considering only the structural patterns), or refined until an exact coding of the structure is obtained. After some preliminary definitions and the description of the Zhang-Shasha (SIAM J. Comput. 18 (6) (1989) 1245) tree edit algorithm, which is on the one hand the reference when dealing with ordered labeled trees comparison, and on the other hand the starting point of our work, this article will present an exact analysis of its complexity. The purpose of this work is also to lead us to a better comprehension of the parameters of this algorithm, in order to be able to modify it more easily without changing its time complexity to take into account biological constraints that occur when comparing RNA secondary structures.