UPGMA - 23 August 2011 - BioInformatics Pakistan
Thursday, 2016-12-08, 3:10 AM
Welcome Guest | RSS

Login form

Statistics
Total online: 1
Guests: 1
Users: 0

Is Online User
Site Search
Main » 2011 » August » 23 » UPGMA
3:56 PM
UPGMA


UPGMA (Unweighted group method with arithmetic mean)

1. Description:
   UPGMA (Unweighted Pair Group Method with Arithmetic Mean) is a simple agglomerative or hierarchical clustering method used in bioinformatics for the creation of phenetic trees (phenograms). UPGMA assumes a constant rate of evolution (molecular clock hypothesis), and is not a well-regarded method for inferring relationships unless this assumption has been tested and justified for the data set being used. UPGMA was initially designed for use in protein electrophoresis studies, but is currently most often used to produce guide trees for more sophisticated phylogenetic reconstruction algorithms.
   The algorithm examines the structure present in a pairwise distance matrix (or a similarity matrix) to then construct a rooted tree (dendrogram).
   At each step, the nearest two clusters are combined into a higher-level cluster. The distance between any two clusters A and B is taken to be the average of all distances between pairs of objects "x" in A and "y" in B, that is, the mean distance between elements of each cluster:

   The method is generally attributed to Sokal and Michener. Fionn Murtagh found a time optimal O(n2) time algorithm to construct the UPGMA tree.

2. Key Points:
  1. Sequential clustering algorithm
  2. Start with things most similar
    • Build a composite OTU(Operational Taxonomic Units)
  3. Distances to this OTU are computed asarithmetic means– 
  4. From new group of OTUs, pick pair withhighest similarity etc.
  5. Average-linkage clustering
3. UPGMA Visually:

4. UPGMA Example:



5. UPGMA Weaknesses:

In fact, exact fitting tree exists !

  1. UPGMA assumes that the rates of evolutionare the same among different lineages
  2. In general, should not use this method forphylogenetic tree reconstruction (unlessbelieve assumption)
  3. Produces a rooted tree
  4. As a general clustering method (as wediscussed in an earlier lecture), it is better…


Category: Algorithms | Views: 1751 | Added by: Ansari | Rating: 0.0/0
Total comments: 0
Name *:
Email *:
Code *:
Tag Board
200
Your Ads
Site friends

Copyright MyCorp © 2016
Free website builderuCoz