1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
/*
* mempearson.cpp
* Mothur
*
* Created by westcott on 12/17/10.
* Copyright 2010 Schloss Lab. All rights reserved.
*
*/
#include "mempearson.h"
/***********************************************************************/
EstOutput MemPearson::getValues(vector<SharedRAbundVector*> shared) {
try {
data.resize(1,0);
int nonZeroA = 0;
int nonZeroB = 0;
int numOTUS = shared[0]->getNumBins();
//for each otu
for (int i = 0; i < shared[0]->getNumBins(); i++) {
if (shared[0]->get(i) != 0) { nonZeroA++; }
if (shared[1]->get(i) != 0) { nonZeroB++; }
}
double numTerm = 0.0;
double denomTerm1 = 0.0;
double denomTerm2 = 0.0;
double averageA = nonZeroA / (float) numOTUS;
double averageB = nonZeroB / (float) numOTUS;
for (int i = 0; i < shared[0]->getNumBins(); i++) {
int Aij = shared[0]->get(i);
int Bij = shared[1]->get(i);
if (Aij > 0) { Aij = 1; }
if (Bij > 0) { Bij = 1; }
numTerm += ((Aij - averageA) * (Bij - averageB));
denomTerm1 += ((Aij - averageA) * (Aij - averageA));
denomTerm2 += ((Bij - averageB) * (Bij - averageB));
}
denomTerm1 = sqrt(denomTerm1);
denomTerm2 = sqrt(denomTerm2);
double denom = denomTerm1 * denomTerm2;
if (!util.isEqual(denom, 0)) {
data[0] = (numTerm / denom);
}else {
data[0] = 1.0;
}
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
return data;
}
catch(exception& e) {
m->errorOut(e, "MemPearson", "getValues");
exit(1);
}
}
/***********************************************************************/
|
