Faster algorithms for guided tree edit distance

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 [5].

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Dekel Tsur
• Keywords: Edit Distance Problem, Edit Operations, Input Forest, IPL 2008