Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

Authors:
Daiji Fukagawa;Tatsuya Akutsu;Atsuhiro Takasu
Affiliations:
National Institute of Informatics, Tokyo, Japan 101---8430;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan 611---0011;National Institute of Informatics, Tokyo, Japan 101---8430
Venue:
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Year:
2009

Citing 16
Cited 3

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

SIAM Journal on Computing
Some MAX SNP-hard results concerning unordered labeled trees

Information Processing Letters
Randomized algorithms

Randomized algorithms
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
Approximate XML joins

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Approximation and Special Cases of Common Subtrees and Editing Distance

ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Computing the Edit-Distance between Unrooted Ordered Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing
XML stream processing using tree-edit distance embeddings

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Similarity evaluation on tree-structured data

Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A survey on tree edit distance and related problems

Theoretical Computer Science
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
A relation between edit distance for ordered trees and edit distance for Euler strings

Information Processing Letters
Improved approximation of the largest common subtree of two unordered trees of bounded height

Information Processing Letters
An optimal decomposition algorithm for tree edit distance

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

Efficient exponential time algorithms for edit distance between unordered trees

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees

Theoretical Computer Science
Efficient exponential-time algorithms for edit distance between unordered trees

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation algorithm whose approximation ratio is 2h + 2, where we consider unit cost edit operations and h is the maximum height of the two input trees. The algorithm is based on an embedding of unit cost tree edit distance into L 1 distance. We also present an efficient implementation of the algorithm using randomized dimension reduction.