Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
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
On the similarity metric and the distance metric
Theoretical Computer Science
Algorithms for forest pattern matching
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms for finding a most similar subforest
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Algorithms for local forest similarity
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
An optimal decomposition algorithm for tree edit distance
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
An ordered labelled tree is a tree where the left-to-right order among siblings is significant. Ordered labelled forests are sequences of ordered labelled trees. Given two ordered labelled forests $$F$$ F and $$G$$ G , the local forest similarity is to find two sub-forests $$F^{\prime }$$ F 驴 and $$G^{\prime }$$ G 驴 of $$F$$ F and $$G$$ G respectively such that they are the most similar over all possible $$F^{\prime }$$ F 驴 and $$G^{\prime }$$ G 驴 . In this paper, we present efficient algorithms for the local forest similarity problem for two types of sub-forests: sibling subforests and closed subforests. Our algorithms can be used to locate the structurally similar regions in RNA secondary structures since RNA molecules' secondary structures could be represented as ordered labelled forests.