Approximating tree edit distance through string edit distance

Authors:
Tatsuya Akutsu;Daiji Fukagawa;Atsuhiro Takasu
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan;National Institute of Informatics, Tokyo, Japan;National Institute of Informatics, Tokyo, Japan
Venue:
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Year:
2006

Citing 16
Cited 3

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
The string edit distance matching problem with moves

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate XML joins

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Algorithms on Trees and Graphs

Algorithms on Trees and Graphs
Computing the Edit-Distance between Unrooted Ordered Trees

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Low distortion embeddings for edit distance

Proceedings of the thirty-seventh annual ACM symposium on Theory of 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
Nonembeddability theorems via Fourier analysis

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Oblivious string embeddings and edit distance approximations

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower bounds for embeddings into L1

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A relation between edit distance for ordered trees and edit distance for Euler strings

Information Processing Letters
Fast algorithms for comparison of similar unordered trees

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

Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Comparing top-k XML lists

Information Systems
A survey on tree edit distance lower bound estimation techniques for similarity join on XML data

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an O(n2) time algorithm for approximating the unit cost edit distance for ordered and rooted trees of bounded degree within a factor of O(n3/4), where n is the maximum size of two input trees, and the algorithm is based on transformation of an ordered and rooted tree into a string.