Algorithms for finding a most similar subforest

Authors:
Jesper Jansson;Zeshan Peng
Affiliations:
Department of Computer Science and Communication Engineering, Kyushu University, Higashi-ku, Fukuoka, Japan;Department of Computer Science, The University of Hong Kong, Hong Kong
Venue:
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Year:
2006

Citing 13
Cited 2

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

SIAM Journal on Computing
Text algorithms

Text algorithms
Alignment of trees: an alternative to tree edit

Theoretical Computer Science
Ordered and Unordered Tree Inclusion

SIAM Journal on Computing
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
New algorithm for ordered tree-to-tree correction problem

Journal of Algorithms
Computing the Edit-Distance between Unrooted Ordered Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Detecting Changes in XML Documents

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
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
Constrained tree inclusion

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A linear tree edit distance algorithm for similar ordered trees

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Local gapped subforest alignment and its application in finding RNA structural motifs

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation

Algorithms for forest pattern matching

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Algorithms for local similarity between forests

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an ordered labeled forest F (“the target forest”) and an ordered labeled forest G (“the pattern forest”), the most similar subforest problem is to find a subforest F′ of F such that the distance between F′ and G is minimum over all possible F′. This problem generalizes several well-studied problems which have important applications in locating patterns in hierarchical structures such as RNA molecules' secondary structures and XML documents. In this paper, we present efficient algorithms for the most similar subforest problem with forest edit distance for three types of subforests: simple substructures, sibling substructures, and closed subforests.