K.-C. Tai. The tree--to--tree correction problem. J. Association of Computing Machinery, 26(3):422--433, July 1979.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Mobile Computing Middleware - Mascolo, Capra, Emmerich (2002) (1 citation) (Correct)
....hosts retain replicas of the trees they were sharing while connected, and continue to be able to access and modify the data. When the two hosts reconnect, the two di#erent, possibly conflicting, replicas need to be reconciled. Xmiddle exploits the tree di#erencing techniques developed in [72] to detect di#erences between the replicas which hosts use to concurrently and o# line modify the shared data. However, it may happen that the a. b. HostA HostB HostC HostA HostB HostC Fig. 13. a. Host HB and Host HC are not connected. b. Host HB and Host HC connect and Host HB receives a ....
K. Tai. The Tree-to-Tree Correction Problem. Journal of the ACM, 29(3):422--433, 1979.
RNA secondary structure comparison: exact analysis of the.. - Dulucq, Tichit (2003) (2 citations) (Correct)
....can be 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 ....
K.-C. Tai. The tree-to-tree correction problem. In Journal of the ACM, 26(3), pages 422-433, 1979.
ApproXQL: Design and Implementation of an Approximate Pattern.. - Schlieder (2001) (2 citations) (Correct)
....Each basic transformation has a cost, which is provided by a domain expert and or the user: Definition 3 (Basic cost) A basic cost is a natural number. In Section 4.4, we shall discuss several possibilities to assign costs to basic transformations. In contrast to the tree edit distance [Tai79] we do not allow arbitrary sequences of insert, delete, and rename operations. We restrict the basic transformations in order to generate only queries that have an intuitive semantics. For example, it is not allowed to delete all leaves of the original query, since every leaf captures ....
....relaxations and enforcements of query transformations (see Section 5) 8. Related Work Our work has three related areas: distance metrics for trees, query languages for XML, and structured queries in information retrieval. Several measures for the similarity of trees have been developed [Tai79, JWZ94] Our approach is di#erent concerning its semantics and concerning its computational complexity. We believe that the nodes of a tree shaped query pattern should be treated di#erently: Leaf nodes specify the information the user is looking for. The root node defines the scope of the search. ....
K.-C. Tai. The tree-to-tree correction problem. Journal of the ACM, 26(3):422--433, July 1979.
Similarity Search in XML Data using Cost-Based Query.. - Schlieder (2001) (6 citations) (Correct)
....tree, several results may exist, and several embeddings may lead to the same result. Figure 2 shows an embedding of a query tree into a data tree. Approximate tree embedding is based on the query transformations renaming, insertion, and deletion of nodes. In contrast to the tree edit distance [Tai79], we do not allow arbitrary sequences of basic transformations. The main purposes of these restrictions are (1) to generate only queries that are semantically useful, and (2) to avoid combinatorial e#ects that make the problem NP hard [AG97] Renaming: Renaming nodes means changing the context ....
K.-C. Tai. The tree-to-tree correction problem. Journal of the ACM, 26(3):422--433, July 1979.
Thresher: Automating the Unwrapping of Semantic - Content From The (2005) (Correct)
No context found.
K.-C. Tai. The tree--to--tree correction problem. J. Association of Computing Machinery, 26(3):422--433, July 1979.
Approximate Matching of Hierarchical Data Using pq-Grams - Augsten, Böhlen, Gamper (2005) (Correct)
No context found.
K.-C. Tai. The tree-to-tree correction problem. Journal of the ACM (JACM), 26(3):422--433, July 1979.
A Multiple Graph Layers Model with - Application To Rna (Correct)
No context found.
Kuo-Chung Tai. The tree-to-tree correction problem. J. ACM, 26(3):422--433, 1979.
A Linear Tree Edit Distance Algorithm for Similar Ordered Trees - Touzet (2005) (Correct)
No context found.
K.C. Tai. The tree-to-tree correction problem. Journal of the Association for Comput. Machi., 26:422--433, 1979.
A New Distance for High Level RNA - Secondary Structure Comparison (Correct)
No context found.
K.-C. Tai, "The Tree-to-Tree Correction Problem," J. ACM, vol. 26, no. 3, pp. 422-433, 1979.
Thresher: Automating the Unwrapping of Semantic - Content From The (2005) (Correct)
No context found.
K.-C. Tai. The tree--to--tree correction problem. J. Association of Computing Machinery, 26(3):422--433, July 1979. 95
Thresher: Automating the Unwrapping of Semantic Content from.. - Hogue, Karger (2005) (Correct)
No context found.
K.-C. Tai. The tree--to--tree correction problem. J. Association of Computing Machinery, 26(3):422--433, July 1979. 95
Automatic Web News Extraction Using Tree Edit Distance - Reis, Golgher, Laender, Silva (2004) (5 citations) (Correct)
No context found.
K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422--433, 1979.
Mapping Dependencies Trees: An Application to Question.. - Punyakanok, Roth, Yih (2004) (Correct)
No context found.
K. Tai. The tree-to-tree correction problem. Journal of the Association for Computing Machinery, 26(3):422--433, July 1979.
XML Diff and Patch Tool - Komvoteas (2003) (Correct)
No context found.
K. Tai. "The tree-to-tree correction problem", Journal of the ACM, 26(3), July 1979, p. 422-433.
Efficient Tree-Matching Methods for Accurate.. - Aoki, Yamaguchi.. (2003) (Correct)
No context found.
Tai, K., The tree-to-tree correction problem, Journal of the ACM, 26:422--433, 1979.
A comparative study for XML change detection - Cobéna, Abdessalem.. (2002) (Correct)
No context found.
TAI K., "The tree-to-tree correction problem", Journal of the ACM, 26(3), july 1979, p. 422-433.
Wrapper Induction for End-User Semantic Content Development - Hogue, Karger (2004) (Correct)
No context found.
K.-C. Tai. The tree--to--tree correction problem. J. Association of Computing Machinery, 26(3):422--433, July 1979.
Matching Hierarchical Structures for Shape Recognition - Torsello (2004) (Correct)
No context found.
K-C Tai, The tree-to-tree correction problem, J. of the ACM, 26:422-- 433, 1979.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
Kuo-Chung Tai. The tree-to-tree correction problem. Journal of the Association for Computing Machinery (JACM), 26:422--433, 1979. 20
An XML-based Query Mechanism to - Augment Awareness In (2003) (Correct)
No context found.
K. C. Tai. The tree-to-tree correction problem. Journal of the ACM, 26(3):422--433, 1979.
An Edit Distance Between Quotiented Trees - Pascal Ferraro Christophe (2003) (1 citation) (Correct)
No context found.
K.-C. Tai, The tree-to-tree correction problem, Journal of the Association for Computing Machinery, pp. 422433, 1979.
Compatibility of XML Language Versions - Dui, Emmerich (2003) (Correct)
No context found.
K.Tai. The Tree-to-Tree Correction Problem. Journal of the ACM, 29(3):422--433, 1979.
Detecting Changes in XML Documents - Cobena, Abiteboul, Marian (2001) (33 citations) (Correct)
No context found.
K. Tai. The tree-to-tree correction problem. In Journal of the ACM, 26(3), pages 422--433, july 1979.
Identifying Syntactic Differences Between Two Programs - Yang (1991) (16 citations) (Correct)
No context found.
K. Tai, `The tree-to-tree correction problem', J. ACM, 26, (3), 422--433 (1979).
Evaluating Structural Similarity in XML Documents - Nierman, Jagadish (2002) (7 citations) (Correct)
No context found.
K. C. Tai. The tree-to-tree correction problem. Journal of the ACM, 26:422--433, 1979.
First 50 documents Next 50
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