Faster algorithms for guided tree edit distance

Authors:
Dekel Tsur
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Israel
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 0

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)
New algorithm for ordered tree-to-tree correction problem

Journal of Algorithms
More algorithms for all-pairs shortest paths in weighted graphs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge

CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
An optimal decomposition algorithm for tree edit distance

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.89

Visualization

Abstract

The guided tree edit distance problem is to find a minimum cost series of edit operations that transforms two input forests F and G into isomorphic forests F^' and G^' such that a third input forest H is included in F^' (and G^'). The edit operations are relabeling a vertex and deleting a vertex. We show efficient algorithms for this problem that are faster than the previous algorithm for this problem of Peng and Ting [Z. Peng, H. Ting, Guided forest edit distance: Better structure comparisons by using domain-knowledge, in: Proc. 18th Symposium on Combinatorial Pattern Matching (CPM), 2007, pp. 28-39].