See this document in CiteSeerX!

On Matching Nodes Between Trees (2003)  (Make Corrections)  
Li Zhang



  Home/Search   Context   Related

 
View or download:
hp.com/techreports/20...HPL200367.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  hp.com/techreports/...HPL200367 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Consider two rooted leaf-labeled trees T 1 , T 2 . Define the similarity between two internal nodes, one from each tree, to be |A#B| , where A, B are the sets of the leaves under the two nodes, respectively. In this paper, we consider the problem of computing for every node in T 1 , the best matching node in T 2 under the above similarity measure. (Update)

Active bibliography (related documents):   More   All
1.9:   Building Trees, Hunting for Trees, and Comparing Trees - Theory.. - Bryant (1997)   (Correct)
0.2:   A Biologically Meaningful Model for Comparing Molecular.. - Mirkin, Muchnik, Smith (1995)   (Correct)
0.2:   A Randomized Linear-time Majority Tree Algorithm - Nina Amenta Frederick   (Correct)

Similar documents based on text:   More   All
0.1:   TreeJuxtaposer: Scalable Tree Comparison using.. - Guaranteed Visibility.. (2003)   (Correct)
0.1:   An Authorization Infrastructure for Nomadic Computing - Zhang, Kindberg (2001)   (Correct)
0.1:   Building Low-maintenance Expressways - For Systems Zhichen (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ zhang-matching,
  author = "Li Zhang",
  title = "On Matching Nodes Between Trees",
  url = "citeseer.ist.psu.edu/zhang03matching.html" }
Citations (may not include all citations):
214   Davenport-Schinzel Sequences and Their Geometric Application.. - Sharir, Agarwal - 1995
183   A data structure for dynamic trees (context) - Sleator, Tarjan - 1983
164   Society for Industrial and Applied Mathematics (context) - Tarjan, Network - 1983
136   Syntactic clustering of the Web (context) - Broder, Glassman et al. - 1997
136   Fast algorithms for finding nearest common ancestors (context) - Harel, Tarjan - 1984
67   the resemblance and containment of documents - Broder - 1998
28   SCAM: A copy detection mechanism for digital documents - Shivakumar, Garca-Molina - 1995
15   Optimal algorithms for comparing trees with labeled leaves (context) - Day - 1985
8   Consensus techniques and the comparison of taxonomic trees (context) - Adams - 1972
7   Bulletin of Mathematical Biology (context) - Margush, McMorris - 1981
2   Museum of Natural History (context) - Wiley, Siegel-Causey et al. - 1991
2   Bulletin of Mathematical Biology (context) - Stinebrickner, indices - 1984
2   Consensu index method: an additional axiom (context) - Stinebrickner - 1986
1   Taxonomic congruence in the Leptopodomorpha re-examined (context) - Sokal, Rohlf - 1981

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