X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=linearalgebra.cpp;h=33464ca5b3519f615b1029b22793694d595eee2d;hb=4169642e8a8d45f71a4a7241ee02f1b1aae29520;hp=9308627d1335920ea49f9b4c5bbd543de629ae85;hpb=5553e33be3a45eee6bed2ac9a5c4ca0aa0e8d5e4;p=mothur.git

diff --git a/linearalgebra.cpp b/linearalgebra.cpp
index 9308627..33464ca 100644
--- a/linearalgebra.cpp
+++ b/linearalgebra.cpp
@@ -637,7 +637,7 @@ double LinearAlgebra::calcKendall(vector< vector<double> >& euclidDists, vector<
 			int numWithLowerRank = 0;
 			float thisrank = user[l].score;
 					
-			for (int u = l; u < scores.size(); u++) {
+			for (int u = l+1; u < scores.size(); u++) {
 				if (user[u].score > thisrank) { numWithHigherRank++; }
 				else if (user[u].score < thisrank) { numWithLowerRank++; }
 				count++;
@@ -647,9 +647,6 @@ double LinearAlgebra::calcKendall(vector< vector<double> >& euclidDists, vector<
 			numDisCoor += numWithLowerRank;
 		}
 				
-		//comparing to yourself
-		count -= userDists.size();
-				
 		r = (numCoor - numDisCoor) / (float) count;
 		
 		//divide by zero error