Constrained tree inclusion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2676, Issue , 2003, Pages 361-371

  Valiente, Gabriel ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Noncrossing bipartite matching; Subtree homeomorphism; Tree inclusion; Tree pattern matching

Indexed keywords

PATTERN MATCHING; POLYNOMIAL APPROXIMATION;

LABELED TREES; NONCROSSING BIPARTITE MATCHING; PATTERN TREES; POLYNOMIAL-TIME; SUBTREE HOMEOMORPHISM; TREE INCLUSION; TREE-PATTERN MATCHING; UNORDERED TREES;

TREES (MATHEMATICS);

EID: 35248894851     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_26     Document Type: Article

References (28)

1. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 2000.
2. L. Alonso and R. Schott. On the tree inclusion problem. Acta Informatica, 37(9):653-670, 2001.
3. A. T. Berztiss. Data Structures: Theory and Practice. Academic Press, New York, 2nd edition, 1975.
4. W. Chen. More efficient algorithm for ordered tree inclusion. Journal of Algorithms, 26(2):370-385, 1998.
5. 2.5) time algorithms for the subgraph homeomorphism problem on trees. Journal of Algorithms, 8(1):106-112, 1987.
6. P. Dublish. Some comments on the subtree isomorphism problem for ordered trees. Information Processing Letters, 36(5):273-275, 1990.
7. R. Grossi. Further comments on the subtree isomorphism for ordered trees. Information Processing Letters, 40(5):255-256, 1991.
8. R. Grossi. A note on the subtree isomorphism for ordered trees and related problems. Information Processing Letters, 39(2):81-84, 1991.
9. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225-231, 1973.
10. P. Kilpeläinen and H. Mannila. Retrieval from hierarchical texts by partial patterns. In Proc. 16th Annual Int. ACM SIGIR Conf. Research and Development in Information Retrieval, pages 214-222. ACM Press, 1993.
11. P. Kilpeläinen and H. Mannila. Ordered and unordered tree inclusion. SIAM Journal on Computing, 24(2):340-356, 1995.
12. D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading MA, 3rd edition, 1997.
13. E. Mäkinen. On the subtree isomorphism problem for ordered trees. Information Processing Letters, 32(5):271-273, 1989.
14. F. Malucelli, T. Ottmann, and D. Pretolani. Efficient labelling algorithms for the maximum noncrossing matching problem. Discrete Applied Mathematics, 47(2):175-179, 1993.
15. J. Matoušek and R. Thomas. On the complexity of finding isomorphisms and other morphisms for partial k-trees. Discrete Mathematics, 108(1-3):343-364, 1992.
16. 5/2). Annals of Discrete Mathematics, 2(1):91-106, 1978.
17. N. Nishimura, P. Ragde, and D. M. Thilikos. Finding smallest supertrees under minor containment. Int. Journal of Foundations of Computer Science, 11(3):445-465, 2000.
18. S. W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM Journal on Computing, 6(4):730-732, 1977.
19. T. Richter. A new algorithm for the ordered tree inclusion problem. In Proc. 8th Annual Symp. Combinatorial Pattern Matching, volume 1264 of Lecture Notes in Computer Science, pages 150-166. Springer-Verlag, 1997.
20. T. Schlieder and H. Meuss. Querying and ranking XML documents. Journal of the American Society for Information Science and Technology, 53(6):489-503, 2002.
21. R. Shamir and D. Tsur. Faster subtree isomorphism. Journal of Algorithms, 33(2):267-280, 1999.
22. G. Valiente. An efficient bottom-up distance between trees. In Proc. 8th Int. Symp. String Processing and Information Retrieval, pages 212-219, Piscataway NJ, 2001. IEEE Computer Science Press.
23. G. Valiente. Algorithms on Trees and Graphs. Springer-Verlag, Berlin, 2002.
24. R. M. Verma. Strings, trees, and patterns. Information Processing Letters, 41(3):157-161, 1992.
25. R. M. Verma and S. W. Reyner. An analysis of a good algorithm for the subtree problem, corrected. SIAM Journal on Computing, 18(5):906-908, 1989.
26. M.-S. Yu, L. Y. Tseng, and S.-J. Chang. Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs. Information Processing Letters, 46(1):7-11, 1993.
27. K. Zhang. Efficient parallel algorithms for tree editing problems. In Proc. 7th Annual Symp. Combinatorial Pattern Matching, volume 1075 of Lecture Notes in Computer Science, pages 361-372, Berlin Heidelberg, 1996. Springer-Verlag.
28. K. Zhang, J. T.-L. Wang, and D. Shasha. On the editing distance between undirected acyclic graphs. International Journal of Foundations of Computer Science, 7(1):43-57, 1996.