3-Points Relationship Based Parallel Algorithm for Minimum Ultrametric Tree Construction

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 by 3PR 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.

[1]  Chuan Yi Tang,et al.  Parallel branch-and-bound algorithm for constructing evolutionary trees from distance matrix , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

[2]  J. Bull,et al.  Experimental phylogenetics: generation of a known phylogeny. , 1992, Science.

[3]  Geyong Min.  Frontiers of High Performance Computing and Networking - ISPA 2006 Workshops, ISPA 2006 International Workshops, FHPCN, XHPC, S-GRACE, GridGIS, HPC-GTP, PDCE, ParDMCom, WOMP, ISDF, and UPWN, Sorrento, Italy, December 4-7, 2006, Proceedings , 2006, ISPA Workshops.

[4]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[5]  Dan Gusfield.  Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology , 1997 .

[6]  D. Penny,et al.  Branch and bound algorithms to determine minimal evolutionary trees , 1982 .

[7]  Sampath Kannan,et al.  A robust model for finding optimal evolutionary trees , 1993, Algorithmica.

[8]  Chuan Yi Tang,et al.  Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices , 1998, J. Comb. Optim..

[9]  K. Hawkes,et al.  African populations and the evolution of human mitochondrial DNA. , 1991, Science.

[10]  D. Labie,et al.  Molecular Evolution , 1991, Nature.

[11]  Wen-Hsiung Li,et al.  Fundamentals of molecular evolution , 1990 .

[12]  Chuan Yi Tang,et al.  An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR , 2006, ISPA Workshops.

[13]  Dharma P. Agrawal,et al.  A randomized parallel branch-and-bound algorithm , 1989, International Journal of Parallel Programming.

[14]  Mirko Krvanek.  The Complexity of Ultrametric Partitions on Graphs , 1988, Inf. Process. Lett..