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
|
/*
* sharedkulczynskicody.cpp
* Mothur
*
* Created by Sarah Westcott on 3/24/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "sharedkulczynskicody.h"
/***********************************************************************/
EstOutput KulczynskiCody::getValues(vector<SharedRAbundVector*> shared) {
try {
double S1, S2, S12, tempA, tempB;
S1 = 0; S2 = 0; S12 = 0; tempA = 0; tempB = 0;
/*S1, S2 = number of OTUs observed or estimated in A and B
S12=number of OTUs shared between A and B */
data.resize(1,0);
for (int i = 0; i < shared[0]->getNumBins(); i++) {
//store in temps to avoid multiple repetitive function calls
tempA = shared[0]->getAbundance(i);
tempB = shared[1]->getAbundance(i);
if (tempA != 0) { S1++; }
if (tempB != 0) { S2++; }
//they are shared
if ((tempA != 0) && (tempB != 0)) { S12++; }
}
data[0] = 1.0 - 0.5 * ((S12 / (float)S1) + (S12 / (float)S2));
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
return data;
}
catch(exception& e) {
m->errorOut(e, "KulczynskiCody", "getValues");
exit(1);
}
}
/***********************************************************************/
|
