Abstract
Reconstruction of an evolutionary history for a set of organisms is an important research subject in computational biology. One approach motivated by graph theory constructs a relationship graph based on pairwise evolutionary closeness. The approach builds a tree representation equivalent to this graph such that leaves, corresponding to the organisms, are within a specified distance of k in the tree if connected in the relationship graph. This problem, the k-th phylogenetic root construction, has known linear time algorithms for k ≤ 4. However, the computational complexity is unknown when k ≥ 5. We present a polynomial time algorithm for strictly chordal relationship graphs when k = 5.
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
Brandstadt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)
Haenni, R., Lehmann, N.: Efficient hypertree construction. Technical Report 99-3, Institute of Informatics, University of Fribourg (1999)
Kearney, P.E., Corneil, D.G.: Tree powers. Journal of Algorithms 29(1), 111–131 (1998)
Kennedy, W., Lin, G., Yan, G.: Strictly chordal graphs are leaf powers. Journal of Discrete Algorithms (2005)
Kong, H., Yan, G.: Algorithm for phylogenetic 5-root problem (2003) (unpublished)
Lin, G., Jiang, T., Kearney, P.E.: Phylogenetic k-root and steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 539–551. Springer, Heidelberg (2000)
Lin, G., Kennedy, W., Kong, H., Yan, G.: The 5-root phylogeny construction for tree chordal graphs. Submitted to Discrete Applied Mathematics (2005)
Lin, Y.L., Skiena, S.S.: Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics 8, 99–118 (1995)
Motwani, R., Sudan, M.: Computing roots of graphs is hard. Discrete Applied Mathematics 54, 81–88 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kennedy, W., Lin, G. (2005). 5-th Phylogenetic Root Construction for Strictly Chordal Graphs. In: Deng, X., Du, DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11602613_74
Download citation
DOI: https://doi.org/10.1007/11602613_74
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30935-2
Online ISBN: 978-3-540-32426-3
eBook Packages: Computer ScienceComputer Science (R0)