Computing the Edit-Distance between Unrooted Ordered Trees

Authors:
Philip N. Klein
Affiliations:
-
Venue:
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Year:
1998

Citing 9
Cited 46

Topological graph theory

Topological graph theory
A data structure for dynamic trees

Journal of Computer and System Sciences
Simple fast algorithms for the editing distance between trees and related problems

SIAM Journal on Computing
On a cyclic string-to-string correction problem

Information Processing Letters
On the editing distance between unordered labeled trees

Information Processing Letters
Tree pattern matching

Pattern matching algorithms
The String-to-String Correction Problem

Journal of the ACM (JACM)
The Tree-to-Tree Correction Problem

Journal of the ACM (JACM)
A System for Approximate Tree Matching

IEEE Transactions on Knowledge and Data Engineering

On Maximum Symmetric Subgraphs

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Computing Similarity between RNA Structures

CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Local Similarity in RNA Secondary Structures

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Learning Metrics Between Tree Structured Data: Application to Image Recognition

ECML '07 Proceedings of the 18th European conference on Machine Learning
Fast Algorithms for Computing Tree LCS

CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
Efficient Similarity Search for Tree-Structured Data

SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
A Tree Distance Function Based on Multi-sets

New Frontiers in Applied Data Mining
Split-Order Distance for Clustering and Classification Hierarchies

SSDBM 2009 Proceedings of the 21st International Conference on Scientific and Statistical Database Management
A Multi-Agent Framework for Storage and Retrieval of Documents from Distributed XML Collections

KES-AMSTA '09 Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications
Fast RNA Structure Alignment for Crossing Input Structures

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
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
Extended Hidden Vector State Parser

TSD '09 Proceedings of the 12th International Conference on Text, Speech and Dialogue
Tree edit models for recognizing textual entailments, paraphrases, and answers to questions

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Provenance-based trustworthiness assessment in sensor networks

Proceedings of the Seventh International Workshop on Data Management for Sensor Networks
Probabilistic tree-edit models with structured latent variables for textual entailment and question answering

COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Algorithms for forest pattern matching

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
Approximate joins for XML using g-string

XSym'10 Proceedings of the 7th international XML database conference on Database and XML technologies
pq-hash: an efficient method for approximate XML joins

WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Fast RNA structure alignment for crossing input structures

Journal of Discrete Algorithms
The tree inclusion problem: In linear space and faster

ACM Transactions on Algorithms (TALG)
Learning stochastic tree edit distance

ECML'06 Proceedings of the 17th European conference on Machine Learning
RTED: a robust algorithm for the tree edit distance

Proceedings of the VLDB Endowment
Local alignment of RNA sequences with arbitrary scoring schemes

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Algorithms for finding a most similar subforest

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
How to compare arc-annotated sequences: the alignment hierarchy

SPIRE'06 Proceedings of the 13th international conference on String Processing and Information Retrieval
Adaptive user profile model and collaborative filtering for personalized news

APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Space efficient algorithms for ordered tree comparison

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A linear tree edit distance algorithm for similar ordered trees

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
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

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Normalized similarity of RNA sequences

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
XML information retrieval through tree edit distance and structural summaries

AIRS'11 Proceedings of the 7th Asia conference on Information Retrieval Technology
Local exact pattern matching for non-fixed RNA structures

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
A distance measure between labeled combinatorial maps

Computer Vision and Image Understanding
Guided forest edit distance: better structure comparisons by using domain-knowledge

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching
Common structured patterns in linear graphs: approximation and combinatorics

CPM'07 Proceedings of the 18th annual conference 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
An improved algorithm for tree edit distance incorporating structural linearity

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Complexity of computing distances between geometric trees

SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Coloring based approach for matching unrooted and/or unordered trees

Pattern Recognition Letters
DTD based costs for tree-edit distance in structured information retrieval

ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
RWS-Diff: flexible and efficient change detection in hierarchical data

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
A mapping-based tree similarity algorithm and its application to ontology alignment

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

ACM SIGMOD Record
Natural language inference for arabic using extended tree edit distance with subtrees

Journal of Artificial Intelligence Research
An improved algorithm for tree edit distance with applications for RNA secondary structure comparison

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

An ordered tree is a tree in which each node's incident edges are cyclically ordered; think of the tree as being embedded in the plane. Let A and B be two ordered trees. The edit distance between A and B is the minimum cost of a sequence of operations (contract an edge, uncontract an edge, modify the label of an edge) needed to transform A into B. We give an O(n3 log n) algorithm to compute the edit distance between two ordered trees.