Finding largest subtrees and smallest supertrees

Algorithmica (New York)

Volumn 21, Issue 2, 1998, Pages 183-210

  Gupta, A ^a   Nishimura, N ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Largest common subtree; Smallest common supertree; Subgraph isomorphism; Topological embedding

Indexed keywords

EID: 0041640265     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009212     Document Type: Article

References (36)

1. H. Alblas. Iteration of transformation passes over attributed program trees. Acta Informatica, 27:1-40, 1989.
2. R. Brent. The parallel evaluation of general arithmetic expressions. Journal of the ACM, 21(2):201-206, 1974.
3. 2.5) time algorithms for the subgraph homeomorphism problem on trees. Journal of Algorithms, 8:106-112, 1987.
4. R. Cole and R. Hariharan. An O(n log n) algorithm for the maximum agreement subtree problem for binary trees. In Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 323-332, 1996.
5. M. Dubiner, Z. Galil, and E. Magen. Faster tree pattern matching. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 145-150, 1990.
6. M. Farach, T. Przytycka, and M. Thorup. On the agreement of many trees. Information Processing Letters, 55(6):297-301, 1995.
7. M. Farach and M. Thorup. Fast comparison of evolutionary trees. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 481-488, 1994.
8. M. Farach and M. Thorup. Optimal evolutionary tree comparison by sparse dynamic programming. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 770-779, 1994.
9. C. R. Finden and A. D. Gordon. Obtaining common pruned trees. Journal of Classification, 2:255-276, 1985.
10. J. Friedman. Expressing logical formulas in natural language. In Formal Methods in the Study of Language, Part I, pages 113-130. Math. Centrum, Amsterdam, 1981.
11. H. Gabow and R. Tarjan. Faster scaling algorithms for network problems. SIAM Journal on Computing, 18(5):1013-1036, 1989.
12. P. Gibbons, R. Karp, G. Miller, and D. Soroker. Subtree isomorphism is in random NC. Discrete Applied Mathematics, 29:35-62, 1990.
13. R. Grossi. On finding common subtrees. Theoretical Computer Science, 108:345-356, 1993.
14. A. Gupta and N. Nishimura. Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory, pages 172-182, 1994.
15. A. Gupta and N. Nishimura. Finding largest common embeddable subtrees. In Proceedings of the Twelfth Annual Symposium on Theoretical Aspects of Computer Science, pages 397-408, 1995.
16. A. Gupta and N. Nishimura. Finding smallest supertrees. In Proceedings of the Sixth Annual International Symposium on Algorithms and Computation, pages 112-121, December 1995.
17. A. Gupta and N. Nishimura. The parallel complexity of tree embedding problems. Journal of Algorithms, 18(1):176-200, 1995.
18. T. Jiang, L. Wang, and K. Zhang. Alignment of trees - an alternative to tree edit. In Combinatorial Pattern Matching, pages 75-86, 1994.
19. R. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. Handbook of Theoretical Computer Science, Vol. A, pages 869-941. MIT Press, Cambridge, 1990.
20. D. Keselman and A. Amir. Maximum agreement subtree in a set of evolutionary trees - metrics and efficient algorithms. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 758-769, 1994.
21. P. Kilpeläinen. Tree matching problems with applications to structured text databases. Ph.D. thesis, Department of Computer Science, University of Helsinki, November 1992.
22. P. Kilpeläinen and H. Mannila. Grammatical tree matching. In Combinatorial Pattern Matching, pages 162-174, 1992.
23. P. Kilpeläinen and H. Mannila. Ordered and unordered tree inclusion. SIAM Journal on Computing, 24(2):340-356, 1995.
24. S. R. Kosaraju. Efficient tree pattern matching. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 178-183, 1989.
25. E. Kubicka, G. Kubicki, and F. R. McMorris. On agreement subtrees of 2 binary trees. Congressus Numerantium, 88:217-224, 1992.
26. A. Lingas and M. Karpinski. Subtree isomorphism is NC reducible to bipartite perfect matching. Information Processing Letters, pages 27-32, 1989.
27. P. Materna, P. Sgall, and Z. Hajicova. Linguistic constructions in transparent intentional logic. Prague Bulletin on Mathematical Linguistics, 30:27-32, 1985.
28. 5/2). Annals of Discrete Mathematics, 2:91-106, 1978.
29. K. Mulmuley, U. Vazirani, and V. Vazirani. Matching is as easy as matrix inversion. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pages 345-354, 1987.
30. P. Powell and V. Ngo. Complexity of optimal vector code generation. Theoretical Computer Science, 80:105-115, 1991.
31. S. W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM Journal on Computing, 6(4):730-732, 1977.
32. N. Robertson and P. Seymour. Graph minors III. Planar tree-width. Journal of Combinatorial Theory (Series B), 36:49-64, 1984.
33. N. Robertson and P. Seymour. Graph minors II. Algorithmic aspects of tree-width. Journal of Algorithms, 7:309-322, 1986.
34. M. Steel and T. Warnow. Kaikoura tree theorems: computing the maximum agreement subtree. Information Processing Letters, 48:72-82, 1993.
35. 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.
36. T. Warnow. Tree compatibility and inferring evolutionary history. In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 382-391, 1993.