pintail.h

   1 #ifndef PINTAIL_H
   2 #define PINTAIL_H
   3
   4 /*
   5  *  pintail.h
   6  *  Mothur
   7  *
   8  *  Created by Sarah Westcott on 7/9/09.
   9  *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
  10  *
  11  */
  12
  13 #include "chimera.h"
  14 #include "dist.h"
  15 #include "decalc.h"
  16
  17 /***********************************************************/
  18 //This class was created using the algorythms described in the
  19 // "At Least 1 in 20 16S rRNA Sequence Records Currently Held in the Public Repositories is Estimated To Contain Substantial Anomalies" paper
  20 //by Kevin E. Ashelford 1, Nadia A. Chuzhanova 3, John C. Fry 1, Antonia J. Jones 2 and Andrew J. Weightman 1.
  21
  22 /***********************************************************/
  23
  24 class Pintail : public Chimera {
  25
  26         public:
  27                 Pintail(string, string, string);
  28                 ~Pintail();
  29
  30                 int getChimeras();
  31                 void print(ostream&);
  32
  33                 void setCons(string c)          { consfile = c;  }
  34                 void setQuantiles(string q) { quanfile = q;  }
  35
  36
  37         private:
  38
  39                 Dist* distcalculator;
  40                 DeCalculator* decalc;
  41                 int iters;
  42                 string fastafile, templateFile, consfile;
  43
  44
  45                 vector<linePair*> lines;
  46                 vector<linePair*> templateLines;
  47                 vector<Sequence*> querySeqs;
  48                 vector<Sequence*> templateSeqs;
  49
  50                 vector<Sequence*> bestfit;  //bestfit[0] matches queryseqs[0]...
  51
  52                 vector< vector<float> > obsDistance;  //obsDistance[0] is the vector of observed distances for queryseqs[0]...
  53                 vector< vector<float> > expectedDistance;  //expectedDistance[0] is the vector of expected distances for queryseqs[0]...
  54                 vector<float> deviation;  //deviation[0] is the percentage of mismatched pairs over the whole seq between querySeqs[0] and its best match.
  55                 vector< vector<int> > windowsForeachQuery;  // windowsForeachQuery[0] is a vector containing the starting spot in queryseqs[0] aligned sequence for each window.
  56                                                                                 //this is needed so you can move by bases and not just spots in the alignment
  57
  58                 vector<int> windowSizes;                        //windowSizes[0] = window size of querySeqs[0]
  59                 vector<int> windowSizesTemplate;    //windowSizesTemplate[0] = window size of templateSeqs[0]
  60
  61                 vector< map<int, int> > trimmed;    //trimmed[0] = start and stop of trimmed sequences for querySeqs[0]
  62                 map<int, int>::iterator it;
  63
  64                 vector< vector<float> > Qav;    //Qav[0] is the vector of average variablility for queryseqs[0]...
  65                 vector<float>  seqCoef;                         //seqCoef[0] is the coeff for queryseqs[0]...
  66                 vector<float> DE;                                       //DE[0] is the deviaation for queryseqs[0]...
  67                 vector<float> probabilityProfile;
  68                 vector< vector<float> > quantiles;  //quantiles[0] is the vector of deviations with ceiling score of 1, quantiles[1] is the vector of deviations with ceiling score of 2...
  69                 vector< vector<quanMember> > quantilesMembers;  //quantiles[0] is the vector of deviations with ceiling score of 1, quantiles[1] is the vector of deviations with ceiling score of 2...
  70                 vector< set<int> > h;
  71
  72
  73                 vector<float> readFreq();
  74                 vector<Sequence*> findPairs(int, int);
  75
  76                 void createProcessesSpots();
  77                 void createProcessesPairs();
  78                 void createProcesses();
  79                 void createProcessesQuan();
  80
  81 };
  82
  83 /***********************************************************/
  84
  85 #endif
  86