Ron Shamir, Dekel Tsur  Home/Search
Context Related
| cs.haifa.ac.il/~dekelts/pu...subtree.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.haifa.ac.il/~dekelts/pub...pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the subtree isomorphism problem: Given trees H and G, find a subtree of G which is isomorphic to H or decide that there is no such subtree. We give an O((k / log k)n)-time algorithm for this problem, where k and n are the number of vertices in H and G, respectively. This improves over the O(k n) algorithms of Chung and Matula. We also give a randomized (Las Vegas) O(k n)-time algorithm for the decision problem. (Update)
Cited by: More
Frequent Subtree Mining - An Overview - Chi, Nijssen, al. (2001) (Correct)
Efficiently Mining Frequent Embedded Unordered Trees - Zaki (2005) (Correct)
Indexing and Mining Free Trees - Chi, Yang, Muntz (2003) (Correct)
Similar documents (at the sentence level):
39.1%: Faster Subtree Isomorphism - Shamir, Tsur (1999) (Correct)
Active bibliography (related documents): More All
0.2: Isochronets: a High-Speed Network Switching Architecture - Florissi (1993) (Correct)
0.2: Approximating Minimum Keys and Optimal Substructure Screens - Akutsu, Bao (Correct)
0.2: Multidimensional Linear Systems and Robust Control - Malakorn (2003) (Correct)
Similar documents based on text: More All
0.4: The maximum subforest problem: Approximation and exact.. - Shamir, Tsur (1998) (Correct)
0.3: Large Scale Sequencing by Hybridization - Shamir, Tsuri (2002) (Correct)
0.3: Improved Algorithms for the Random Cluster Graph Model - Ron Shamir Dekel (2002) (Correct)
Related documents from co-citation: More All
8: An apriori-based algorithm for mining frequent substructures from graph data - Inokuchi, Washio et al. - 2000
7: Frequent subgraph discovery - Kuramochi, Karypis - 2001
5: Tree pattern matching and subset matching in deterministic o - Cole, Hariharan et al. - 1999
BibTeX entry: (Update)
R. Shamir and D. Tsur. Faster subtree isomorphism. In Proc. of the fifth Israel Symposium on the Theory of Computing and Systems, (ISTCS 97), pages 126--131, 1997. http://citeseer.ist.psu.edu/article/shamir99faster.html More
@inproceedings{ shamir97faster,
author = "Ron Shamir and Dekel Tsur",
title = "Faster subtree isomorphism",
booktitle = "Israel Symposium on Theory of Computing Systems",
pages = "126-131",
year = "1997",
url = "citeseer.ist.psu.edu/article/shamir99faster.html" }
Citations (may not include all citations):10 the approximation of largest common subtrees and largest com.. - Akutsu, Halldorsson - 1994
5 An RNC algorithm for finding a largest common subtree of two.. (context) - Akutsu - 1992
4 Graphical representation of molecules and substructure-searc.. (context) - Anderson - 1984
4 Wadsworth International Group (context) - Behzad, Chartrand et al. - 1979
1 Pattern matching in static trees - Chauve
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://cs.haifa.ac.il/~dekelts/publications/pub.html): More
Bounds for Resequencing by Hybridization - Tsur (2003) (Correct)
Cluster Graph Modification Problems - Ron Shamir Roded (2002) (Correct)
Tradeoffs in Worst-Case Equilibria - Awerbuch, Azar, Richter, Tsur (Correct)
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