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
|
/*
* kstest.cpp
* Mothur
*
* Created by Thomas Ryabin on 3/6/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "sharedkstest.h"
/***********************************************************************/
EstOutput KSTest::getValues(vector<SharedRAbundVector*> shared){
try {
data.resize(3,0);
//Must return shared1 and shared2 to original order at conclusion of kstest
vector <individual> initData1 = shared[0]->getData();
vector <individual> initData2 = shared[1]->getData();
shared[0]->sortD();
shared[1]->sortD();
int numNZ1 = shared[0]->numNZ();
int numNZ2 = shared[1]->numNZ();
double numInd1 = (double)shared[0]->getNumSeqs();
double numInd2 = (double)shared[1]->getNumSeqs();
double maxDiff = -1;
double sum1 = 0;
double sum2 = 0;
for(int i = 1; i < shared[0]->getNumBins(); i++)
{
sum1 += shared[0]->get(i).abundance;
sum2 += shared[1]->get(i).abundance;
double diff = fabs((double)sum1/numInd1 - (double)sum2/numInd2);
if(diff > maxDiff)
maxDiff = diff;
}
double DStatistic = maxDiff*numNZ1*numNZ2;
double a = pow((double)(numNZ1 + numNZ2)/(numNZ1*numNZ2),.5);
//double pVal = exp(-2*pow(maxDiff/a,2));
double critVal = 1.36*a*numNZ1*numNZ2;
shared[0]->setData(initData1);
shared[1]->setData(initData2);
data[0] = DStatistic;
data[1] = critVal;
data[2] = 0;
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
if (isnan(data[1]) || isinf(data[1])) { data[1] = 0; }
return data;
}
catch(exception& e) {
m->errorOut(e, "KSTest", "getValues");
exit(1);
}
}
/***********************************************************************/
|
