]> git.donarmstrong.com Git - mothur.git/blob - unifracweightedcommand.h
major change to the tree class to use the count table class instead of tree map....
[mothur.git] / 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 "counttable.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 getOutputFileNameTag(string, string);
32         string getHelpString(); 
33                 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"; }
34                 string getDescription()         { return "generic tests that describes whether two or more communities have the same structure"; }
35
36                 int execute();
37                 void help() { m->mothurOut(getHelpString()); }
38         
39         private:
40                 struct linePair {
41                         int start;
42                         int num;
43                         linePair(int i, int j) : start(i), num(j) {}
44                 };
45                 vector<linePair> lines;
46         CountTable* ct;
47                 FileOutput* output;
48                 vector<Tree*> T;           //user trees
49                 vector<double> utreeScores;  //user tree unweighted scores
50                 vector<double> WScoreSig;  //tree weighted score signifigance when compared to random trees - percentage of random trees with that score or lower.
51                 vector<string> groupComb; // AB. AC, BC...
52                 string sumFile, outputDir;
53                 int iters, numGroups, numComp, counter;
54                 vector< vector<double> > rScores;  //vector<weighted scores for random trees.> each group comb has an entry
55                 vector< vector<double> > uScores;  //vector<weighted scores for user trees.> each group comb has an entry
56                 vector< map<float, float> > rScoreFreq;  //map <weighted score, number of random trees with that score.> -vector entry for each combination.
57                 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                                                                
58                 map<float, float>  validScores;  //map contains scores from random
59                 
60                 bool abort, phylip, random, includeRoot, subsample, consensus;
61                 string groups, itersString, outputForm, treefile, groupfile, namefile, countfile;
62                 vector<string> Groups, outputNames; //holds groups to be used
63                 int processors, subsampleSize, subsampleIters;
64                 ofstream outSum;
65                 map<string, string> nameMap;
66                 
67                 void printWSummaryFile();
68                 void printWeightedFile();  
69                 void createPhylipFile();
70                 //void removeValidScoresDuplicates();
71                 int findIndex(float, int);
72                 void calculateFreqsCumuls();
73                 int createProcesses(Tree*,  vector< vector<string> >,  vector< vector<double> >&);
74                 int driver(Tree*, vector< vector<string> >, int, int,  vector< vector<double> >&);
75         int runRandomCalcs(Tree*, vector<double>);
76         vector<Tree*> buildTrees(vector< vector<double> >&, int, CountTable&);
77         int getConsensusTrees(vector< vector<double> >&, int);
78         int getAverageSTDMatrices(vector< vector<double> >&, int);
79                 
80 };
81
82
83
84 #endif