Abstract
Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the similarity data are represented as a graph G = (V, E) where each vertex represents a species and two vertices are adjacent if they represent species of high similarity. The phylogeny reconstruction problem can then be abstracted as the problem of finding a (phylogenetic) tree T from the given graph G such that (1) T has no degree-2 internal nodes, (2) the external nodes (i.e. leaves) of T are exactly the elements of V, and (3) (u, v) ∈ E if and only if d t (u,v) ≤ k for some fixed threshold k, where d t (u,v) denotes the distance between u and v in tree T. This is called the Phylogenetic KTH Root Problem (PRk), and such a tree T, if exists, is called a phylogenetic kth root of graph G. The computational complexity of PRk is open, except for k ≤ 4. In this paper, we investigate PRk under a natural restriction that the maximum degree of the phylogenetic root is bounded from above by a constant. Our main contribution is a linear-time algorithm that determines if G has such a phylogenetic kth root, and if so, demonstrates one. On the other hand, as in practice the collected similarity data are usually not perfect and may contain errors, we propose to study a generalized version of PRk where the output phylogeny is only required to be an approximate root of the input graph. We show that this and other related problems are computationally intractable.
Supported in part by the Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan, under Grant No. 12780241. Work done while visiting at UC Riverside.
Supported in part by a UCR startup grant and NSF Grants CCR-9988353 and ITR-0085910.
Supported in part by NSERC Research Grant OGP0046613 and a CITO grant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H.L. Bodlaender. Nc-algorithms for graphs with small treewidth. In The 14th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 1988), LNCS 344, pages 1–10, 1989.
A. Brandstädt, V.B. Le, and J.P. Spinrad. Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, 1999.
Z.-Z. Chen, T. Jiang, and G.-H. Lin. Computing phylogenetic roots with bounded degrees and errors. Manuscript, Department of Computer Science, University of Waterloo, April 2001.
T. Jiang, G.-H. Lin, and J. Xu. On the closest tree kth root problem. Manuscript, Department of Computer Science, University of Waterloo, November 2000.
P.E. Kearney and D.G. Corneil. Tree powers. Journal of Algorithms, 29:111–131, 1998.
T. Kloks. Treewidth. LNCS 842. Springer-Verlag, Berlin, 1994.
M. Křivánek and J. Moránek. NP-hard problems in hierarchical-tree clustering. Acta Informatica, 23:311–323, 1986.
G.-H. Lin, P.E. Kearney, and T. Jiang. Phylogenetic k-root and Steiner k-root. In The 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000), LNCS 1969, pages 539–551, 2000.
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 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000), LNCS 1851, pages 125–138, 2000.
D.L. Swofford, G.J. Olsen, P.J. Waddell, and D.M. Hillis. Phylogenetic inference. In D.M. Hillis, C. Moritz, and B.K. Mable, editors, Molecular Systematics (2nd Edition), pages 407–514. Sinauer Associates, Sunderland, Massachusetts, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, ZZ., Jiang, T., Lin, GH. (2001). Computing Phylogenetic Roots with Bounded Degrees and Errors. In: Dehne, F., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 2001. Lecture Notes in Computer Science, vol 2125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44634-6_35
Download citation
DOI: https://doi.org/10.1007/3-540-44634-6_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42423-9
Online ISBN: 978-3-540-44634-7
eBook Packages: Springer Book Archive