Klein, P. (1998). Computing the edit-distance between unrooted ordered trees. Proc. of the 6th Annual European Symposium (pp. 91--102). Springer, Berlin.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics - Pelillo (2002) (Correct)
....are subject to significant structural distortions. Unfortunately, it turns out that computing the edit distance on free trees is NP hard [25] although it is solvable in polynomial time by restricting ourselves to ordered trees, where each node is assigned a cyclic ordering of its incidente edges [15]. Moreover, determining the set of elementary edit operations and the associated costs depends heavily on the application domain and can be problematic (see [16] 17] for some examples of edit operations motivated by shape matching problems) This choice is in fact crucial as two graphs that are ....
P. Klein, "Computing the Edit-Distance between Unrooted Ordered Trees," Proc. Sixth Ann. European Symp. Algorithms---ESA '98, G. Bilardi, G.F. Italiano, A. Pietracaprina, and G. Pucci, eds., pp. 91-102, Berlin: Springer, 1998.
RNA secondary structure comparison: exact analysis of the.. - Dulucq, Tichit (2003) (2 citations) (Correct)
....represented by an ordered labeled tree (see [Wat95] and [Gus97] Thus, the secondary structure comparison, for which the pseudo knots are not taken into account, can be reduced to a tree comparison. For a few years, many ordered labeled tree comparison algorithms have been developed (see [Tai79] [Kle98]) These algorithms were introduced by S. M. Selkow [Sel77] and are based on the notion of edit distance or alignment score, which have since become a classical approach in the frame of sequence comparison (see [WF74] Notice that these two notions which are equivalent in the case of sequence ....
P. Klein. Computing the edit-distance between unrooted ordered trees. In Lecture Notes in Comput. Sci. ESA '98 (Venice), pages 91-102, 1998. 15
A General Edit Distance between RNA Structures - Jiang, Lin, Ma, Zhang (2001) (Correct)
.... implementation of this recurrence results in an algorithm with a time complexity of O(n 2 m 2 ) Since we only need to maintain DP (i 1; i 0 1; j 1; j 0 1) when (i; i 0 ) 2 P 1 and (j; j 0 ) 2 P 2 , the space complexity is O(nm) Moreover, using a technique of Klein [11], one can design an algorithm for the above recurrence relation that runs in O(n 2 m log m) time and O(n 2 m) space. The details are omitted here, because we will present a more ecient (approximation) algorithm in the next subsection. 4.2 Approximation Algorithms Based on the above (exact) ....
P.N. Klein, Computing the edit-distance between unrooted ordered trees. In Proceedings of the 6th Annual European Symposium on Algorithms (ESA), LNCS 1461, Springer, pages 91-102, 1998.
On Maximum Symmetric Subgraphs - Chen, Lu, Yen (2001) (2 citations) (Correct)
....be the ordered forest obtained from F by (a) reversing the order of the trees in F , and (b) reversing the order of the children of v for each node v in F . For any ordered tree T , T (i) be the subtree of T rooted at v i , where v 1 ; v 2 ; v n is the postordering of T . Fact 3. 1 (see [13, 20]) For any ordered forests F 1 and F 2 , dist ec (F 1 ; F 2 ) can be computed in polynomial time. Theorem 3.2. das ec for ordered trees can be solved in polynomial time. Proof: Clearly, one of the following two cases holds for any axially symmetric tree T . Case 1: The root of T has 2k 1 ....
P. Klein, Computing the Edit Distance Between Unrooted Ordered Trees, 6th European Symposium on Algorithms (ESA'98), LNCS 1461, 91-102, 1998.
A Tree-Edit-Distance Algorithm for Comparing Simple.. - Klein, Tirthapura.. (2000) (3 citations) Self-citation (Klein) (Correct)
....called the collapsed depth of the tree by Zhang and Shasha, which is bounded by the depth and by the number of leaves. The value of i is likely to be much smaller than n i , but is n i ) in the worst case. Hence in the worst case the running time is O(n 4 ) where n is the input size. Klein [5] gave an algorithm for edit distance between rooted trees with complexity O(n 2 1 n 2 log n 2 ) which is O(n 3 log n) The same paper also considers the problem of comparing unrooted trees, i.e when there is no natural root in the trees. The time complexity of Klein s algorithm for the ....
.... comparison of unordered trees; however, the edit distance between such trees is NP hard to compute [12] Also, in view of the interpretation of ordered trees as embedded in the plane, one might consider the comparison of planar graphs; again, the edit distance problem is NP hard for such graphs [5]. Variations on edit distance have also been considered, e.g. minimizing average cost per operation [7] 4 Previous work using graphs in vision Graphs have been used in image understanding in several ways. One can use a graph to represent a complex object or scene by capturing the relationships ....
P. Klein, \Computing the edit distance between unrooted ordered trees", Proceedings, 6th European Symposium on Algorithms (1998), pp. 91-102.
Efficient Feature Construction by Meta Learning - Guiding the .. - Mierswa, Wurst (2005) (Correct)
No context found.
Klein, P. (1998). Computing the edit-distance between unrooted ordered trees. Proc. of the 6th Annual European Symposium (pp. 91--102). Springer, Berlin.
Analysis of tree edit distance algorithms Serge Dulucq - And Helene Touzet (Correct)
No context found.
P. Klein, "Computing the edit-distance between unrooted ordered trees" Proceeding of 6th European Symposium on Algorithms (1998), p. 91-102.
Approximate Matching of Hierarchical Data Using pq-Grams - Augsten, Böhlen, Gamper (2005) (Correct)
No context found.
P. N. Klein. Computing the edit-distance between unrooted ordered trees. In Proceedings of the 6th European Symposium on Algorithms, volume 1461 of Lecture Notes in Computer Science, pages 91-- 102, Venice, Italy, 1998. Springer.
Tree Edit Distance With Gaps - Helene Touzet Lifl (2003) (Correct)
No context found.
P. Klein, "Computing the edit-distance between unrooted ordered trees" Proceeding of 6th European Symposium on Algorithms (1998), p. 91-102.
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees - Touzet (2005) (Correct)
No context found.
P. Klein. Computing the edit-distance between unrooted ordered trees. In 6th European Symposium on Algorithms, pages 91--102, 1998.
Decomposition Algorithms for the Tree Edit - Distance Problem Serge (Correct)
No context found.
P. Klein. Computing the edit-distance between unrooted ordered trees Proceedings of 6th European Symposium on Algorithms (1998), p. 91-102.
Efficient Feature Construction by Meta Learning - Guiding the .. - Mierswa, Wurst (2005) (Correct)
No context found.
Klein, P. (1998). Computing the edit-distance between unrooted ordered trees. Proc. of the 6th Annual European Symposium (pp. 91--102). Springer, Berlin.
Mining Protein Family Specific Residue Packing.. - Huan, Wang.. (Correct)
No context found.
P. N. Klein. Computing the edit-distance between unrooted ordered trees. In Proc. 6th Annual Enropean Symposium, pages 91--102, 1998.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
P.N. Klein. Computing the edit-distance between unrooted ordered trees. In Proceedings of the 6th annual European Symposium on Algorithms (ESA) 1998., pages 91--102. Springer-Verlag, 1998.
Mining Protein Family Specific Residue Packing.. - Huan, Wang.. (2004) (Correct)
No context found.
P. N. Klein. Computing the edit-distance between unrooted ordered trees. In Proc. 6th Annual Enropean Symposium, pages 91--102, 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC