Results 1  10
of
78,442
A survey on tree edit distance and related problems
 Theor. Comput. Sci
, 2005
"... We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one or ..."
Abstract

Cited by 181 (1 self)
 Add to MetaCart
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract

Cited by 809 (117 self)
 Add to MetaCart
and base pairing probabilities. An efficient heuristic for the inverse folding problem of RNA is introduced. In addition we present compact and efficient programs for the comparison of RNA secondary structures based on tree editing and alignment. All computer codes are written in ANSI C. They include
Fast texture synthesis using treestructured vector quantization
, 2000
"... Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given ..."
Abstract

Cited by 561 (12 self)
 Add to MetaCart
, but runs two orders of magnitude faster. This permits us to apply texture synthesis to problems where it has traditionally been considered impractical. In particular, we have applied it to constrained synthesis for image editing and temporal texture generation. Our algorithm is derived from Markov Random
Tree Edit Distance With Gaps
 INFORMATION PROCESSING LETTERS
, 2003
"... this paper is to study the definition of edit distances with convex gap weights for trees. In the special case of strings, this problem has yield to the definition of classical solutions: Galil and Giancarlo produced in [2] an algorithm in O(n log(n)), for example. For trees, standart edit distan ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
this paper is to study the definition of edit distances with convex gap weights for trees. In the special case of strings, this problem has yield to the definition of classical solutions: Galil and Giancarlo produced in [2] an algorithm in O(n log(n)), for example. For trees, standart edit
Analysis of tree edit distance algorithms
 In Proceedings of the 14th annual symposium on Combinatorial Pattern Matching (CPM
, 2003
"... Abstract. In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance alg ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
Abstract. In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance
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
Learning stochastic tree edit distance
 In Proc. of ECML’06
, 2006
"... Abstract. Trees provide a suited structural representation to deal with complex tasks such as web information extraction, RNA secondary structure prediction, or conversion of tree structured documents. In this context, many applications require the calculation of similarities between tree pairs. T ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
. The most studied distance is likely the tree edit distance (ED) for which improvements in terms of complexity have been achieved during the last decade. However, this classic ED usually uses a priori fixed edit costs which are often difficult to tune, that leaves little room for tackling complex problems
Recognizing Textual Entailment with Tree Edit Distance Algorithms
 PASCAL Challenges on RTE
, 2005
"... This paper summarizes ITCirst participation in the PASCAL challenge on Recognizing Textual Entailment (RTE). Given a pair of texts (the text and the hypothesis), the core of the approach we present is a tree edit distance algorithm applied on the dependency trees of both the text and the hypothesis ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
This paper summarizes ITCirst participation in the PASCAL challenge on Recognizing Textual Entailment (RTE). Given a pair of texts (the text and the hypothesis), the core of the approach we present is a tree edit distance algorithm applied on the dependency trees of both the text
Tree Edit Distance, Alignment Distance and Inclusion
, 2003
"... We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting and relabeling nodes. These operations lead to the tree edit distance, alignment distance and inclusion problem. For each problem we review the results available and present, in detail, one or ..."
Abstract

Cited by 27 (0 self)
 Add to MetaCart
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting and relabeling nodes. These operations lead to the tree edit distance, alignment distance and inclusion problem. For each problem we review the results available and present, in detail, one
Decomposition Algorithms for the Tree Edit Distance Problem
"... We study the behavior of dynamic programming methods for the tree edit distance problem, such as [5,13]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexi ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
We study the behavior of dynamic programming methods for the tree edit distance problem, such as [5,13]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization
Results 1  10
of
78,442