Abstract
We consider the problem of determining the largest tree embeddable in two labeled trees T and T′, where the embedding relation is one of subgraph isomorphism or topological embedding. This problem is a generalization of classical tree pattern matching where the problem is to determine if one labeled tree is isomorphic to a subgraph of another. In this paper, we present a general framework for the variations on the problem, for the two embedding relations and for different assumptions about labeling of nodes in the trees. Our general paradigm provides sequential and parallel algorithms for the various subproblems, many of which have no other known solutions.
Research supported by the Natural Sciences and Engineering Research Council of Canada, the Center for System Sciences and the Advanced Systems Institute.
Research supported by the Natural Sciences and Engineering Research Council of Canada and the Information Technology Research Centre.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Apostolico, S. Browne and C. Guerra, Fast linear-space computations of longest common subsequence, Theoretical Computer Science 92 (1992), pp. 3–17.
H. Alblas, Iteration of transformation passes over attributed program trees, Acta-Informatica 27 (1989), pp. 1–40.
R. Brent, The parallel evaluation of general arithmetic expressions, Journal of the ACM 21, 2 (1974), pp. 201–206.
M. J. Chung, O(n 2.5) time algorithms for the subgraph homeomorphism problem on trees, Journal of Algorithms 8, (1987), pp. 106–112.
S. Cook, A. Gupta, and V. Ramachandran, A fast parallel algorithm for formula evaluation, unpublished manuscript, October 1986.
M. Farach and M. Thorup, Fast Comparison of evolutionary trees, Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 481–488, 1984.
C.R. Finden and A.D. Gordon, Obtaining common pruned trees, Journal of Classification 2, (1985), pp. 255–276.
J. Friedman, Expressing logical formulas in natural language. Formal methods in the study of language, Part I, Math. Centrum, Amsterdam, 1981, pp. 113–130.
H. Gabow and R. Tarjan, Faster scaling algorithms for network problems, SIAM Journal on Computing 18, 5 (1989), pp. 1013–1036.
P. Gibbons, R. Karp, G. Miller, AND D. Soroker, Subtree isomorphism is in random NC, Discrete Applied Mathematics 29 (1990), pp. 35–62.
A. Gupta, A fast parallel algorithm for recognition of parenthesis languages, Master's thesis, University of Toronto, 1985.
A. Gupta and N. Nishimura, The parallel complexity of tree embedding problems, to appear in Journal of Algorithms. A preliminary version has appeared in Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, pp. 21–32, 1992.
A. Gupta and N. Nishimura, Sequential and parallel algorithms for embedding problems on classes of partial k-trees, Proceedings of the Fourth Scandinavian Workshop on Algorithm Theory, pp. 172–182, 1994.
R. Karp, E. Upfal, and A. Wigderson, Constructing a perfect matching is in random NC, Combinatorica 6, 1, pp. 35–48, 1986.
P. Kilpelainen, Tree matching problems with applications to structured text databases, Ph.D. thesis, University of Helsinki, Department of Computer Science, November 1992.
P. Kilpelainen and H. Mannila, Grammatical tree matching, Combinatorial Pattern Matching, 1992.
E. Kubicka, G. Kubicki, and F.R. McMorris, On agreement subtrees of 2 binary trees, Congressus-Numerantium 88 (1992), pp. 217–224.
A. Lingas and M. Karpinski, Subtree isomorphism is NC reducible to bipartite perfect matching, Information Processing Letters 30 (1989), pp. 27–32.
P. Materna, P. Sgall and Z. Hajicova, Linguistic constructions in transparent intensional logic, Prague-Bulletin on Mathematical Linguistics 43 (1985), pp. 5–24.
D. Matula, Subtree isomorphism in O(n 5/2), Annals of Discrete Mathematics 2 (1978), pp. 91–106.
Complexity of optimal vector code generation, Theoretical Computer Science 80 (1991), pp. 105–115.
N. Robertson and P. Seymour, Graph Minors III. Planar tree-width, Journal of Combinatorial Theory (Ser. B) 36 (1984), pp. 49–64.
N. Robertson and P. Seymour, Graph Minors II. Algorithm aspects of treewidth, Journal of Algorithms 7 (1986), pp. 309–322.
M. Steel and T. Warnow, Kaikoura tree theorems: Computing the maximum agreement subtrees. Submitted for publication.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, A., Nishimura, N. (1995). Finding largest common embeddable subtrees. In: Mayr, E.W., Puech, C. (eds) STACS 95. STACS 1995. Lecture Notes in Computer Science, vol 900. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59042-0_91
Download citation
DOI: https://doi.org/10.1007/3-540-59042-0_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59042-2
Online ISBN: 978-3-540-49175-0
eBook Packages: Springer Book Archive