Abstract
To construct an evolutionary tree is an important topic in computational biology. An evolutionary tree can symbolize the relationship and histories for a set of species. There are many models had been proposed to resolve these problems. However, most of them are NP-hard problem. Ultrametric tree is one of the most popular models, it is used by a well-accepted tree construction method–Unweighted Pair Group Method with Arithmetic Mean, which is widely used by biologists to observe the relationship among species. However, it is a heuristic algorithm. In this paper, we proposed a 3-Points relationship (3PR) based parallel algorithm to solve this problem. 3PR is a relationship between distance matrix and constructed evolutionary trees. The main concept is for any triplet species, two species closer to each other in distance matrix should be closer to each other in evolutionary tree. Then we combined this property and branch-and-bound strategy to reduce the computation time to obtain the optimal solution. Moreover, we put the lower ranked path which is determined by3PR to delay bound pool (DBP) to accelerate the algorithm execution. DBP is a mechanism which can store the lower ranked path and can be helping algorithm to find a better bounding values speedily. The experimental results show that our proposed algorithm can reduce the computation time compared with algorithm without 3PR. Moreover, it also shows 3PR can reduce the computation time when number of computing nodes increasing.
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
David, M.H., James, J.B., Mary, E.W., Marty, R.B., Ian, J.M.: Experimental Phylogenetics: Generation of a Known Phlogeny. Science 255(5044), 589–592 (1992)
Fan, C.T.: The evaluation of evolutionary tree. Master Thesis, National Tsing Hua University (2000)
Farach, M., Kannan, S., Warnow, T.: A robust model for finding optimal evolutionary trees. Algorithmica 13, 155–179 (1995)
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 algorithm to determine minimal evolutionary trees. Mathematical Biosciences 59, 277–290 (1982)
Janakiram, V.K., Agrawal, D.P., Mehrotra, R.: A randomized parallel branch-and-bound algorithm. In: Proc. Int. Conf. Prallel Process, pp. 69–75 (1988)
Krivanek, M.: The complexity of ultrametric partitions on graphs. Information Processing Letter 27(5), 265–270 (1988)
Lawler, E.L., Wood, D.W.: Branch-and-bound methods: A survey. Oper. Res. 14, 699–719 (1966)
Li, W.H.: Molecular Evolution. Sinauer Associates, Inc (1997)
Li, W.H., Graur, D.: Fundamentals of Molecular Evolution. Sinauer Associates (1991)
Linda, V., Mark, S., Henry, H., Kristen, H., Allan, C.W.: African Populations and the Evolution of Human Mitochondrial DNA. Science 253(5027), 1503–1507 (1991)
Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation and Exact Algorithm for Constructing Minimum Ultrametric Trees from Distance Matrices. J. of Combinatorial Optimization 3, 199–211 (1999)
Yu, K.-M., Zhou, J.-Y., Lin, C.-Y., Tang, C.Y.: Parallel Branch-and-Bound Algorithm for Constructing Evolutionary Trees from Distance Matrices. In: IEEE Proceedings of the 8th International Conference on High Performance Computing in Asia Pacific Region, pp. 66–72 (2005)
Yu, K.-M., Zhou, J., Lin, C.-Y., Tang, C.Y.: An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Ruenger, G. (eds.) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. LNCS, vol. 4331, pp. 215–220. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, KM., Zhou, J., Lin, CY., Tang, C.Y. (2007). 3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2007. Lecture Notes in Computer Science, vol 4671. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73940-1_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-73940-1_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73939-5
Online ISBN: 978-3-540-73940-1
eBook Packages: Computer ScienceComputer Science (R0)