A relation between edit distance for ordered trees and edit distance for Euler strings

Authors:
Tatsuya Akutsu
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan
Venue:
Information Processing Letters
Year:
2006

Citing 10
Cited 8

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

SIAM Journal on Computing
Fast algorithms for the unit cost editing distance between trees

Journal of Algorithms
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
New algorithm for ordered tree-to-tree correction problem

Journal of Algorithms
Approximate XML joins

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Approximating Edit Distance Efficiently

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
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

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
Sibling Distance for Rooted Labeled Trees

New Frontiers in Applied Data Mining
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
A bisection algorithm for grammar-based compression of ordered trees

Information Processing Letters
A metric for rooted trees with unlabeled vertices based on nested parentheses

Theoretical Computer Science
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

Fundamenta Informaticae
Approximating tree edit distance through string edit distance

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
A survey on tree edit distance lower bound estimation techniques for similarity join on XML data

ACM SIGMOD Record

Quantified Score

Hi-index	0.89

Visualization

Abstract

We consider a relationship between the unit cost edit distance for two rooted ordered trees and the unit cost edit distance for the corresponding Euler strings. We show that the edit distance between trees is at least half of the edit distance between the Euler strings and is at most 2h+1 times the edit distance between the Euler strings, where h is the minimum height of two trees. The result can be extended for more general cost functions.