]> git.donarmstrong.com Git - mothur.git/blob - bootstrapsharedcommand.cpp
merged pat's trim seqs edits with sarah's major overhaul of global data; also added...
[mothur.git] / bootstrapsharedcommand.cpp
1 /*
2  *  bootstrapsharedcommand.cpp
3  *  Mothur
4  *
5  *  Created by Sarah Westcott on 4/16/09.
6  *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
7  *
8  */
9
10 #include "bootstrapsharedcommand.h"
11 #include "sharedjabund.h"
12 #include "sharedsorabund.h"
13 #include "sharedjclass.h"
14 #include "sharedsorclass.h"
15 #include "sharedjest.h"
16 #include "sharedsorest.h"
17 #include "sharedthetayc.h"
18 #include "sharedthetan.h"
19 #include "sharedmorisitahorn.h"
20 #include "sharedbraycurtis.h"
21
22
23 //**********************************************************************************************************************
24
25 BootSharedCommand::BootSharedCommand(string option){
26         try {
27                 globaldata = GlobalData::getInstance();
28                 abort = false;
29                 allLines = 1;
30                 lines.clear();
31                 labels.clear();
32                 Groups.clear();
33                 Estimators.clear();
34                 
35                 //allow user to run help
36                 if(option == "help") { help(); abort = true; }
37                 
38                 else {
39                         //valid paramters for this command
40                         string Array[] =  {"line","label","calc","groups","iters"};
41                         vector<string> myArray (Array, Array+(sizeof(Array)/sizeof(string)));
42                         
43                         OptionParser parser(option);
44                         map<string,string> parameters = parser.getParameters();
45                         
46                         ValidParameters validParameter;
47                 
48                         //check to make sure all parameters are valid for command
49                         for (map<string,string>::iterator it = parameters.begin(); it != parameters.end(); it++) { 
50                                 if (validParameter.isValidParameter(it->first, myArray, it->second) != true) {  abort = true;  }
51                         }
52                         
53                         //make sure the user has already run the read.otu command
54                         if (globaldata->getSharedFile() == "") {
55                                 if (globaldata->getListFile() == "") { cout << "You must read a list and a group, or a shared before you can use the bootstrap.shared command." << endl; abort = true; }
56                                 else if (globaldata->getGroupFile() == "") { cout << "You must read a list and a group, or a shared before you can use the bootstrap.shared command." << endl; abort = true; }
57                         }
58                         
59                         //check for optional parameter and set defaults
60                         // ...at some point should added some additional type checking...
61                         line = validParameter.validFile(parameters, "line", false);                             
62                         if (line == "not found") { line = "";  }
63                         else { 
64                                 if(line != "all") {  splitAtDash(line, lines);  allLines = 0;  }
65                                 else { allLines = 1;  }
66                         }
67                         
68                         label = validParameter.validFile(parameters, "label", false);                   
69                         if (label == "not found") { label = ""; }
70                         else { 
71                                 if(label != "all") {  splitAtDash(label, labels);  allLines = 0;  }
72                                 else { allLines = 1;  }
73                         }
74                         
75                         //make sure user did not use both the line and label parameters
76                         if ((line != "") && (label != "")) { cout << "You cannot use both the line and label parameters at the same time. " << endl; abort = true; }
77                         //if the user has not specified any line or labels use the ones from read.otu
78                         else if((line == "") && (label == "")) {  
79                                 allLines = globaldata->allLines; 
80                                 labels = globaldata->labels; 
81                                 lines = globaldata->lines;
82                         }
83                                 
84                         groups = validParameter.validFile(parameters, "groups", false);                 
85                         if (groups == "not found") { groups = ""; }
86                         else { 
87                                 splitAtDash(groups, Groups);
88                                 globaldata->Groups = Groups;
89                         }
90                                 
91                         calc = validParameter.validFile(parameters, "calc", false);                     
92                         if (calc == "not found") { calc = "jclass-thetayc";  }
93                         else { 
94                                  if (calc == "default")  {  calc = "jclass-thetayc";  }
95                         }
96                         splitAtDash(calc, Estimators);
97
98                         string temp;
99                         temp = validParameter.validFile(parameters, "iters", false);  if (temp == "not found") { temp = "1000"; }
100                         convert(temp, iters); 
101                                 
102                         if (abort == false) {
103                         
104                                 validCalculator = new ValidCalculators();
105                                 
106                                 int i;
107                                 for (i=0; i<Estimators.size(); i++) {
108                                         if (validCalculator->isValidCalculator("boot", Estimators[i]) == true) { 
109                                                 if (Estimators[i] == "jabund") {        
110                                                         treeCalculators.push_back(new JAbund());
111                                                 }else if (Estimators[i] == "sorabund") { 
112                                                         treeCalculators.push_back(new SorAbund());
113                                                 }else if (Estimators[i] == "jclass") { 
114                                                         treeCalculators.push_back(new Jclass());
115                                                 }else if (Estimators[i] == "sorclass") { 
116                                                         treeCalculators.push_back(new SorClass());
117                                                 }else if (Estimators[i] == "jest") { 
118                                                         treeCalculators.push_back(new Jest());
119                                                 }else if (Estimators[i] == "sorest") { 
120                                                         treeCalculators.push_back(new SorEst());
121                                                 }else if (Estimators[i] == "thetayc") { 
122                                                         treeCalculators.push_back(new ThetaYC());
123                                                 }else if (Estimators[i] == "thetan") { 
124                                                         treeCalculators.push_back(new ThetaN());
125                                                 }else if (Estimators[i] == "morisitahorn") { 
126                                                         treeCalculators.push_back(new MorHorn());
127                                                 }else if (Estimators[i] == "braycurtis") { 
128                                                         treeCalculators.push_back(new BrayCurtis());
129                                                 }
130                                         }
131                                 }
132                                 
133                                 delete validCalculator;
134                                 
135                                 ofstream* tempo;
136                                 for (int i=0; i < treeCalculators.size(); i++) {
137                                         tempo = new ofstream;
138                                         out.push_back(tempo);
139                                 }       
140                         }
141                 }
142
143         }
144         catch(exception& e) {
145                 cout << "Standard Error: " << e.what() << " has occurred in the BootSharedCommand class Function BootSharedCommand. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
146                 exit(1);
147         }
148         catch(...) {
149                 cout << "An unknown error has occurred in the BootSharedCommand class function BootSharedCommand. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
150                 exit(1);
151         }       
152 }
153
154 //**********************************************************************************************************************
155
156 void BootSharedCommand::help(){
157         try {
158                 cout << "The bootstrap.shared command can only be executed after a successful read.otu command." << "\n";
159                 cout << "The bootstrap.shared command parameters are groups, calc, iters, line and label.  You may not use line and label at the same time." << "\n";
160                 cout << "The groups parameter allows you to specify which of the groups in your groupfile you would like included used." << "\n";
161                 cout << "The group names are separated by dashes. The line and label allow you to select what distance levels you would like trees created for, and are also separated by dashes." << "\n";
162                 cout << "The bootstrap.shared command should be in the following format: bootstrap.shared(groups=yourGroups, calc=yourCalcs, line=yourLines, label=yourLabels, iters=yourIters)." << "\n";
163                 cout << "Example bootstrap.shared(groups=A-B-C, line=1-3-5, calc=jabund-sorabund, iters=100)." << "\n";
164                 cout << "The default value for groups is all the groups in your groupfile." << "\n";
165                 cout << "The default value for calc is jclass-thetayc. The default for iters is 1000." << "\n";
166         }
167         catch(exception& e) {
168                 cout << "Standard Error: " << e.what() << " has occurred in the BootSharedCommand class Function help. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
169                 exit(1);
170         }
171         catch(...) {
172                 cout << "An unknown error has occurred in the BootSharedCommand class function help. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
173                 exit(1);
174         }       
175 }
176
177 //**********************************************************************************************************************
178
179 BootSharedCommand::~BootSharedCommand(){
180         //made new in execute
181         if (abort == false) {
182                 delete input;
183                 delete read;
184                 delete util;
185         }
186 }
187
188 //**********************************************************************************************************************
189
190 int BootSharedCommand::execute(){
191         try {
192         
193                 if (abort == true) {    return 0;       }
194         
195                 int count = 1;
196                 util = new SharedUtil();        
197         
198                 //read first line
199                 read = new ReadOTUFile(globaldata->inputFileName);      
200                 read->read(&*globaldata); 
201                 input = globaldata->ginput;
202                 order = input->getSharedOrderVector();
203                 SharedOrderVector* lastOrder = order;
204                 
205                 //if the users entered no valid calculators don't execute command
206                 if (treeCalculators.size() == 0) { return 0; }
207
208                 //if the users enters label "0.06" and there is no "0.06" in their file use the next lowest label.
209                 set<string> processedLabels;
210                 set<string> userLabels = labels;
211                 set<int> userLines = lines;
212                                 
213                 //set users groups
214                 util->setGroups(globaldata->Groups, globaldata->gGroupmap->namesOfGroups, "treegroup");
215                 numGroups = globaldata->Groups.size();
216                 
217                 //clear globaldatas old tree names if any
218                 globaldata->Treenames.clear();
219                 
220                 //fills globaldatas tree names
221                 globaldata->Treenames = globaldata->Groups;
222                 
223                 //create treemap class from groupmap for tree class to use
224                 tmap = new TreeMap();
225                 tmap->makeSim(globaldata->gGroupmap);
226                 globaldata->gTreemap = tmap;
227                         
228                 while((order != NULL) && ((allLines == 1) || (userLabels.size() != 0) || (userLines.size() != 0))) {
229                 
230                         if(allLines == 1 || lines.count(count) == 1 || labels.count(order->getLabel()) == 1){                   
231                                 
232                                 cout << order->getLabel() << '\t' << count << endl;
233                                 process(order);
234                                 
235                                 processedLabels.insert(order->getLabel());
236                                 userLabels.erase(order->getLabel());
237                                 userLines.erase(count);
238                         }
239                         
240                         //you have a label the user want that is smaller than this line and the last line has not already been processed
241                         if ((anyLabelsToProcess(order->getLabel(), userLabels, "") == true) && (processedLabels.count(lastOrder->getLabel()) != 1)) {
242                                                                                         
243                                 cout << lastOrder->getLabel() << '\t' << count << endl;
244                                 process(lastOrder);
245
246                                 processedLabels.insert(lastOrder->getLabel());
247                                 userLabels.erase(lastOrder->getLabel());
248                         }
249                         
250                         if (count != 1) { delete lastOrder; }
251                         lastOrder = order;                      
252
253                         //get next line to process
254                         order = input->getSharedOrderVector();
255                         count++;
256                 }
257                 
258                 //output error messages about any remaining user labels
259                 set<string>::iterator it;
260                 bool needToRun = false;
261                 for (it = userLabels.begin(); it != userLabels.end(); it++) {  
262                         cout << "Your file does not include the label "<< *it; 
263                         if (processedLabels.count(lastOrder->getLabel()) != 1) {
264                                 cout << ". I will use " << lastOrder->getLabel() << "." << endl;
265                                 needToRun = true;
266                         }else {
267                                 cout << ". Please refer to " << lastOrder->getLabel() << "." << endl;
268                         }
269                 }
270                 
271                 //run last line if you need to
272                 if (needToRun == true)  {
273                         process(lastOrder);                     
274                         cout << lastOrder->getLabel() << '\t' << count << endl;
275                 }
276                 
277                 delete lastOrder;
278
279                 //reset groups parameter
280                 globaldata->Groups.clear();  
281
282                 return 0;
283         }
284         catch(exception& e) {
285                 cout << "Standard Error: " << e.what() << " has occurred in the BootSharedCommand class Function execute. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
286                 exit(1);
287         }
288         catch(...) {
289                 cout << "An unknown error has occurred in the BootSharedCommand class function execute. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
290                 exit(1);
291         }               
292 }
293 //**********************************************************************************************************************
294
295 void BootSharedCommand::createTree(ostream* out){
296         try {
297                 //create tree
298                 t = new Tree();
299                 
300                 //do merges and create tree structure by setting parents and children
301                 //there are numGroups - 1 merges to do
302                 for (int i = 0; i < (numGroups - 1); i++) {
303                 
304                         float largest = -1.0;
305                         int row, column;
306                         //find largest value in sims matrix by searching lower triangle
307                         for (int j = 1; j < simMatrix.size(); j++) {
308                                 for (int k = 0; k < j; k++) {
309                                         if (simMatrix[j][k] > largest) {  largest = simMatrix[j][k]; row = j; column = k;  }
310                                 }
311                         }
312
313                         //set non-leaf node info and update leaves to know their parents
314                         //non-leaf
315                         t->tree[numGroups + i].setChildren(index[row], index[column]);
316                 
317                         //parents
318                         t->tree[index[row]].setParent(numGroups + i);
319                         t->tree[index[column]].setParent(numGroups + i);
320                         
321                         //blength = distance / 2;
322                         float blength = ((1.0 - largest) / 2);
323                         
324                         //branchlengths
325                         t->tree[index[row]].setBranchLength(blength - t->tree[index[row]].getLengthToLeaves());
326                         t->tree[index[column]].setBranchLength(blength - t->tree[index[column]].getLengthToLeaves());
327                 
328                         //set your length to leaves to your childs length plus branchlength
329                         t->tree[numGroups + i].setLengthToLeaves(t->tree[index[row]].getLengthToLeaves() + t->tree[index[row]].getBranchLength());
330                         
331                 
332                         //update index 
333                         index[row] = numGroups+i;
334                         index[column] = numGroups+i;
335                         
336                         //zero out highest value that caused the merge.
337                         simMatrix[row][column] = -1.0;
338                         simMatrix[column][row] = -1.0;
339                 
340                         //merge values in simsMatrix
341                         for (int n = 0; n < simMatrix.size(); n++)      {
342                                 //row becomes merge of 2 groups
343                                 simMatrix[row][n] = (simMatrix[row][n] + simMatrix[column][n]) / 2;
344                                 simMatrix[n][row] = simMatrix[row][n];
345                                 //delete column
346                                 simMatrix[column][n] = -1.0;
347                                 simMatrix[n][column] = -1.0;
348                         }
349                 }
350
351                 //assemble tree
352                 t->assembleTree();
353         
354                 //print newick file
355                 t->print(*out);
356         
357                 //delete tree
358                 delete t;
359         
360         }
361         catch(exception& e) {
362                 cout << "Standard Error: " << e.what() << " has occurred in the BootSharedCommand class Function createTree. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
363                 exit(1);
364         }
365         catch(...) {
366                 cout << "An unknown error has occurred in the BootSharedCommand class function createTree. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
367                 exit(1);
368         }
369 }
370 /***********************************************************/
371 void BootSharedCommand::printSims() {
372         try {
373                 cout << "simsMatrix" << endl;
374                 for (int m = 0; m < simMatrix.size(); m++)      {
375                         for (int n = 0; n < simMatrix.size(); n++)      {
376                                 cout << simMatrix[m][n] << '\t'; 
377                         }
378                         cout << endl;
379                 }
380
381         }
382         catch(exception& e) {
383                 cout << "Standard Error: " << e.what() << " has occurred in the BootSharedCommand class Function printSims. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
384                 exit(1);
385         }
386         catch(...) {
387                 cout << "An unknown error has occurred in the BootSharedCommand class function printSims. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
388                 exit(1);
389         }               
390 }
391 /***********************************************************/
392 void BootSharedCommand::process(SharedOrderVector* order) {
393         try{
394                                 EstOutput data;
395                                 vector<SharedRAbundVector*> subset;
396                                 
397                                 //open an ostream for each calc to print to
398                                 for (int z = 0; z < treeCalculators.size(); z++) {
399                                         //create a new filename
400                                         outputFile = getRootName(globaldata->inputFileName) + treeCalculators[z]->getName() + ".boot" + order->getLabel() + ".tre";
401                                         openOutputFile(outputFile, *(out[z]));
402                                 }
403                                 
404                                 //create a file for each calculator with the 1000 trees in it.
405                                 for (int p = 0; p < iters; p++) {
406                                         
407                                         util->getSharedVectorswithReplacement(Groups, lookup, order);  //fills group vectors from order vector.
408                                 
409                                         //for each calculator                                                                                           
410                                         for(int i = 0 ; i < treeCalculators.size(); i++) {
411                                         
412                                                 //initialize simMatrix
413                                                 simMatrix.clear();
414                                                 simMatrix.resize(numGroups);
415                                                 for (int m = 0; m < simMatrix.size(); m++)      {
416                                                         for (int j = 0; j < simMatrix.size(); j++)      {
417                                                                 simMatrix[m].push_back(0.0);
418                                                         }
419                                                 }
420                                 
421                                                 //initialize index
422                                                 index.clear();
423                                                 for (int g = 0; g < numGroups; g++) {   index[g] = g;   }
424                                                         
425                                                 for (int k = 0; k < lookup.size(); k++) { // pass cdd each set of groups to commpare
426                                                         for (int l = k; l < lookup.size(); l++) {
427                                                                 if (k != l) { //we dont need to similiarity of a groups to itself
428                                                                         subset.clear(); //clear out old pair of sharedrabunds
429                                                                         //add new pair of sharedrabunds
430                                                                         subset.push_back(lookup[k]); subset.push_back(lookup[l]); 
431                                                                         
432                                                                         //get estimated similarity between 2 groups
433                                                                         data = treeCalculators[i]->getValues(subset); //saves the calculator outputs
434                                                                         //save values in similarity matrix
435                                                                         simMatrix[k][l] = data[0];
436                                                                         simMatrix[l][k] = data[0];
437                                                                 }
438                                                         }
439                                                 }
440                                 
441                                                 //creates tree from similarity matrix and write out file
442                                                 createTree(out[i]);
443                                         }
444                                 }
445                                 //close ostream for each calc
446                                 for (int z = 0; z < treeCalculators.size(); z++) { out[z]->close(); }
447
448         }
449         catch(exception& e) {
450                 cout << "Standard Error: " << e.what() << " has occurred in the BootSharedCommand class Function process. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
451                 exit(1);
452         }
453         catch(...) {
454                 cout << "An unknown error has occurred in the BootSharedCommand class function process. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
455                 exit(1);
456         }               
457 }
458 /***********************************************************/
459
460
461