EstOutput Weighted::getValues(Tree* t) {
try {
-
- int numGroups = tmap->getNumGroups();
+ globaldata = GlobalData::getInstance();
+ int numGroups;
+ vector<double> D;
+
+ numGroups = globaldata->Groups.size();
//calculate number of comparisons i.e. with groups A,B,C = AB, AC, BC = 3;
- int n = 1;
- for (int i=1; i<numGroups; i++) {
- for (int l = n; l < numGroups; l++) {
+ int count = 0;
+ for (int i=0; i<numGroups; i++) {
+ for (int l = i+1; l < numGroups; l++) {
//initialize weighted scores
- WScore[tmap->namesOfGroups[i-1]+tmap->namesOfGroups[l]] = 0.0;
- }
- }
-
- data.clear(); //clear out old values
-
- double D = 0.0000;
-
- for(int i=0;i<t->getNumLeaves();i++){
- int index = i;
- double sum = 0.0000;
-
- //while you aren't at root
- while(t->tree[index].getParent() != -1){
-
- if(t->tree[index].pGroups.size() != 0){
- sum += t->tree[index].getBranchLength();
- }
-
- //old_index = you
- int old_index = index;
- //index = your parent
- index = t->tree[index].getParent();
-
- //if you grandparent is the root
- if(t->tree[index].getParent() == -1 && t->tree[old_index].pGroups.size() != 0){
- int lc = t->tree[t->tree[index].getLChild()].pGroups.size();
- int rc = t->tree[t->tree[index].getRChild()].pGroups.size();
+ WScore[globaldata->Groups[i]+globaldata->Groups[l]] = 0.0;
+ D.push_back(0.0000); //initialize a spot in D for each combination
- if(lc == 0 || rc == 0){
- sum -= t->tree[old_index].getBranchLength();
+ /********************************************************/
+ //calculate a D value for each group combo
+ for(int v=0;v<t->getNumLeaves();v++){
+ int index = v;
+ double sum = 0.0000;
+
+ //while you aren't at root
+ while(t->tree[index].getParent() != -1){
+
+ //if you have a BL
+ if(t->tree[index].getBranchLength() != -1){
+ sum += abs(t->tree[index].getBranchLength());
+ }
+ index = t->tree[index].getParent();
+ }
+
+ //get last breanch length added
+ if(t->tree[index].getBranchLength() != -1){
+ sum += abs(t->tree[index].getBranchLength());
+ }
+
+ //is this sum from a sequence which is in one of the users groups
+ if (inUsersGroups(t->tree[v].getGroup(), globaldata->Groups) == true) {
+ //is this sum from a sequence which is in this groupCombo
+ if ((t->tree[v].getGroup() == globaldata->Groups[i]) || (t->tree[v].getGroup() == globaldata->Groups[l])) {
+ sum /= (double)tmap->seqsPerGroup[t->tree[v].getGroup()];
+ D[count] += sum;
+ }
}
}
- }
-
- if(t->tree[i].getGroup() != ""){
- sum /= (double)tmap->seqsPerGroup[t->tree[i].getGroup()];
- D += sum;
+ /*********************************************************/
+ count++;
}
}
-
+
+ data.clear(); //clear out old values
for(int i=0;i<t->getNumNodes();i++){
//calculate weighted score for each of the group comb i.e. with groups A,B,C = AB, AC, BC.
- n = 1;
- for (int b=1; b<numGroups; b++) {
- for (int l = n; l < numGroups; l++) {
+ for (int b=0; b<numGroups; b++) {
+ for (int l = b+1; l < numGroups; l++) {
+ //calculate a u value for each combo
double u;
//does this node have descendants from group b-1
- it = t->tree[i].pcount.find(tmap->namesOfGroups[b-1]);
+ it = t->tree[i].pcount.find(globaldata->Groups[b]);
//if it does u = # of its descendants with a certain group / total number in tree with a certain group
if (it != t->tree[i].pcount.end()) {
- u = (double) t->tree[i].pcount[tmap->namesOfGroups[b-1]] / (double) tmap->seqsPerGroup[tmap->namesOfGroups[b-1]];
+ u = (double) t->tree[i].pcount[globaldata->Groups[b]] / (double) tmap->seqsPerGroup[globaldata->Groups[b]];
}else { u = 0.00; }
//does this node have descendants from group l
- it = t->tree[i].pcount.find(tmap->namesOfGroups[l]);
+ it = t->tree[i].pcount.find(globaldata->Groups[l]);
//if it does subtract their percentage from u
if (it != t->tree[i].pcount.end()) {
- u -= (double) t->tree[i].pcount[tmap->namesOfGroups[l]] / (double) tmap->seqsPerGroup[tmap->namesOfGroups[l]];
+ u -= (double) t->tree[i].pcount[globaldata->Groups[l]] / (double) tmap->seqsPerGroup[globaldata->Groups[l]];
}
- u = abs(u) * t->tree[i].getBranchLength();
+ u = abs(u * t->tree[i].getBranchLength());
//save groupcombs u value
- WScore[tmap->namesOfGroups[b-1]+tmap->namesOfGroups[l]] += u;
-
+ WScore[globaldata->Groups[b]+globaldata->Groups[l]] += u;
+ /*********************************************************/
}
- n++;
}
}
//calculate weighted score for each group combination
double UN;
- n = 1;
- for (int i=1; i<numGroups; i++) {
- for (int l = n; l < numGroups; l++) {
- UN = (WScore[tmap->namesOfGroups[i-1]+tmap->namesOfGroups[l]] / D);
+ count = 0;
+ for (int i=0; i<numGroups; i++) {
+ for (int l = i+1; l < numGroups; l++) {
+ UN = (WScore[globaldata->Groups[i]+globaldata->Groups[l]] / D[count]);
+
if (isnan(UN) || isinf(UN)) { UN = 0; }
data.push_back(UN);
+ count++;
}
}
-
return data;
}
catch(exception& e) {
}
-/**************************************************************************************************/
\ No newline at end of file
+/**************************************************************************************************/
+EstOutput Weighted::getValues(Tree* t, string groupA, string groupB) {
+ try {
+ globaldata = GlobalData::getInstance();
+
+ data.clear(); //clear out old values
+
+ //initialize weighted score
+ WScore[(groupA+groupB)] = 0.0;
+ float D = 0.0;
+
+
+ /********************************************************/
+ //calculate a D value for the group combo
+ for(int v=0;v<t->getNumLeaves();v++){
+ int index = v;
+ double sum = 0.0000;
+
+ //while you aren't at root
+ while(t->tree[index].getParent() != -1){
+
+ //if you have a BL
+ if(t->tree[index].getBranchLength() != -1){
+ sum += abs(t->tree[index].getBranchLength());
+ }
+ index = t->tree[index].getParent();
+ }
+
+ //get last breanch length added
+ if(t->tree[index].getBranchLength() != -1){
+ sum += abs(t->tree[index].getBranchLength());
+ }
+
+ if ((t->tree[v].getGroup() == groupA) || (t->tree[v].getGroup() == groupB)) {
+ sum /= (double)tmap->seqsPerGroup[t->tree[v].getGroup()];
+ D += sum;
+ }
+ }
+ /********************************************************/
+
+ //calculate u for the group comb
+ for(int i=0;i<t->getNumNodes();i++){
+ double u;
+ //does this node have descendants from groupA
+ it = t->tree[i].pcount.find(groupA);
+ //if it does u = # of its descendants with a certain group / total number in tree with a certain group
+ if (it != t->tree[i].pcount.end()) {
+ u = (double) t->tree[i].pcount[groupA] / (double) tmap->seqsPerGroup[groupA];
+ }else { u = 0.00; }
+
+
+ //does this node have descendants from group l
+ it = t->tree[i].pcount.find(groupB);
+ //if it does subtract their percentage from u
+ if (it != t->tree[i].pcount.end()) {
+ u -= (double) t->tree[i].pcount[groupB] / (double) tmap->seqsPerGroup[groupB];
+ }
+
+ u = abs(u * t->tree[i].getBranchLength());
+
+ //save groupcombs u value
+ WScore[(groupA+groupB)] += u;
+ }
+
+ /********************************************************/
+
+ //calculate weighted score for the group combination
+ double UN;
+ UN = (WScore[(groupA+groupB)] / D);
+
+ if (isnan(UN) || isinf(UN)) { UN = 0; }
+ data.push_back(UN);
+
+ return data;
+ }
+ catch(exception& e) {
+ cout << "Standard Error: " << e.what() << " has occurred in the Weighted class Function getValues. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ exit(1);
+ }
+ catch(...) {
+ cout << "An unknown error has occurred in the Weighted class function getValues. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ exit(1);
+ }
+
+}
+
+
+
+
+
+
+
+
+
projects / mothur.git / blobdiff