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
67
68
|
/*
* qstat.cpp
* Mothur
*
* Created by Thomas Ryabin on 3/4/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "qstat.h"
/***********************************************************************/
EstOutput QStat::getValues(SAbundVector* rank){
try {
/*test data VVV
int dstring[] = {0,0,1,4,2,0,2,1,1,1,1,1,0,1,1,2,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1};
vector<int> dvec;
for(int i = 0; i < 171; i++)
dvec.push_back(dstring[i]);
int mr = 170;
int nb = 29;
int ns = 884;
SAbundVector rankw = SAbundVector(dvec, mr,nb,ns);
SAbundVector *rank = &rankw;*/
data.resize(1,0);
int numSpec = rank->getNumBins();
int r1 = -1;
int r3 = -1;
int r1Ind = 0;
int r3Ind = 0;
double sumSpec = 0;
double iqSum = 0;
for(int i = 1; i < rank->size(); i++) {
if(r1 != -1 && r3 != -1)
i = rank->size();
sumSpec += rank->get(i);
if(r1 == -1 && sumSpec >= numSpec*.25) {
r1 = rank->get(i);
r1Ind = i;
}
else if(r3 == -1 && sumSpec >= numSpec*.75) {
r3 = rank->get(i);
r3Ind = i;
}
else if(sumSpec >= numSpec*.25 && sumSpec < numSpec*.75)
iqSum += rank->get(i);
}
double qstat = (.5*r1 + iqSum + .5*r3)/log((double)r3Ind/r1Ind);
data[0] = qstat;
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
return data;
}
catch(exception& e) {
m->errorOut(e, "QStat", "getValues");
exit(1);
}
}
/***********************************************************************/
|
