try {
data.resize(1,0);
- int sumSharedA, sumSharedB, sumSharedAB, tempA, tempB;
+ double sumSharedA, sumSharedB, sumSharedAB, tempA, tempB;
sumSharedA = 0; sumSharedB = 0; sumSharedAB = 0;
/*Xi, Yi = abundance of the ith shared OTU in A and B
sumSharedAB = the sum of the minimum otus int all shared otus in AB.
*/
- for (int i = 0; i < shared[0]->size(); i++) {
+ 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);
else { sumSharedAB += tempB; }
}
- data[0] = (2 * sumSharedAB) / (float)( sumSharedA + sumSharedB);
+ data[0] = 1.0 - (2 * sumSharedAB) / (float)( sumSharedA + sumSharedB);
if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; }
return data;
}
catch(exception& e) {
- errorOut(e, "BrayCurtis", "getValues");
+ m->errorOut(e, "BrayCurtis", "getValues");
exit(1);
}
}