X-Git-Url: http://source.jalview.org/gitweb/?a=blobdiff_plain;f=src%2Fjalview%2Fanalysis%2FAverageDistanceEngine.java;h=d81dd44687d286542f4576034ca76307efdd2e63;hb=032527014a1eafae4110666a53aad60992a29576;hp=ed6f861bf984bb0edc1ef73c39119162502713f6;hpb=948828a5fed141e2ed319586687b80b6d0298268;p=jalview.git

diff --git a/src/jalview/analysis/AverageDistanceEngine.java b/src/jalview/analysis/AverageDistanceEngine.java
index ed6f861..d81dd44 100644
--- a/src/jalview/analysis/AverageDistanceEngine.java
+++ b/src/jalview/analysis/AverageDistanceEngine.java
@@ -39,71 +39,122 @@ import jalview.viewmodel.AlignmentViewport;
 public class AverageDistanceEngine extends TreeEngine
 {
   ContactMatrixI cm;
+
   AlignmentViewport av;
+
   AlignmentAnnotation aa;
+
+  // 0 - normalised dot product
+  // 1 - L1 - ie (abs(v_1-v_2)/dim(v))
+  // L1 is more rational - since can reason about value of difference,
+  // normalised dot product might give cleaner clusters, but more difficult to
+  // understand.
+
+  int mode = 1;
+
   /**
-   * compute cosine distance matrix for a given contact matrix and create a UPGMA tree
+   * compute cosine distance matrix for a given contact matrix and create a
+   * UPGMA tree
    * @param cm
+   * @param cosineOrDifference false - dot product : true - L1
    */
-  public AverageDistanceEngine(AlignmentViewport av, AlignmentAnnotation aa, ContactMatrixI cm)
+  public AverageDistanceEngine(AlignmentViewport av, AlignmentAnnotation aa,
+          ContactMatrixI cm, boolean cosineOrDifference)
   {
-    this.av =av;
+    this.av = av;
     this.aa = aa;
-    this.cm=cm;
+    this.cm = cm;
+    mode = (cosineOrDifference) ? 1 :0; 
     calculate(cm);
 
   }
+
+
   public void calculate(ContactMatrixI cm)
   {
     this.cm = cm;
     node = new Vector<BinaryNode>();
     clusters = new Vector<BitSet>();
     distances = new Matrix(new double[cm.getWidth()][cm.getWidth()]);
-    noseqs=cm.getWidth();
-    done  = new BitSet();
-    double moduli[]=new double[cm.getWidth()];
-    
-    
-    for (int i=0;i<cm.getWidth();i++)
+    noseqs = cm.getWidth();
+    done = new BitSet();
+    double moduli[] = new double[cm.getWidth()];
+    double max;
+    if (mode == 0)
+    {
+      max = 1;
+    }
+    else
+    {
+      max = cm.getMax() * cm.getMax();
+    }
+
+    for (int i = 0; i < cm.getWidth(); i++)
     {
       // init the tree engine node for this column
       BinaryNode cnode = new BinaryNode();
       cnode.setElement(Integer.valueOf(i));
-      cnode.setName("c"+i);
+      cnode.setName("c" + i);
       node.addElement(cnode);
       BitSet bs = new BitSet();
       bs.set(i);
       clusters.addElement(bs);
 
       // compute distance matrix element
-      ContactListI ith=cm.getContactList(i);
-      
-      for (int j=0;j<i;j++)
+      ContactListI ith = cm.getContactList(i);
+      distances.setValue(i, i, 0);
+      if (ith==null)
+      {
+        continue;
+      }
+      for (int j = 0; j < i; j++)
       {
-        distances.setValue(i,i,0);
         ContactListI jth = cm.getContactList(j);
-        double prd=0;
-        for (int indx=0;indx<cm.getHeight();indx++)
+        if (jth == null)
+        {
+          break;
+        }
+        double prd = 0;
+        for (int indx = 0; indx < cm.getHeight(); indx++)
+        {
+          if (mode == 0)
+          {
+            if (j == 0)
+            {
+              moduli[i] += ith.getContactAt(indx) * ith.getContactAt(indx);
+            }
+            prd += ith.getContactAt(indx) * jth.getContactAt(indx);
+          }
+          else
+          {
+            prd += Math
+                    .abs(ith.getContactAt(indx) - jth.getContactAt(indx));
+          }
+        }
+        if (mode == 0)
         {
-          if (j==0)
+          if (j == 0)
           {
-            moduli[i]+=ith.getContactAt(indx)*ith.getContactAt(indx);
+            moduli[i] = Math.sqrt(moduli[i]);
           }
-          prd+=ith.getContactAt(indx)*jth.getContactAt(indx);
+          prd = (moduli[i] != 0 && moduli[j] != 0)
+                  ? prd / (moduli[i] * moduli[j])
+                  : 0;
+          prd = 1 - prd;
         }
-        if (j==0)
+        else
         {
-          moduli[i]=Math.sqrt(moduli[i]);
+          prd /= cm.getHeight();
         }
-        prd=(moduli[i]!=0 && moduli[j]!=0) ? prd/(moduli[i]*moduli[j]) : 0;
-        distances.setValue(i, j, 1-prd);
-        distances.setValue(j, i, 1-prd);
+        distances.setValue(i, j, prd);
+        distances.setValue(j, i, prd);
       }
     }
 
     noClus = clusters.size();
     cluster();
   }
+
   /**
    * Calculates and saves the distance between the combination of cluster(i) and
    * cluster(j) and all other clusters. An average of the distances from
@@ -197,6 +248,7 @@ public class AverageDistanceEngine extends TreeEngine
     nodei.dist = ((dist / 2) - ih);
     nodej.dist = ((dist / 2) - jh);
   }
+
   /***
    * not the right place - OH WELL!
    */
@@ -234,8 +286,8 @@ public class AverageDistanceEngine extends TreeEngine
     }
     else
     {
-      _groupNodes(groups,  nd.left(), threshold);
-      _groupNodes(groups,  nd.right(), threshold);
+      _groupNodes(groups, nd.left(), threshold);
+      _groupNodes(groups, nd.right(), threshold);
     }
   }
 
@@ -286,7 +338,6 @@ public class AverageDistanceEngine extends TreeEngine
     return maxheight;
   }
 
-
   /**
    * Search for leaf nodes below (or at) the given node
    * 
@@ -312,8 +363,7 @@ public class AverageDistanceEngine extends TreeEngine
    * 
    * @return Vector of leaf nodes on binary tree
    */
-  Vector<BinaryNode> findLeaves(BinaryNode nd,
-          Vector<BinaryNode> leaves)
+  Vector<BinaryNode> findLeaves(BinaryNode nd, Vector<BinaryNode> leaves)
   {
     if (nd == null)
     {
@@ -333,12 +383,11 @@ public class AverageDistanceEngine extends TreeEngine
        * TODO: Identify internal nodes... if (node.isSequenceLabel()) {
        * leaves.addElement(node); }
        */
-      findLeaves( nd.left(), leaves);
-      findLeaves( nd.right(), leaves);
+      findLeaves(nd.left(), leaves);
+      findLeaves(nd.right(), leaves);
     }
 
     return leaves;
   }
 
-
 }