Your Cart
Loading

Exercise 5: UPGMA Solution

On Sale
$25.00
$25.00
Added to cart

Phylogenetic trees via UPGMA: You are to consider the following distance matrix D:



A

B

C

D

A

0

3

10

10

B

3

0

2

12

C

10

2

0

4

D

10

12

4

0


Run the UPGMA Algorithm on distance matrix D, using centroid based (average) linkage when computing inter-cluster distances, showing intermediate steps.


  1. Which pair of nodes is Merged first?


  1. What is the resulting inter-cluster distance matrix?








0


0


0




  1. Which pair of nodes or clusters is Merged next?


  1. What is the resulting inter-cluster distance matrix?








0


0




  1. What is the final phylogenetic tree based on the above UPGMA algorithm run?


You will get a ZIP (172KB) file