Guided forest edit distance: better structure comparisons by using domain-knowledge

Authors:
Zeshan Peng;Hing-fung Ting
Affiliations:
Department of Computer Science, University of Hong Kong;Department of Computer Science, University of Hong Kong
Venue:
CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Year:
2007

Citing 10
Cited 0

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

SIAM Journal on Computing
Ordered and Unordered Tree Inclusion

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

Journal of the ACM (JACM)
Edit distance between two RNA structures

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
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
The constrained longest common subsequence problem

Information Processing Letters
A simple algorithm for the constrained sequence problems

Information Processing Letters
A memory-efficient algorithm for multiple sequence alignment with constraints

Bioinformatics
Time and space efficient algorithms for constrained sequence alignment

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the guided forest edit distance problem, which measures the similarity of two forests under the guidance of a third forest. We give an efficient algorithm for the problem. Our problem is a natural generalization of many important structure comparison problems such as the forest edit distance problem, constrained sequence alignment problem and the longest constrained common subsequence problem. Our algorithm matches the performance of the best known algorithms for these problems.