See this document in CiteSeerX!

Bottom-up Subtree Isomorphism for Unordered Labeled Trees (2004)  (Make Corrections)  (3 citations)
Fabrizio Luccio, Antonio Mesa Enriquez, Pablo Olivares Rieumont, Linda Pagli
Universit\`a Di Pisa



  Home/Search   Context   Related

 
View or download:
di.unipi.it/pub/techrep...TR0413.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  di.unipi.it/ricerca/TR/tr (more)
(Enter author homepages)

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

Abstract: A subtree P of a given tree T is a bottom-up subtree of T if, for each internal vertex u of P , all the children of u in T are also vertices of P . Our problem is deciding if a pattern tree P of m vertices is a bottom-up subtree of a text tree T of n vertices, m ≤ n, and, in the affirmative case, finding all the occurrences of P in T . If the vertices are labeled, the labels in the corresponding positions in P and T must match. We consider unordered rooted trees with labeled vertices, which... (Update)

Similar documents based on text:   More   All
1.3:   Exact Rooted Subtree Matching in Sublinear Time - Luccio, Enriquez, Rieumont.. (2001)   (Correct)
0.2:   ATreeGrep: Approximate Searching in Unordered Trees - Shasha, Wang, Shan, Zhang (2002)   (Correct)
0.2:   An Insight on PRAM Computational Bounds - Luccio, Pagli (1996)   (Correct)

Related documents from co-citation:   More   All
3:   the topology of multicast trees (context) - Chalmers, Almeroth - 2002
3:   CMTreeMiner: Mining both closed and maximal frequent subtrees - Chi, Yang et al. - 2004
3:   gSpan: Graph-based substructure pattern mining - Yan, Han - 2002

BibTeX entry:   (Update)

F. Luccio, A. M. Enriquez, P. O. Rieumont, and L. Pagli. Bottom-up subtree isomorphism for unordered labeled trees. Technical Report TR-04-13, Universita Di Pisa, 2004. http://citeseer.ist.psu.edu/luccio04bottomup.html   More

@misc{ luccio04bottomup,
  author = "F. Luccio and A. Enriquez and P. Rieumont and L. Pagli",
  title = "Bottom-up subtree isomorphism for unordered labeled trees",
  number = "TR-04-13", 
  institution = "Universit\`a Di Pisa",
  year = "2004",
  url = "citeseer.ist.psu.edu/luccio04bottomup.html" }
Citations (may not include all citations):
1450   The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
204   Oxford University Press (context) - Crochemore, Rytter - 1994
76   Simple fast algorithms for the editing distance between tree.. (context) - Zhang, Shasha - 1989
28   tree: a new data structure for string search in external mem.. (context) - ans, Grossi et al. - 1999
24   Faster tree pattern matching (context) - Dubiner, Galil et al. - 1994
23   An analysis of a good algorithm for the subtree problem (context) - Reyner - 1977
18   time algorithms for the subgraph homeomorphism problem on tr.. (context) - Chung - 1987
17   Tree pattern matching and subset matching in deterministic O - Cole, Hariharan et al. - 1999
11   Faster subtree isomorphism - Shamir, Tsur - 1999
8   Simple linear work sux array construction - Karkkainen, Sanders - 2003
8   Annals of Discrete Mathematics (context) - Matula, in - 1978
8   Ecient tree pattern matching (context) - Kosaraju - 1989
6   Algorithms on Trees and Graphs (context) - Valiente - 2002
5   Sorting strings and constructing digital search trees in par.. (context) - Jaja, Ryu et al. - 1996
5   the subtree isomorphism problem for ordered trees (context) - akinen - 1989
4   Approximate matching for two families of trees (context) - Luccio, Pagli - 1995
3   A note on the subtree isomorphism for ordered trees and rela.. (context) - Grossi - 1989
2   Determining tree isomorphism (context) - Zemlyachenko - 1971
1   Pattern matching in trees (context) - Hofmann, O'Donnell - 1982

Documents on the same site (http://www.di.unipi.it/ricerca/TR/tr.html):   More
The Weber Point can be Found in Linear Time for Points .. - Anderegg, Cieliebak.. (2003)   (Correct)
The Circe approach to the systematic analysis of NL requirements - Ambriola, Gervasi (2003)   (Correct)
An In-Place Sorting Algorithm - Franceschini (2003)   (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