Data structures and network algorithms
Data structures and network algorithms
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
The String-to-String Correction Problem
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Discrete Structures for Computer Science and Engineering
Introduction to Discrete Structures for Computer Science and Engineering
Computing Similarity Between RNA Secondary Structures
INTSYS '98 Proceedings of the IEEE International Joint Symposia on Intelligence and Systems
A New Measure of the Distance between Ordered Trees and its Applications
A New Measure of the Distance between Ordered Trees and its Applications
Local similarity between quotiented ordered trees
Journal of Discrete Algorithms
A multiple graph layers model with application to RNA secondary structures comparison
SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
| Hi-index | 0.00 |
In this paper we propose a dynamic programming algorithm to compare two quotiented ordered trees using a constrained edit distance. An ordered tree is a tree in which the left-to-right order among siblings is significant. A quotiented ordered tree is an ordered tree T with an equivalence relation on vertices and such that, when the equivalence classes are collapsed to super-nodes, the graph so obtained is an ordered tree as well. Based on an algorithm proposed by Zhang and Shasha [K. Zhang, D. Shasha, Simple fast algorithms for the editing distance between trees and related problems, SIAM Journal on Computing 18 (6) (1989) 1245-1262] and introducing new notations, we describe a tree edit distance between quotiented ordered trees preserving equivalence relations on vertices during computation which works in polynomial time. Its application to RNA secondary structures comparison is finally presented.