Results 1  10
of
745
Edit distance between unlabeled ordered trees
, 2005
"... There exists a bijection between one stack sortable permutations –permutations which avoid the pattern 231 – and planar trees. We define an edit distance between permutations which is coherent with the standard edit distance between trees. This onetoone correspondence yields a polynomial algorithm ..."
Abstract
 Add to MetaCart
algorithm for the subpermutation problem for (231) avoiding permutations. Moreover, we obtain the generating function of the edit distance between ordered trees and some special ones. For the general case we show that the mean edit distance between a planar tree and all other planar trees is at least n
Simple fast algorithms for the editing distance between trees and related problems
 SIAM J. COMPUT
, 1989
"... Ordered labeled trees are trees in which the lefttoright order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching i ..."
Abstract

Cited by 405 (12 self)
 Add to MetaCart
Ordered labeled trees are trees in which the lefttoright order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching
Computing the editdistance between unrooted ordered trees
 In Proceedings of the 6th annual European Symposium on Algorithms (ESA
, 1998
"... 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, ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
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
The Editing Distance Between Trees
, 1999
"... The similarity between two given structures can be of vital interest in various problem definitions. An example with a large application basis  tolerant full text searches  is the similarity of strings. We present the extension of this problem to trees, where applications lie in comparing gramma ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
possible metrics we present in detail efficient ways for computing the tree edit distance by a dynamic programming approach and we will give a brief overview of tree alignment.
The pqGram Distance between Ordered Labeled Trees
 ACM TRANSACTIONS ON DATABASE SYSTEMS (TODS)
, 2010
"... When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases structural information is available and can be used to match such data. Typically the matching must be approximate since the ..."
Abstract

Cited by 13 (5 self)
 Add to MetaCart
the representations in the sources differ. We propose pqgrams to approximately match hierarchical data from autonomous sources and define the pqgram distance between ordered labeled trees as an effective and efficient approximation of the fanout weighted tree edit distance. We prove that the pqgram distance is a
A constrained edit distance algorithm between semiordered trees, in "Theor
 n o 810
"... trees ..."
A New Constrained Edit Distance Between Quotiented Ordered Trees
, 2008
"... In this paper we propose a dynamic programming algorithm to compare two quotiented ordered trees using a constrained edit distance. An ordered tree is a tree in which the lefttoright order among siblings is significant. A quotiented ordered tree is an ordered tree T with an equivalence relation on ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
on vertices and such that, when the equivalence classes are collapsed to supernodes, the graph so obtained is an ordered tree as well. Based on an algorithm proposed by Zhang and Shasha (1989, SIAM J. Comput., 18, 12451262) and introducing new notations, we describe a tree edit distance between quotiented
An optimal decomposition algorithm for tree edit distance
 In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP
, 2007
"... Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worstc ..."
Abstract

Cited by 48 (2 self)
 Add to MetaCart
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations consisting of deleting and relabeling existing nodes, as well as inserting new nodes. In this paper, we present a worst
An efficient bottomup distance between trees
 Proceedings of the 8th International Symposium of String Processing and Information Retrieval
, 2001
"... A new bottomup distance measure for labeled trees, which is based on the largest common forest of the trees and has the threefold advantage of independence of particular edit costs, low complexity, and coverage of ordered and unordered trees, is introduced and related in this paper with other dista ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
A new bottomup distance measure for labeled trees, which is based on the largest common forest of the trees and has the threefold advantage of independence of particular edit costs, low complexity, and coverage of ordered and unordered trees, is introduced and related in this paper with other
Automatic Web News Extraction Using Tree Edit Distance
 in Proceedings of World Wide Web Conference (WWW04
, 2004
"... The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant information within this huge repository of data. Although several techniques have been developed to the problem of Web data ex ..."
Abstract

Cited by 109 (5 self)
 Add to MetaCart
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant information within this huge repository of data. Although several techniques have been developed to the problem of Web data
Results 1  10
of
745