summarysharedcommand.h

   1 #ifndef SUMMARYSHAREDCOMMAND_H
   2 #define SUMMARYSHAREDCOMMAND_H
   3 /*
   4  *  summarysharedcommand.h
   5  *  Dotur
   6  *
   7  *  Created by Sarah Westcott on 1/2/09.
   8  *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
   9  *
  10  */
  11
  12
  13 #include "command.hpp"
  14 #include "sharedrabundvector.h"
  15 #include "inputdata.h"
  16 #include "calculator.h"
  17 #include "validcalculator.h"
  18 #include "sharedsobscollectsummary.h"
  19 #include "sharedchao1.h"
  20 #include "sharedace.h"
  21 #include "sharednseqs.h"
  22 #include "sharedjabund.h"
  23 #include "sharedsorabund.h"
  24 #include "sharedjclass.h"
  25 #include "sharedsorclass.h"
  26 #include "sharedjest.h"
  27 #include "sharedsorest.h"
  28 #include "sharedthetayc.h"
  29 #include "sharedthetan.h"
  30 #include "sharedkstest.h"
  31 #include "whittaker.h"
  32 #include "sharedochiai.h"
  33 #include "sharedanderbergs.h"
  34 #include "sharedkulczynski.h"
  35 #include "sharedkulczynskicody.h"
  36 #include "sharedlennon.h"
  37 #include "sharedmorisitahorn.h"
  38 #include "sharedbraycurtis.h"
  39 #include "sharedjackknife.h"
  40 #include "whittaker.h"
  41 #include "odum.h"
  42 #include "canberra.h"
  43 #include "structeuclidean.h"
  44 #include "structchord.h"
  45 #include "hellinger.h"
  46 #include "manhattan.h"
  47 #include "structpearson.h"
  48 #include "soergel.h"
  49 #include "spearman.h"
  50 #include "structkulczynski.h"
  51 #include "structchi2.h"
  52 #include "speciesprofile.h"
  53 #include "hamming.h"
  54 #include "gower.h"
  55 #include "memchi2.h"
  56 #include "memchord.h"
  57 #include "memeuclidean.h"
  58 #include "mempearson.h"
  59
  60 class SummarySharedCommand : public Command {
  61
  62 public:
  63         SummarySharedCommand(string);
  64         SummarySharedCommand();
  65         ~SummarySharedCommand() {}
  66
  67         vector<string> setParameters();
  68         string getCommandName()                 { return "summary.shared";                      }
  69         string getCommandCategory()             { return "OTU-Based Approaches";        }
  70         string getHelpString();
  71         string getCitation() { return "http://www.mothur.org/wiki/Summary.shared"; }
  72         string getDescription()         { return "generate a summary file containing calculator values for each line in the OTU data and for all possible comparisons between groups"; }
  73
  74         int execute();
  75         void help() { m->mothurOut(getHelpString()); }
  76
  77
  78 private:
  79         struct linePair {
  80                 int start;
  81                 int end;
  82         };
  83         vector<linePair> lines;
  84         vector<Calculator*> sumCalculators;
  85         InputData* input;
  86
  87         bool abort, allLines, mult, all, createPhylip, subsample;
  88         set<string> labels; //holds labels to be used
  89         string label, calc, groups, sharedfile, output;
  90         vector<string>  Estimators, Groups, outputNames;
  91         vector<SharedRAbundVector*> lookup;
  92         string format, outputDir;
  93         int numGroups, processors, subsampleSize, iters;
  94         int process(vector<SharedRAbundVector*>, string, string);
  95         int driver(vector<SharedRAbundVector*>, int, int, string, string, vector< vector<seqDist> >&);
  96     int printSims(ostream&, vector< vector<double> >&);
  97
  98 };
  99
 100 /**************************************************************************************************/
 101 //custom data structure for threads to use.
 102 //main process handling the calcs that can do more than 2 groups
 103 // This is passed by void pointer so it can be any data type
 104 // that can be passed using a single void pointer (LPVOID).
 105 struct summarySharedData {
 106     vector<SharedRAbundVector*> thisLookup;
 107     vector< vector<seqDist> > calcDists;
 108     vector<string>  Estimators;
 109         unsigned long long start;
 110         unsigned long long end;
 111         MothurOut* m;
 112         string sumFile;
 113
 114         summarySharedData(){}
 115         summarySharedData(string sf, MothurOut* mout, unsigned long long st, unsigned long long en, vector<string> est, vector<SharedRAbundVector*> lu) {
 116                 sumFile = sf;
 117                 m = mout;
 118                 start = st;
 119                 end = en;
 120         Estimators = est;
 121         thisLookup = lu;
 122         }
 123 };
 124 /**************************************************************************************************/
 125 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux) || (__linux__) || (__unix__) || (__unix)
 126 #else
 127 static DWORD WINAPI MySummarySharedThreadFunction(LPVOID lpParam){
 128         summarySharedData* pDataArray;
 129         pDataArray = (summarySharedData*)lpParam;
 130
 131         try {
 132
 133         vector<Calculator*> sumCalculators;
 134         ValidCalculators validCalculator;
 135         for (int i=0; i<pDataArray->Estimators.size(); i++) {
 136             if (validCalculator.isValidCalculator("sharedsummary", pDataArray->Estimators[i]) == true) {
 137                 if (pDataArray->Estimators[i] == "sharedsobs") {
 138                     sumCalculators.push_back(new SharedSobsCS());
 139                 }else if (pDataArray->Estimators[i] == "sharedchao") {
 140                     sumCalculators.push_back(new SharedChao1());
 141                 }else if (pDataArray->Estimators[i] == "sharedace") {
 142                     sumCalculators.push_back(new SharedAce());
 143                 }else if (pDataArray->Estimators[i] == "jabund") {
 144                     sumCalculators.push_back(new JAbund());
 145                 }else if (pDataArray->Estimators[i] == "sorabund") {
 146                     sumCalculators.push_back(new SorAbund());
 147                 }else if (pDataArray->Estimators[i] == "jclass") {
 148                     sumCalculators.push_back(new Jclass());
 149                 }else if (pDataArray->Estimators[i] == "sorclass") {
 150                     sumCalculators.push_back(new SorClass());
 151                 }else if (pDataArray->Estimators[i] == "jest") {
 152                     sumCalculators.push_back(new Jest());
 153                 }else if (pDataArray->Estimators[i] == "sorest") {
 154                     sumCalculators.push_back(new SorEst());
 155                 }else if (pDataArray->Estimators[i] == "thetayc") {
 156                     sumCalculators.push_back(new ThetaYC());
 157                 }else if (pDataArray->Estimators[i] == "thetan") {
 158                     sumCalculators.push_back(new ThetaN());
 159                 }else if (pDataArray->Estimators[i] == "kstest") {
 160                     sumCalculators.push_back(new KSTest());
 161                 }else if (pDataArray->Estimators[i] == "sharednseqs") {
 162                     sumCalculators.push_back(new SharedNSeqs());
 163                 }else if (pDataArray->Estimators[i] == "ochiai") {
 164                     sumCalculators.push_back(new Ochiai());
 165                 }else if (pDataArray->Estimators[i] == "anderberg") {
 166                     sumCalculators.push_back(new Anderberg());
 167                 }else if (pDataArray->Estimators[i] == "kulczynski") {
 168                     sumCalculators.push_back(new Kulczynski());
 169                 }else if (pDataArray->Estimators[i] == "kulczynskicody") {
 170                     sumCalculators.push_back(new KulczynskiCody());
 171                 }else if (pDataArray->Estimators[i] == "lennon") {
 172                     sumCalculators.push_back(new Lennon());
 173                 }else if (pDataArray->Estimators[i] == "morisitahorn") {
 174                     sumCalculators.push_back(new MorHorn());
 175                 }else if (pDataArray->Estimators[i] == "braycurtis") {
 176                     sumCalculators.push_back(new BrayCurtis());
 177                 }else if (pDataArray->Estimators[i] == "whittaker") {
 178                     sumCalculators.push_back(new Whittaker());
 179                 }else if (pDataArray->Estimators[i] == "odum") {
 180                     sumCalculators.push_back(new Odum());
 181                 }else if (pDataArray->Estimators[i] == "canberra") {
 182                     sumCalculators.push_back(new Canberra());
 183                 }else if (pDataArray->Estimators[i] == "structeuclidean") {
 184                     sumCalculators.push_back(new StructEuclidean());
 185                 }else if (pDataArray->Estimators[i] == "structchord") {
 186                     sumCalculators.push_back(new StructChord());
 187                 }else if (pDataArray->Estimators[i] == "hellinger") {
 188                     sumCalculators.push_back(new Hellinger());
 189                 }else if (pDataArray->Estimators[i] == "manhattan") {
 190                     sumCalculators.push_back(new Manhattan());
 191                 }else if (pDataArray->Estimators[i] == "structpearson") {
 192                     sumCalculators.push_back(new StructPearson());
 193                 }else if (pDataArray->Estimators[i] == "soergel") {
 194                     sumCalculators.push_back(new Soergel());
 195                 }else if (pDataArray->Estimators[i] == "spearman") {
 196                     sumCalculators.push_back(new Spearman());
 197                 }else if (pDataArray->Estimators[i] == "structkulczynski") {
 198                     sumCalculators.push_back(new StructKulczynski());
 199                 }else if (pDataArray->Estimators[i] == "speciesprofile") {
 200                     sumCalculators.push_back(new SpeciesProfile());
 201                 }else if (pDataArray->Estimators[i] == "hamming") {
 202                     sumCalculators.push_back(new Hamming());
 203                 }else if (pDataArray->Estimators[i] == "structchi2") {
 204                     sumCalculators.push_back(new StructChi2());
 205                 }else if (pDataArray->Estimators[i] == "gower") {
 206                     sumCalculators.push_back(new Gower());
 207                 }else if (pDataArray->Estimators[i] == "memchi2") {
 208                     sumCalculators.push_back(new MemChi2());
 209                 }else if (pDataArray->Estimators[i] == "memchord") {
 210                     sumCalculators.push_back(new MemChord());
 211                 }else if (pDataArray->Estimators[i] == "memeuclidean") {
 212                     sumCalculators.push_back(new MemEuclidean());
 213                 }else if (pDataArray->Estimators[i] == "mempearson") {
 214                     sumCalculators.push_back(new MemPearson());
 215                 }
 216             }
 217         }
 218
 219         pDataArray->calcDists.resize(sumCalculators.size());
 220
 221                 ofstream outputFileHandle;
 222                 pDataArray->m->openOutputFile(pDataArray->sumFile, outputFileHandle);
 223
 224                 vector<SharedRAbundVector*> subset;
 225                 for (int k = pDataArray->start; k < pDataArray->end; k++) { // pass cdd each set of groups to compare
 226
 227                         for (int l = 0; l < k; l++) {
 228
 229                                 outputFileHandle << pDataArray->thisLookup[0]->getLabel() << '\t';
 230
 231                                 subset.clear(); //clear out old pair of sharedrabunds
 232                                 //add new pair of sharedrabunds
 233                                 subset.push_back(pDataArray->thisLookup[k]); subset.push_back(pDataArray->thisLookup[l]);
 234
 235                                 //sort groups to be alphanumeric
 236                                 if (pDataArray->thisLookup[k]->getGroup() > pDataArray->thisLookup[l]->getGroup()) {
 237                                         outputFileHandle << (pDataArray->thisLookup[l]->getGroup() +'\t' + pDataArray->thisLookup[k]->getGroup()) << '\t'; //print out groups
 238                                 }else{
 239                                         outputFileHandle << (pDataArray->thisLookup[k]->getGroup() +'\t' + pDataArray->thisLookup[l]->getGroup()) << '\t'; //print out groups
 240                                 }
 241
 242                                 for(int i=0;i<sumCalculators.size();i++) {
 243
 244                                         //if this calc needs all groups to calculate the pair load all groups
 245                                         if (sumCalculators[i]->getNeedsAll()) {
 246                                                 //load subset with rest of lookup for those calcs that need everyone to calc for a pair
 247                                                 for (int w = 0; w < pDataArray->thisLookup.size(); w++) {
 248                                                         if ((w != k) && (w != l)) { subset.push_back(pDataArray->thisLookup[w]); }
 249                                                 }
 250                                         }
 251
 252                                         vector<double> tempdata = sumCalculators[i]->getValues(subset); //saves the calculator outputs
 253
 254                                         if (pDataArray->m->control_pressed) { for(int i=0;i<sumCalculators.size();i++){  delete sumCalculators[i]; } outputFileHandle.close(); return 1; }
 255
 256                                         outputFileHandle << '\t';
 257                                         sumCalculators[i]->print(outputFileHandle);
 258
 259                                         seqDist temp(l, k, tempdata[0]);
 260                                         pDataArray->calcDists[i].push_back(temp);
 261                                 }
 262                                 outputFileHandle << endl;
 263                         }
 264                 }
 265
 266                 outputFileHandle.close();
 267         for(int i=0;i<sumCalculators.size();i++){  delete sumCalculators[i]; }
 268
 269                 return 0;
 270
 271         }
 272         catch(exception& e) {
 273                 pDataArray->m->errorOut(e, "SummarySharedCommand", "MySummarySharedThreadFunction");
 274                 exit(1);
 275         }
 276 }
 277 #endif
 278
 279
 280 #endif