D. Shasha, J. T.-L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate Searching in Unordered Trees. In Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), pages 89--98, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Structure-Based Search Engine for Phylogenetic Databases - Shan, Herbert, Piel.. (2002) (3 citations) Self-citation (Shasha Wang Shan) (Correct)
No context found.
D. Shasha, J. T. L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate searching in unordered trees. Submitted, 2002.
Algorithmics and Applications of Tree and Graph Searching - Shasha, Wang, Giugno (2002) (16 citations) Self-citation (Shasha Wang) (Correct)
....among the nodes of the trees. The queries can be expressed by a containment mapping. That is, one asks whether the query tree appears, or approximately appears, in a data tree. Here, the approximation is measured by the number of paths in the query tree that do not appear in the data tree [84], or by some other distance functions [22, 23, 24, 85, 96, 104, 107] The query tree may contain don t cares or wildcards [72] There are xed length don t cares (FLDCs) that may match a single node and variable length don t cares (VLDCs) 84] We shall refer to this class of ....
.... tree that do not appear in the data tree [84] or by some other distance functions [22, 23, 24, 85, 96, 104, 107] The query tree may contain don t cares or wildcards [72] There are xed length don t cares (FLDCs) that may match a single node and variable length don t cares (VLDCs) [84]. We shall refer to this class of queries as approximate containment (AC) queries. In general, a query tree may contain redundant nodes, removal of which would not a ect answers to the query. AmerYahia, Srivastava, and colleagues [8, 9] developed algorithms for minimizing a query tree, both in ....
D. Shasha, J. T. L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate searching in unordered trees. Submitted, 2002.
On-line Aggregation and Filtering of Pattern-based Queries - Cedric Du Mouza (Correct)
No context found.
D. Shasha, J. T.-L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate Searching in Unordered Trees. In Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), pages 89--98, 2002.
Frequent Subtree Mining - An Overview - Chi, Nijssen, al. (2001) (1 citation) (Correct)
No context found.
Shasha, D., Wang, J. T. L., Shan, H., Zhang, K.: ATreeGrep: Approximate Searching in Unordered Trees, 14th International Conference on Scientific and Statistical Database Management (SSDBM'02), July 2002.
HybridTreeMiner: An Efficient Algorithm for Mining Frequent.. - Chi, Yang, Muntz (2004) (Correct)
No context found.
D. Shasha, J. T. L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate searching in unordered trees. In Proc. of the 14th Intl. Conf. on Scientific and Statistical Database Management (SSDBM'02), 2002.
On-line Aggregation and Filtering of Pattern-based Queries - Cedric Du Mouza (Correct)
No context found.
D. Shasha, J. T.-L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate Searching in Unordered Trees. In Proc. Intl. Conf. on Scientific and Statistical Databases (SSDBM), pages 89--98, 2002.
Hierarchies in HTML Documents: Linking Text to Concepts - Burget (2004) (Correct)
No context found.
D. Shasha, J.T.L Wang, H. Shan, K. Zhang. "ATreeGrep: Approximate Searching in Unordered Trees", 14th International Conference on Scientific and Statistical Database Management (SSDBM'02) Edinburgh, Scotland, 2002
Visual HTML Document Modeling for Information Extraction - Burget (2005) (Correct)
No context found.
Shasha, D., Wang, J.T.L., Shan, H., Zhang, K.: ATreeGrep: Approximate Searching in Unordered Trees. In 14th International Conference on Scientific and Statistical Database Management (SSDBM'02) Edinburgh, Scotland, 2002
Approximate Subtree Identification in Heterogeneous.. - Sanz, Mesiti.. (Correct)
No context found.
Shasha, D., Wang, J.T.L., Shan, H., Zhang, K.: ATreeGrep: Approximate Searching in Unordered Trees. In: 14th International Conference on Scientific and Statistical Database Management. (2002) 89--98
Frequent Subtree Mining - An Overview - Chi, Nijssen, Muntz, Kok (2005) (1 citation) (Correct)
No context found.
Shasha, D., Wang, J. T. L., Shan, H., Zhang, K.: ATreeGrep: Approximate Searching in Unordered Trees, 14th International Conference on Scientific and Statistical Database Management (SSDBM'02), July 2002.
HybridTreeMiner: An Efficient Algorithm for Mining Frequent.. - Chi, Yang, Muntz (2004) (Correct)
No context found.
D. Shasha, J. T. L. Wang, H. Shan, and K. Zhang. ATreeGrep: Approximate searching in unordered trees. In Proc. of the 14th Intl. Conf. on Scientific and Statistical Database Management (SSDBM'02), 2002.
Tree Edit Distance, Alignment Distance and Inclusion - Bille (2003) (Correct)
No context found.
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, and Kaizhong Zhang. Atreegrep: Approximate searching in unordered trees. In Proceedings of the 14th International Conference on Scientific and Statistical Database Management, pages 89--98, 2002.
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