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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/*
* bstick.cpp
* Mothur
*
* Created by Thomas Ryabin on 3/6/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "bstick.h"
/***********************************************************************/
double BStick::invSum(int index, double numSpec)
{
double sum = 0;
for(int i = index; i <= numSpec; i++)
sum += 1/(double)i;
return sum;
}
/***********************************************************************/
RAbundVector BStick::getRAbundVector(SAbundVector* rank){
vector <int> rData;
int mr = 1;
int nb = 0;
int ns = 0;
for(int i = rank->size()-1; i > 0; i--) {
double cur = rank->get(i);
if(mr == 1 && cur > 0)
mr = i;
nb += cur;
ns += i*cur;
for(int j = 0; j < cur; j++)
rData.push_back(i);
}
RAbundVector rav = RAbundVector(rData, mr, nb, ns);
rav.setLabel(rank->getLabel());
return rav;
}
/***************************************************************************/
/***************************************************************************/
EstOutput BStick::getValues(SAbundVector* rank){
try {
data.resize(3,0);
rdata = getRAbundVector(rank);
double numInd = (double)rdata.getNumSeqs();
double numSpec = (double)rdata.getNumBins();
double sumExp = 0;
double sumObs = 0;
double maxDiff = 0;
for(int i = 0; i < rdata.size(); i++) {
sumObs += rdata.get(i);
sumExp += numInd/numSpec*invSum(i+1,numSpec);
double diff = fabs(sumObs-sumExp);
if(diff > maxDiff)
maxDiff = diff;
}
data[0] = maxDiff/numInd;
data[1] = 0.886/sqrt(rdata.size());
data[2] = 1.031/sqrt(rdata.size());
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
if (isnan(data[1]) || isinf(data[1])) { data[1] = 0; }
if (isnan(data[2]) || isinf(data[2])) { data[2] = 0; }
return data;
}
catch(exception& e) {
m->errorOut(e, "BStick", "getValues");
exit(1);
}
}
/***********************************************************************/
|
