unifracweightedcommand.h

   1 #ifndef UNIFRACWEIGHTEDCOMMAND_H
   2 #define UNIFRACWEIGHTEDCOMMAND_H
   3
   4 /*
   5  *  unifracweightedcommand.h
   6  *  Mothur
   7  *
   8  *  Created by Sarah Westcott on 2/9/09.
   9  *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
  10  *
  11  */
  12
  13 #include "command.hpp"
  14 #include "weighted.h"
  15 #include "treemap.h"
  16 #include "progress.hpp"
  17 #include "sharedutilities.h"
  18 #include "fileoutput.h"
  19 #include "readtree.h"
  20
  21 class UnifracWeightedCommand : public Command {
  22
  23         public:
  24                 UnifracWeightedCommand(string);
  25                 UnifracWeightedCommand();
  26                 ~UnifracWeightedCommand() {}
  27
  28                 vector<string> setParameters();
  29                 string getCommandName()                 { return "unifrac.weighted";            }
  30                 string getCommandCategory()             { return "Hypothesis Testing";          }
  31                 string getHelpString();
  32                 string getCitation() { return "Lozupone CA, Hamady M, Kelley ST, Knight R (2007). Quantitative and qualitative beta diversity measures lead to different insights into factors that structure microbial communities. Appl Environ Microbiol 73: 1576-85. \nhttp://www.mothur.org/wiki/Unifrac.weighted"; }
  33                 string getDescription()         { return "generic tests that describes whether two or more communities have the same structure"; }
  34
  35                 int execute();
  36                 void help() { m->mothurOut(getHelpString()); }
  37
  38         private:
  39                 struct linePair {
  40                         int start;
  41                         int num;
  42                         linePair(int i, int j) : start(i), num(j) {}
  43                 };
  44                 vector<linePair> lines;
  45
  46                 ReadTree* read;
  47                 SharedUtil* util;
  48                 FileOutput* output;
  49                 vector<Tree*> T;           //user trees
  50                 vector<double> utreeScores;  //user tree unweighted scores
  51                 vector<double> WScoreSig;  //tree weighted score signifigance when compared to random trees - percentage of random trees with that score or lower.
  52                 vector<string> groupComb; // AB. AC, BC...
  53                 TreeMap* tmap;
  54                 Weighted* weighted;
  55                 string sumFile, outputDir;
  56                 int iters, numGroups, numComp, counter;
  57                 EstOutput userData;                     //weighted score info for user tree
  58                 EstOutput randomData;           //weighted score info for random trees
  59                 vector< vector<double> > rScores;  //vector<weighted scores for random trees.> each group comb has an entry
  60                 vector< vector<double> > uScores;  //vector<weighted scores for user trees.> each group comb has an entry
  61                 vector< map<float, float> > rScoreFreq;  //map <weighted score, number of random trees with that score.> -vector entry for each combination.
  62                 vector< map<float, float> > rCumul;  //map <weighted score, cumulative percentage of number of random trees with that score or higher.> -vector entry for each c
  63                 map<float, float>  validScores;  //map contains scores from random
  64
  65                 bool abort, phylip, random, includeRoot;
  66                 string groups, itersString, outputForm, treefile, groupfile, namefile;
  67                 vector<string> Groups, outputNames; //holds groups to be used
  68                 int processors, numUniquesInName;
  69                 ofstream outSum;
  70                 map<string, string> nameMap;
  71
  72                 void printWSummaryFile();
  73                 void printWeightedFile();
  74                 void createPhylipFile();
  75                 //void removeValidScoresDuplicates();
  76                 int findIndex(float, int);
  77                 void calculateFreqsCumuls();
  78                 int createProcesses(Tree*,  vector< vector<string> >,  vector< vector<double> >&);
  79                 int driver(Tree*, vector< vector<string> >, int, int,  vector< vector<double> >&);
  80                 int readNamesFile();
  81
  82 };
  83
  84
  85
  86 #endif