Abstract
In the computational biology and taxonomy, to construct phylogenetic tree is an important problem. A phylogenetic tree can represent the relationship and histories for a set of species and helpful for biologists to observe existent species. One of popular model is ultrametric tree, and it assumed the evolution rate is constant. UPGMA is one of well-known ultrametric tree algorithm. However, UPGMA is a heuristic algorithm, and it can not guarantee the constructed tree is minimum size. To construct minimum ultrametric tree (MUT) has been shown to be an NP-hard problem. In this paper, we propose an efficient parallel branch-and-bound algorithm with 3-Point Relationship (3PR) to reduce the construction time dramatically. 3PR is a relationship between a distance matrix and the constructed phylogenetic tree. The main concept is for any two species closed to each other in a distance matrix should be also closed to each other in the constructed phylogenetic tree. We use this property to mark the branching path with lower priority or higher, then we move the lower ranked branching path to delay bound pool instead of remove it to ensure the optimal solution can be found. The experimental results show that our parallel algorithm can save the computing time and it also shows that parallel algorithm with 3PR can save about 25% of computing time in average.
The work is partially supported by National Science Council. (NSC 94-2213-E-216 -028).
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
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm. MIT Press, Cambridge (1990)
Day, W.H.E.: Computationally difficult parsimony problems in phylogenetic systematics. J. Theoretic Biol. 103, 429–438 (1983)
Day, W.H.E.: Computational complexity of inferring phylogenies from dissimilarity matrices. Bulletin of Math. Biol. 49, 461–467 (1987)
Day, W.H.E., Johnson, D.S., Sankoff, D.: The computational complexity of inferring rooted phylogenies by parsimony. Math. Biosci. 81, 33–42 (1986)
Fan, C.T.: The evaluation model of evolutionary tree. Master Thesis, Nationa Tsing Hua University (2000)
Foulds, L.R.: Maximum savings in the Steiner problemin phylogeny. J. Theoretic Biol. 107, 471–474 (1984)
Gusfield, D.: Algorithms on Strings, Trees, and Sequences, computer science and computational biology. Cambridge University Press, Cambridge (1997)
Hendy, M.D., Penny, D.: Branch and bound algorithms to determine minimal evolutionary trees. Math. Biol. 59, 277–290 (1982)
Kumer, S., Tamura, K., Nei, M.: MEGA: Molecular Evolutionary Genetics Analysis software for miceocomputers. Comput. Appl. Biosci. 10, 189–191 (1994)
Li, W.H.: Molecular Evolution. Sinauer Associates (1997)
Page, R.D.M.: TreeView: An application to display phylogenetic trees on personal computers. Comput. Appl. Biosci. 12, 357–358 (1996)
Vigilant, L., Stoneking, M., Harpending, H., Hawkes, K., Wilson, A.C.: African Populations and the Evolution of Human Mitochondrial DNA. Science 253, 1503–1507 (1991)
Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices. J. Combinatorial Optimization 3, 199–211 (1999)
Yu, C.F., Wah, B.W.: Efficient Branch-and-Bound Algorithms on a Two-Level Memory System. IEEE Trans. Parallel and Distributed Systems 14, 1342–1356 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, KM., Zhou, J., Lin, CY., Tang, C.Y. (2006). An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_23
Download citation
DOI: https://doi.org/10.1007/11942634_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49860-5
Online ISBN: 978-3-540-49862-9
eBook Packages: Computer ScienceComputer Science (R0)