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
|
/*
* npshannon.cpp
* Dotur
*
* Created by John Westcott on 1/7/09.
* Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
#include "npshannon.h"
/***********************************************************************/
EstOutput NPShannon::getValues(SAbundVector* rank){
try {
data.resize(1,0);
float npShannon = 0.0000;
double maxRank = (double)rank->getMaxRank();
double sampled = rank->getNumSeqs();
double Chat = 1.0000 - (double)rank->get(1)/(double)sampled;
if(Chat>0) {
for(int i=1;i<=maxRank;i++){
double pi = ((double) i)/((double)sampled);
double ChatPi = Chat*pi;
if(ChatPi>0){
npShannon += rank->get(i) * ChatPi*log(ChatPi)/(1-pow(1-ChatPi,(double)sampled));
}
}
npShannon = -npShannon;
}
else{
npShannon = 0.000;
}
data[0] = npShannon;
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
return data;
}
catch(exception& e) {
m->errorOut(e, "NPShannon", "getValues");
exit(1);
}
}
/***********************************************************************/
|
