Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Linear trees and RNA secondary structure
Discrete Applied Mathematics
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Identifying approximately common substructures in trees based on a restricted edit distance
Information Sciences: an International Journal
A New Editing based Distance between Unordered Labeled Trees
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Alignment of Trees - An Alternative to Tree Edit
CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Computing Similarity Between RNA Secondary Structures
INTSYS '98 Proceedings of the IEEE International Joint Symposia on Intelligence and Systems
Local Similarity in RNA Secondary Structures
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
RNA Secondary structure comparison: exact analysis of the Zhang--Shasha tree edit algorithm
Theoretical Computer Science
Error-Correcting Tree Automata for Syntactic Pattern Recognition
IEEE Transactions on Computers
A multiple layer model to compare RNA secondary structures
Software—Practice & Experience
A new constrained edit distance between quotiented ordered trees
Journal of Discrete Algorithms
A constrained edit distance algorithm between semi-ordered trees
Theoretical Computer Science
Extracting paraphrase patterns from bilingual parallel corpora
Natural Language Engineering
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we propose a dynamic programming algorithm to evaluate local similarity between ordered quotiented trees using a constrained edit scoring scheme. A quotiented tree is a tree defined with an additional equivalent relation on vertices and such that the quotient graph is also a tree. The core of the method relies on two adaptations of an algorithm proposed by Zhang et al. [K. Zhang, D. Shasha, Simple fast algorithms for the editing distance between trees and related problems (1989) 1245-1262] for comparing ordered rooted trees. After some preliminary definitions and the description of this tree edit algorithm, we propose extensions to globally and locally compare two quotiented trees. This last method allows to find the region in each tree with the highest similarity. Algorithms are currently being used in genomic analysis to evaluate variability between RNA secondary structures.