Constrained tree inclusion

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 431-447

  Valiente, Gabriel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Combinatorial algorithms; Noncrossing bipartite matching; Subtree homeomorphism; Subtree isomorphism; Tree inclusion; Tree pattern matching

Indexed keywords

COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; PATTERN MATCHING; POLYNOMIALS; PROBLEM SOLVING; QUERY LANGUAGES;

COMBINATORIAL ALGORITHMS; NONCROSSING BIPARTITE MATCHING; SUBTREE HOMEOMORPHISM; SUBTREE ISOMORPHISM; TREE INCLUSION; TREE PATTERN MATCHING;

TREES (MATHEMATICS);

EID: 18544366254     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.017     Document Type: Conference Paper

References (34)

1. D.E. Knuth Fundamental Algorithms, vol. 1: The Art of Computer Programming third ed. 1997 Addison-Wesley Reading MA
2. P. Kilpeläinen, and H. Mannila Ordered and unordered tree inclusion SIAM J. Comput. 24 2 1995 340 356
3. S. Abiteboul, P. Buneman, and D. Suciu Data on the Web: From Relations to Semistructured Data and XML 2000 Morgan Kaufmann
4. P. Kilpeläinen, and H. Mannila Retrieval from hierarchical texts by partial patterns Proc. 16th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval 1993 ACM Press 214 222
5. T. Schlieder, and H. Meuss Querying and ranking XML documents J. Amer. Soc. Inform. Sci. Technol. 53 6 2002 489 503
6. N. Nishimura, P. Ragde, and D.M. Thilikos Finding smallest supertrees under minor containment Internat. J. Found. Comput. Sci. 11 3 2000 445 465
7. J. Matoušek, and R. Thomas On the complexity of finding isomorphisms and other morphisms for partial k-trees Discrete Math. 108 1-3 1992 343 364
8. L. Alonso, and R. Schott On the tree inclusion problem Acta Informatica 37 9 2001 653 670
9. W. Chen More efficient algorithm for ordered tree inclusion J. Algorithms 26 2 1998 370 385
10. T. Richter A new algorithm for the ordered tree inclusion problem Proc. 8th Annual Symp. Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 1264 1997 Springer-Verlag Berlin 150 166
11. M.-J. Chung O (n 2.5) time algorithms for the subgraph homeomorphism problem on trees J. Algorithms 8 1 1987 106 112
12. R. Shamir, and D. Tsur Faster subtree isomorphism J. Algorithms 33 2 1999 267 280
13. R.Y. Pinter, O. Rokhlenko, D. Tsur, and M. Ziv-Ukelson Approximate labelled subtree homeomorphism Proc. 15th Annual Symp. Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 3109 2004 Springer-Verlag Berlin 55 69
14. K. Zhang Efficient parallel algorithms for tree editing problems Proc. 7th Annual Symp. Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 1075 1996 Springer-Verlag Berlin 361 372
15. K. Zhang, J.T.-L. Wang, and D. Shasha On the editing distance between undirected acyclic graphs Internat. J. Found. Comput. Sci. 7 1 1996 43 57
16. J.E. Hopcroft, and R.M. Karp An n 5 / 2 algorithm for maximum matchings in bipartite graphs SIAM J. Comput. 2 4 1973 225 231
17. G. Valiente Algorithms on Trees and Graphs 2002 Springer-Verlag Berlin
18. A. Apostolico, and M. Crochemore Optimal canonization of all substrings of a string Inform. and Comput. 95 1 1991 76 95
19. R.M. Karp, and M.O. Rabin Efficient randomized pattern-matching algorithms IBM J. Res. Develop. 31 2 1987 249 260
20. D.E. Knuth, J.H.M. Jr., V.R. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (2) (1977) 323-350
21. F. Malucelli, T. Ottmann, and D. Pretolani Efficient labelling algorithms for the maximum noncrossing matching problem Discrete Appl. Math. 47 2 1993 175 179
22. M.-S. Yu, L.Y. Tseng, and S.-J. Chang Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs Inform. Process. Lett. 46 1 1993 7 11
23. D.W. Matula Subtree isomorphism in O (n 5 / 2) Ann. Discrete Math. 2 1 1978 91 106
24. S.W. Reyner An analysis of a good algorithm for the subtree problem SIAM J. Comput. 6 4 1977 730 732
25. R.M. Verma, and S.W. Reyner An analysis of a good algorithm for the subtree problem, corrected SIAM J. Comput. 18 5 1989 906 908
26. A.T. Berztiss Data Structures: Theory and Practice second ed. 1975 Academic Press New York
27. G. Valiente On the algorithm of Berztiss for tree pattern matching Proc. 5th Mexican Internat. Conf. Computer Science 2004 IEEE Computer Science Press Piscataway, NJ
28. P. Dublish Some comments on the subtree isomorphism problem for ordered trees Inform. Process. Lett. 36 5 1990 273 275
29. R. Grossi A note on the subtree isomorphism for ordered trees and related problems Inform. Process. Lett. 39 2 1991 81 84
30. R. Grossi Further comments on the subtree isomorphism for ordered trees Inform. Process. Lett. 40 5 1991 255 256
31. E. Mäkinen On the subtree isomorphism problem for ordered trees Inform. Process. Lett. 32 5 1989 271 273
32. G. Valiente An efficient bottom-up distance between trees Proc. 8th Internat. Symp. String Processing and Information Retrieval 2001 IEEE Computer Science Press Piscataway, NJ 212 219
33. R.M. Verma Strings, trees, and patterns Inform. Process. Lett. 41 3 1992 157 161
34. G. Valiente Constrained tree inclusion Proc. 14th Annual Symp. Combinatorial Pattern Matching Lecture Notes in Computer Science vol. 2676 2003 Springer-Verlag Berlin 361 371