Abstract
Given a graph G = (V,E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u, v)∈ E if and only if d T (u, v)≤ k. If the vertices in V are also allowed to be internal nodes in T, then we have the Steiner k-Root Problem. Moreover, if a particular subset S of V are required to be internal nodes in T, then we have the Restricted Steiner k-Root Problem. Phylogenetic k-roots and Steiner k-roots extend the standard notion of graph roots and are motivated by applications in computational biology. In this paper, we first present O(n + e)-time algorithms to determine if a (not necessarily connected) graph G = (V,E) has an S-restricted 1-root Steiner tree for a given subset S⊂V , and to determine if a connected graph G = (V,E) has an S-restricted 2-root Steiner tree for a given subset S⊂V , where n = ∣V∣ and e = ∣E∣. We then use these two algorithms as subroutines to design O(n + e)-time algorithms to determine if a given (not necessarily connected) graph G = (V,E) has a 3-root phylogeny and to determine if a given connected graph G = (V,E) has a 4-root phylogeny.
Supported in part by NSERC Research Grant OGP0046613 and a CITO grant.
Supported in part by NSERC Research Grant 160321 and a CITO grant.
Supported in part by NSERC Research Grant OGP0046613 and a UCR startup grant.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. Brandstadt, V.B. Le, and J.P. Spinrad. Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
F. Gavril. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, 1:180–187, 1972.
P.E. Kearney and D.G. Corneil. Tree powers. Journal of Algorithms, 29:111–131, 1998.
Y.-L. Lin and S.S. Skiena. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics, 8:99–118, 1995.
R. Motwani and M. Sudan. Computing roots of graphs is hard. Discrete Applied Mathematics, 54:81–88, 1994.
N. Nishimura, P. Ragde, and D.M. Thilikos. On graph powers for leaf-labeled trees. In Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory (SWAT 2000), 2000. To appear.
D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266–283, 1976.
R.E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13:566–579, 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, GH., Kearney, P.E., Jiang, T. (2000). Phylogenetic k-Root and Steiner k-Root. In: Goos, G., Hartmanis, J., van Leeuwen, J., Lee, D.T., Teng, SH. (eds) Algorithms and Computation. ISAAC 2000. Lecture Notes in Computer Science, vol 1969. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40996-3_46
Download citation
DOI: https://doi.org/10.1007/3-540-40996-3_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41255-7
Online ISBN: 978-3-540-40996-0
eBook Packages: Springer Book Archive