classifyseqscommand.cpp

   1 /*
   2  *  classifyseqscommand.cpp
   3  *  Mothur
   4  *
   5  *  Created by westcott on 11/2/09.
   6  *  Copyright 2009 Schloss Lab. All rights reserved.
   7  *
   8  */
   9
  10 #include "classifyseqscommand.h"
  11 #include "sequence.hpp"
  12 #include "bayesian.h"
  13 #include "phylotree.h"
  14 #include "knn.h"
  15
  16 //**********************************************************************************************************************
  17
  18 ClassifySeqsCommand::ClassifySeqsCommand(string option){
  19         try {
  20                 abort = false;
  21
  22                 //allow user to run help
  23                 if(option == "help") { help(); abort = true; }
  24
  25                 else {
  26
  27                         //valid paramters for this command
  28                         string AlignArray[] =  {"template","fasta","search","ksize","method","processors","taxonomy","match","mismatch","gapopen","gapextend","numwanted","cutoff"};
  29                         vector<string> myArray (AlignArray, AlignArray+(sizeof(AlignArray)/sizeof(string)));
  30
  31                         OptionParser parser(option);
  32                         map<string, string> parameters = parser.getParameters();
  33
  34                         ValidParameters validParameter;
  35
  36                         //check to make sure all parameters are valid for command
  37                         for (map<string, string>::iterator it = parameters.begin(); it != parameters.end(); it++) {
  38                                 if (validParameter.isValidParameter(it->first, myArray, it->second) != true) {  abort = true;  }
  39                         }
  40
  41                         //check for required parameters
  42                         templateFileName = validParameter.validFile(parameters, "template", true);
  43                         if (templateFileName == "not found") {
  44                                 mothurOut("template is a required parameter for the classify.seqs command.");
  45                                 mothurOutEndLine();
  46                                 abort = true;
  47                         }
  48                         else if (templateFileName == "not open") { abort = true; }
  49
  50                         fastaFileName = validParameter.validFile(parameters, "fasta", true);
  51                         if (fastaFileName == "not found") {
  52                                 mothurOut("fasta is a required parameter for the classify.seqs command.");
  53                                 mothurOutEndLine();
  54                                 abort = true;
  55                         }
  56                         else if (fastaFileName == "not open") { abort = true; }
  57
  58                         taxonomyFileName = validParameter.validFile(parameters, "taxonomy", true);
  59                         if (taxonomyFileName == "not found") {
  60                                 mothurOut("taxonomy is a required parameter for the classify.seqs command.");
  61                                 mothurOutEndLine();
  62                                 abort = true;
  63                         }
  64                         else if (taxonomyFileName == "not open") { abort = true; }
  65
  66
  67                         //check for optional parameter and set defaults
  68                         // ...at some point should added some additional type checking...
  69                         string temp;
  70                         temp = validParameter.validFile(parameters, "ksize", false);            if (temp == "not found"){       temp = "8";                             }
  71                         convert(temp, kmerSize);
  72
  73                         temp = validParameter.validFile(parameters, "processors", false);       if (temp == "not found"){       temp = "1";                             }
  74                         convert(temp, processors);
  75
  76                         search = validParameter.validFile(parameters, "search", false);         if (search == "not found"){     search = "kmer";                }
  77
  78                         method = validParameter.validFile(parameters, "method", false);         if (method == "not found"){     method = "bayesian";    }
  79
  80                         temp = validParameter.validFile(parameters, "match", false);            if (temp == "not found"){       temp = "1.0";                   }
  81                         convert(temp, match);
  82
  83                         temp = validParameter.validFile(parameters, "mismatch", false);         if (temp == "not found"){       temp = "-1.0";                  }
  84                         convert(temp, misMatch);
  85
  86                         temp = validParameter.validFile(parameters, "gapopen", false);          if (temp == "not found"){       temp = "-2.0";                  }
  87                         convert(temp, gapOpen);
  88
  89                         temp = validParameter.validFile(parameters, "gapextend", false);        if (temp == "not found"){       temp = "-1.0";                  }
  90                         convert(temp, gapExtend);
  91
  92                         temp = validParameter.validFile(parameters, "numwanted", false);        if (temp == "not found"){       temp = "10";                    }
  93                         convert(temp, numWanted);
  94
  95                         temp = validParameter.validFile(parameters, "cutoff", false);           if (temp == "not found"){       temp = "0";                             }
  96                         convert(temp, cutoff);
  97
  98
  99                         if ((method == "bayesian") && (search != "kmer"))  {
 100                                 mothurOut("The bayesian method requires the kmer search." + search + "will be disregarded." ); mothurOutEndLine();
 101                                 search = "kmer";
 102                         }
 103                 }
 104
 105         }
 106         catch(exception& e) {
 107                 errorOut(e, "ClassifySeqsCommand", "ClassifySeqsCommand");
 108                 exit(1);
 109         }
 110 }
 111
 112 //**********************************************************************************************************************
 113
 114 ClassifySeqsCommand::~ClassifySeqsCommand(){
 115
 116         if (abort == false) {
 117                 for (int i = 0; i < lines.size(); i++) {  delete lines[i];  }  lines.clear();
 118         }
 119 }
 120
 121 //**********************************************************************************************************************
 122
 123 void ClassifySeqsCommand::help(){
 124         try {
 125                 mothurOut("The classify.seqs command reads a fasta file containing sequences and creates a .taxonomy file and a .tax.summary file.\n");
 126                 mothurOut("The classify.seqs command parameters are template, fasta, search, ksize, method, taxonomy, processors, match, mismatch, gapopen, gapextend and numwanted.\n");
 127                 mothurOut("The template, fasta and taxonomy parameters are required.\n");
 128                 mothurOut("The search parameter allows you to specify the method to find most similar template.  Your options are: suffix, kmer and blast. The default is kmer.\n");
 129                 mothurOut("The method parameter allows you to specify classification method to use.  Your options are: bayesian and knn. The default is bayesian.\n");
 130                 mothurOut("The ksize parameter allows you to specify the kmer size for finding most similar template to candidate.  The default is 8.\n");
 131                 mothurOut("The processors parameter allows you to specify the number of processors to use. The default is 1.\n");
 132                 mothurOut("The match parameter allows you to specify the bonus for having the same base. The default is 1.0.\n");
 133                 mothurOut("The mistmatch parameter allows you to specify the penalty for having different bases.  The default is -1.0.\n");
 134                 mothurOut("The gapopen parameter allows you to specify the penalty for opening a gap in an alignment. The default is -1.0.\n");
 135                 mothurOut("The gapextend parameter allows you to specify the penalty for extending a gap in an alignment.  The default is -2.0.\n");
 136                 mothurOut("The numwanted parameter allows you to specify the number of sequence matches you want with the knn method.  The default is 10.\n");
 137                 mothurOut("The cutoff parameter allows you to specify a bootstrap confidence threshold for your taxonomy.  The default is 0.\n");
 138                 mothurOut("The classify.seqs command should be in the following format: \n");
 139                 mothurOut("classify.seqs(template=yourTemplateFile, fasta=yourFastaFile, method=yourClassificationMethod, search=yourSearchmethod, ksize=yourKmerSize, taxonomy=yourTaxonomyFile, processors=yourProcessors) \n");
 140                 mothurOut("Example classify.seqs(fasta=amazon.fasta, template=core.filtered, method=knn, search=gotoh, ksize=8, processors=2)\n");
 141                 mothurOut("The .taxonomy file consists of 2 columns: 1 = your sequence name, 2 = the taxonomy for your sequence. \n");
 142                 mothurOut("The .tax.summary is a summary of the different taxonomies represented in your fasta file. \n");
 143                 mothurOut("Note: No spaces between parameter labels (i.e. fasta), '=' and parameters (i.e.yourFastaFile).\n\n");
 144         }
 145         catch(exception& e) {
 146                 errorOut(e, "ClassifySeqsCommand", "help");
 147                 exit(1);
 148         }
 149 }
 150
 151
 152 //**********************************************************************************************************************
 153
 154 int ClassifySeqsCommand::execute(){
 155         try {
 156                 if (abort == true) {    return 0;       }
 157
 158
 159
 160                 if(method == "bayesian")                        {       classify = new Bayesian(taxonomyFileName, templateFileName, search, kmerSize, cutoff);          }
 161                 else if(method == "knn")                        {       classify = new Knn(taxonomyFileName, templateFileName, search, kmerSize, gapOpen, gapExtend, match, misMatch, numWanted);                               }
 162                 else {
 163                         mothurOut(search + " is not a valid method option. I will run the command using bayesian.");
 164                         mothurOutEndLine();
 165                         classify = new Bayesian(taxonomyFileName, templateFileName, search, kmerSize, cutoff);
 166                 }
 167
 168                 int numFastaSeqs = 0;
 169
 170                 string newTaxonomyFile = getRootName(fastaFileName) + "taxonomy";
 171                 string tempTaxonomyFile = getRootName(fastaFileName) + "taxonomy.temp";
 172                 string taxSummary = getRootName(fastaFileName) + "tax.summary";
 173
 174                 int start = time(NULL);
 175 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
 176                 if(processors == 1){
 177                         ifstream inFASTA;
 178                         openInputFile(fastaFileName, inFASTA);
 179                         numFastaSeqs=count(istreambuf_iterator<char>(inFASTA),istreambuf_iterator<char>(), '>');
 180                         inFASTA.close();
 181
 182                         lines.push_back(new linePair(0, numFastaSeqs));
 183
 184                         driver(lines[0], newTaxonomyFile, tempTaxonomyFile);
 185                 }
 186                 else{
 187                         vector<int> positions;
 188                         processIDS.resize(0);
 189
 190                         ifstream inFASTA;
 191                         openInputFile(fastaFileName, inFASTA);
 192
 193                         string input;
 194                         while(!inFASTA.eof()){
 195                                 input = getline(inFASTA);
 196                                 if (input.length() != 0) {
 197                                         if(input[0] == '>'){    int pos = inFASTA.tellg(); positions.push_back(pos - input.length() - 1);       }
 198                                 }
 199                         }
 200                         inFASTA.close();
 201
 202                         numFastaSeqs = positions.size();
 203
 204                         int numSeqsPerProcessor = numFastaSeqs / processors;
 205
 206                         for (int i = 0; i < processors; i++) {
 207                                 int startPos = positions[ i * numSeqsPerProcessor ];
 208                                 if(i == processors - 1){
 209                                         numSeqsPerProcessor = numFastaSeqs - i * numSeqsPerProcessor;
 210                                 }
 211                                 lines.push_back(new linePair(startPos, numSeqsPerProcessor));
 212                         }
 213                         createProcesses(newTaxonomyFile, tempTaxonomyFile);
 214
 215                         rename((newTaxonomyFile + toString(processIDS[0]) + ".temp").c_str(), newTaxonomyFile.c_str());
 216                         rename((tempTaxonomyFile + toString(processIDS[0]) + ".temp").c_str(), tempTaxonomyFile.c_str());
 217
 218                         for(int i=1;i<processors;i++){
 219                                 appendTaxFiles((newTaxonomyFile + toString(processIDS[i]) + ".temp"), newTaxonomyFile);
 220                                 appendTaxFiles((tempTaxonomyFile + toString(processIDS[i]) + ".temp"), tempTaxonomyFile);
 221                                 remove((newTaxonomyFile + toString(processIDS[i]) + ".temp").c_str());
 222                                 remove((tempTaxonomyFile + toString(processIDS[i]) + ".temp").c_str());
 223                         }
 224
 225                 }
 226 #else
 227                 ifstream inFASTA;
 228                 openInputFile(fastaFileName, inFASTA);
 229                 numFastaSeqs=count(istreambuf_iterator<char>(inFASTA),istreambuf_iterator<char>(), '>');
 230                 inFASTA.close();
 231
 232                 lines.push_back(new linePair(0, numFastaSeqs));
 233
 234                 driver(lines[0], newTaxonomyFile, tempTaxonomyFile);
 235 #endif
 236                 delete classify;
 237
 238                 //make taxonomy tree from new taxonomy file
 239                 ifstream inTaxonomy;
 240                 openInputFile(tempTaxonomyFile, inTaxonomy);
 241
 242                 string accession, taxaList;
 243                 PhyloTree taxaBrowser;
 244
 245                 //read in users taxonomy file and add sequences to tree
 246                 while(!inTaxonomy.eof()){
 247                         inTaxonomy >> accession >> taxaList;
 248
 249                         taxaBrowser.addSeqToTree(accession, taxaList);
 250
 251                         gobble(inTaxonomy);
 252                 }
 253                 inTaxonomy.close();
 254                 remove(tempTaxonomyFile.c_str());
 255
 256                 taxaBrowser.assignHeirarchyIDs(0);
 257
 258                 ofstream outTaxTree;
 259                 openOutputFile(taxSummary, outTaxTree);
 260
 261                 taxaBrowser.print(outTaxTree);
 262
 263                 mothurOutEndLine();
 264                 mothurOut("It took " + toString(time(NULL) - start) + " secs to classify " + toString(numFastaSeqs) + " sequences.");
 265                 mothurOutEndLine();
 266                 mothurOutEndLine();
 267
 268                 return 0;
 269         }
 270         catch(exception& e) {
 271                 errorOut(e, "ClassifySeqsCommand", "execute");
 272                 exit(1);
 273         }
 274 }
 275 /**************************************************************************************************/
 276
 277 void ClassifySeqsCommand::createProcesses(string taxFileName, string tempTaxFile) {
 278         try {
 279 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
 280                 int process = 0;
 281                 //              processIDS.resize(0);
 282
 283                 //loop through and create all the processes you want
 284                 while (process != processors) {
 285                         int pid = fork();
 286
 287                         if (pid > 0) {
 288                                 processIDS.push_back(pid);  //create map from line number to pid so you can append files in correct order later
 289                                 process++;
 290                         }else if (pid == 0){
 291                                 driver(lines[process], taxFileName + toString(getpid()) + ".temp", tempTaxFile + toString(getpid()) + ".temp");
 292                                 exit(0);
 293                         }else { mothurOut("unable to spawn the necessary processes."); mothurOutEndLine(); exit(0); }
 294                 }
 295
 296                 //force parent to wait until all the processes are done
 297                 for (int i=0;i<processors;i++) {
 298                         int temp = processIDS[i];
 299                         wait(&temp);
 300                 }
 301 #endif
 302         }
 303         catch(exception& e) {
 304                 errorOut(e, "ClassifySeqsCommand", "createProcesses");
 305                 exit(1);
 306         }
 307 }
 308 /**************************************************************************************************/
 309
 310 void ClassifySeqsCommand::appendTaxFiles(string temp, string filename) {
 311         try{
 312
 313                 ofstream output;
 314                 ifstream input;
 315                 openOutputFileAppend(filename, output);
 316                 openInputFile(temp, input);
 317
 318                 while(char c = input.get()){
 319                         if(input.eof())         {       break;                  }
 320                         else                            {       output << c;    }
 321                 }
 322
 323                 input.close();
 324                 output.close();
 325         }
 326         catch(exception& e) {
 327                 errorOut(e, "ClassifySeqsCommand", "appendTaxFiles");
 328                 exit(1);
 329         }
 330 }
 331
 332 //**********************************************************************************************************************
 333
 334 int ClassifySeqsCommand::driver(linePair* line, string taxFName, string tempTFName){
 335         try {
 336                 ofstream outTax;
 337                 openOutputFile(taxFName, outTax);
 338
 339                 ofstream outTaxSimple;
 340                 openOutputFile(tempTFName, outTaxSimple);
 341
 342                 ifstream inFASTA;
 343                 openInputFile(fastaFileName, inFASTA);
 344
 345                 inFASTA.seekg(line->start);
 346
 347                 string taxonomy;
 348
 349                 for(int i=0;i<line->numSeqs;i++){
 350
 351                         Sequence* candidateSeq = new Sequence(inFASTA);
 352
 353                         if (candidateSeq->getName() != "") {
 354                                 taxonomy = classify->getTaxonomy(candidateSeq);
 355
 356                                 if (taxonomy != "bad seq") {
 357                                         outTax << candidateSeq->getName() << '\t' << taxonomy << endl;
 358                                         outTaxSimple << candidateSeq->getName() << '\t' << classify->getSimpleTax() << endl;
 359                                 }
 360                         }
 361                         delete candidateSeq;
 362
 363                         if((i+1) % 100 == 0){
 364                                 mothurOut("Classifying sequence " + toString(i+1)); mothurOutEndLine();
 365                         }
 366                 }
 367
 368                 inFASTA.close();
 369                 outTax.close();
 370                 outTaxSimple.close();
 371
 372                 return 1;
 373         }
 374         catch(exception& e) {
 375                 errorOut(e, "ClassifySeqsCommand", "driver");
 376                 exit(1);
 377         }
 378 }
 379
 380 /**************************************************************************************************/