Computational geometry: an introduction
Computational geometry: an introduction
Tree graphs of RNA secondary structures and their comparisons
Computers and Biomedical Research
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
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
New data structures for orthogonal range searching
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Maximum agreement subtree in a set of evolutionary trees-metrics and efficient algorithms
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Local Similarity in RNA Secondary Structures
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
A fast algorithm for optimal alignment between similar ordered trees
Fundamenta Informaticae - Special issue on computing patterns in strings
A survey on tree edit distance and related problems
Theoretical Computer Science
Clustering of Leaf-Labelled Trees
ICANNGA '07 Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I
Efficient change control of XML documents
Proceedings of the 9th ACM symposium on Document engineering
Homeomorphic Alignment of Edge-Weighted Trees
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Homeomorphic alignment of weighted trees
Pattern Recognition
Automatically extracting user reviews from forum sites
Computers & Mathematics with Applications
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Fundamenta Informaticae - Computing Patterns in Strings
| Hi-index | 0.00 |
We present a fast algorithm for optimal alignment between two similar ordered trees with node labels. Let S and T be two such trees with |S| and |T| nodes, respectively. An optimal alignment between S and T which uses at most d blank symbols can be constructed in O(n log n 驴 (maxdeg)4 驴 d2) time, where n = max{|S|, |T|} and maxdeg is the maximum degree of a node in S or T. In particular, if the input trees are of bounded degree, the running time is O(n log n 驴 d2)