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","name","search","ksize","method","processors","taxonomy","match","mismatch","gapopen","gapextend","numwanted","cutoff","probs","iters", "outputdir","inputdir"};
  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                         map<string, string>::iterator it;
  36
  37                         //check to make sure all parameters are valid for command
  38                         for (it = parameters.begin(); it != parameters.end(); it++) {
  39                                 if (validParameter.isValidParameter(it->first, myArray, it->second) != true) {  abort = true;  }
  40                         }
  41
  42                         //if the user changes the output directory command factory will send this info to us in the output parameter
  43                         outputDir = validParameter.validFile(parameters, "outputdir", false);           if (outputDir == "not found"){  outputDir = "";         }
  44
  45                         //if the user changes the input directory command factory will send this info to us in the output parameter
  46                         string inputDir = validParameter.validFile(parameters, "inputdir", false);
  47                         if (inputDir == "not found"){   inputDir = "";          }
  48                         else {
  49                                 string path;
  50                                 it = parameters.find("template");
  51                                 //user has given a template file
  52                                 if(it != parameters.end()){
  53                                         path = hasPath(it->second);
  54                                         //if the user has not given a path then, add inputdir. else leave path alone.
  55                                         if (path == "") {       parameters["template"] = inputDir + it->second;         }
  56                                 }
  57
  58                                 it = parameters.find("taxonomy");
  59                                 //user has given a template file
  60                                 if(it != parameters.end()){
  61                                         path = hasPath(it->second);
  62                                         //if the user has not given a path then, add inputdir. else leave path alone.
  63                                         if (path == "") {       parameters["taxonomy"] = inputDir + it->second;         }
  64                                 }
  65                         }
  66
  67                         //check for required parameters
  68                         templateFileName = validParameter.validFile(parameters, "template", true);
  69                         if (templateFileName == "not found") {
  70                                 m->mothurOut("template is a required parameter for the classify.seqs command.");
  71                                 m->mothurOutEndLine();
  72                                 abort = true;
  73                         }
  74                         else if (templateFileName == "not open") { abort = true; }
  75
  76                         fastaFileName = validParameter.validFile(parameters, "fasta", false);
  77                         if (fastaFileName == "not found") { m->mothurOut("fasta is a required parameter for the classify.seqs command."); m->mothurOutEndLine(); abort = true;  }
  78                         else {
  79                                 splitAtDash(fastaFileName, fastaFileNames);
  80
  81                                 //go through files and make sure they are good, if not, then disregard them
  82                                 for (int i = 0; i < fastaFileNames.size(); i++) {
  83                                         if (inputDir != "") {
  84                                                 string path = hasPath(fastaFileNames[i]);
  85                                                 //if the user has not given a path then, add inputdir. else leave path alone.
  86                                                 if (path == "") {       fastaFileNames[i] = inputDir + fastaFileNames[i];               }
  87                                         }
  88
  89                                         int ableToOpen;
  90                                         ifstream in;
  91                                         ableToOpen = openInputFile(fastaFileNames[i], in);
  92                                         if (ableToOpen == 1) {
  93                                                 m->mothurOut(fastaFileNames[i] + " will be disregarded."); m->mothurOutEndLine();
  94                                                 //erase from file list
  95                                                 fastaFileNames.erase(fastaFileNames.begin()+i);
  96                                                 i--;
  97                                         }
  98                                         in.close();
  99                                 }
 100
 101                                 //make sure there is at least one valid file left
 102                                 if (fastaFileNames.size() == 0) { m->mothurOut("no valid files."); m->mothurOutEndLine(); abort = true; }
 103                         }
 104
 105
 106                         taxonomyFileName = validParameter.validFile(parameters, "taxonomy", true);
 107                         if (taxonomyFileName == "not found") {
 108                                 m->mothurOut("taxonomy is a required parameter for the classify.seqs command.");
 109                                 m->mothurOutEndLine();
 110                                 abort = true;
 111                         }
 112                         else if (taxonomyFileName == "not open") { abort = true; }
 113
 114
 115                         namefile = validParameter.validFile(parameters, "name", false);
 116                         if (namefile == "not found") { namefile = "";  }
 117
 118                         else {
 119                                 splitAtDash(namefile, namefileNames);
 120
 121                                 //go through files and make sure they are good, if not, then disregard them
 122                                 for (int i = 0; i < namefileNames.size(); i++) {
 123                                         if (inputDir != "") {
 124                                                 string path = hasPath(namefileNames[i]);
 125                                                 //if the user has not given a path then, add inputdir. else leave path alone.
 126                                                 if (path == "") {       namefileNames[i] = inputDir + namefileNames[i];         }
 127                                         }
 128
 129                                         int ableToOpen;
 130                                         ifstream in;
 131                                         ableToOpen = openInputFile(namefileNames[i], in);
 132                                         if (ableToOpen == 1) {  m->mothurOut("Unable to match name file with fasta file."); m->mothurOutEndLine(); abort = true;        }
 133                                         in.close();
 134                                 }
 135                         }
 136
 137                         if (namefile != "") {
 138                                 if (namefileNames.size() != fastaFileNames.size()) { abort = true; m->mothurOut("If you provide a name file, you must have one for each fasta file."); m->mothurOutEndLine(); }
 139                         }
 140
 141                         //check for optional parameter and set defaults
 142                         // ...at some point should added some additional type checking...
 143                         string temp;
 144                         temp = validParameter.validFile(parameters, "ksize", false);            if (temp == "not found"){       temp = "8";                             }
 145                         convert(temp, kmerSize);
 146
 147                         temp = validParameter.validFile(parameters, "processors", false);       if (temp == "not found"){       temp = "1";                             }
 148                         convert(temp, processors);
 149
 150                         search = validParameter.validFile(parameters, "search", false);         if (search == "not found"){     search = "kmer";                }
 151
 152                         method = validParameter.validFile(parameters, "method", false);         if (method == "not found"){     method = "bayesian";    }
 153
 154                         temp = validParameter.validFile(parameters, "match", false);            if (temp == "not found"){       temp = "1.0";                   }
 155                         convert(temp, match);
 156
 157                         temp = validParameter.validFile(parameters, "mismatch", false);         if (temp == "not found"){       temp = "-1.0";                  }
 158                         convert(temp, misMatch);
 159
 160                         temp = validParameter.validFile(parameters, "gapopen", false);          if (temp == "not found"){       temp = "-2.0";                  }
 161                         convert(temp, gapOpen);
 162
 163                         temp = validParameter.validFile(parameters, "gapextend", false);        if (temp == "not found"){       temp = "-1.0";                  }
 164                         convert(temp, gapExtend);
 165
 166                         temp = validParameter.validFile(parameters, "numwanted", false);        if (temp == "not found"){       temp = "10";                    }
 167                         convert(temp, numWanted);
 168
 169                         temp = validParameter.validFile(parameters, "cutoff", false);           if (temp == "not found"){       temp = "0";                             }
 170                         convert(temp, cutoff);
 171
 172                         temp = validParameter.validFile(parameters, "probs", false);            if (temp == "not found"){       temp = "true";                  }
 173                         probs = isTrue(temp);
 174
 175                         temp = validParameter.validFile(parameters, "iters", false);            if (temp == "not found") { temp = "100";                        }
 176                         convert(temp, iters);
 177
 178
 179
 180                         if ((method == "bayesian") && (search != "kmer"))  {
 181                                 m->mothurOut("The bayesian method requires the kmer search." + search + "will be disregarded." ); m->mothurOutEndLine();
 182                                 search = "kmer";
 183                         }
 184                 }
 185
 186         }
 187         catch(exception& e) {
 188                 m->errorOut(e, "ClassifySeqsCommand", "ClassifySeqsCommand");
 189                 exit(1);
 190         }
 191 }
 192
 193 //**********************************************************************************************************************
 194
 195 ClassifySeqsCommand::~ClassifySeqsCommand(){
 196
 197         if (abort == false) {
 198                 for (int i = 0; i < lines.size(); i++) {  delete lines[i];  }  lines.clear();
 199         }
 200 }
 201
 202 //**********************************************************************************************************************
 203
 204 void ClassifySeqsCommand::help(){
 205         try {
 206                 m->mothurOut("The classify.seqs command reads a fasta file containing sequences and creates a .taxonomy file and a .tax.summary file.\n");
 207                 m->mothurOut("The classify.seqs command parameters are template, fasta, name, search, ksize, method, taxonomy, processors, match, mismatch, gapopen, gapextend, numwanted and probs.\n");
 208                 m->mothurOut("The template, fasta and taxonomy parameters are required. You may enter multiple fasta files by separating their names with dashes. ie. fasta=abrecovery.fasta-amzon.fasta \n");
 209                 m->mothurOut("The search parameter allows you to specify the method to find most similar template.  Your options are: suffix, kmer, blast and distance. The default is kmer.\n");
 210                 m->mothurOut("The name parameter allows you add a names file with your fasta file, if you enter multiple fasta files, you must enter matching names files for them.\n");
 211                 m->mothurOut("The method parameter allows you to specify classification method to use.  Your options are: bayesian and knn. The default is bayesian.\n");
 212                 m->mothurOut("The ksize parameter allows you to specify the kmer size for finding most similar template to candidate.  The default is 8.\n");
 213                 m->mothurOut("The processors parameter allows you to specify the number of processors to use. The default is 1.\n");
 214                 m->mothurOut("The match parameter allows you to specify the bonus for having the same base. The default is 1.0.\n");
 215                 m->mothurOut("The mistmatch parameter allows you to specify the penalty for having different bases.  The default is -1.0.\n");
 216                 m->mothurOut("The gapopen parameter allows you to specify the penalty for opening a gap in an alignment. The default is -2.0.\n");
 217                 m->mothurOut("The gapextend parameter allows you to specify the penalty for extending a gap in an alignment.  The default is -1.0.\n");
 218                 m->mothurOut("The numwanted parameter allows you to specify the number of sequence matches you want with the knn method.  The default is 10.\n");
 219                 m->mothurOut("The cutoff parameter allows you to specify a bootstrap confidence threshold for your taxonomy.  The default is 0.\n");
 220                 m->mothurOut("The probs parameter shut off the bootstrapping results for the bayesian method. The default is true, meaning you want the bootstrapping to be run.\n");
 221                 m->mothurOut("The iters parameter allows you to specify how many iterations to do when calculating the bootstrap confidence score for your taxonomy with the bayesian method.  The default is 100.\n");
 222                 m->mothurOut("The classify.seqs command should be in the following format: \n");
 223                 m->mothurOut("classify.seqs(template=yourTemplateFile, fasta=yourFastaFile, method=yourClassificationMethod, search=yourSearchmethod, ksize=yourKmerSize, taxonomy=yourTaxonomyFile, processors=yourProcessors) \n");
 224                 m->mothurOut("Example classify.seqs(fasta=amazon.fasta, template=core.filtered, method=knn, search=gotoh, ksize=8, processors=2)\n");
 225                 m->mothurOut("The .taxonomy file consists of 2 columns: 1 = your sequence name, 2 = the taxonomy for your sequence. \n");
 226                 m->mothurOut("The .tax.summary is a summary of the different taxonomies represented in your fasta file. \n");
 227                 m->mothurOut("Note: No spaces between parameter labels (i.e. fasta), '=' and parameters (i.e.yourFastaFile).\n\n");
 228         }
 229         catch(exception& e) {
 230                 m->errorOut(e, "ClassifySeqsCommand", "help");
 231                 exit(1);
 232         }
 233 }
 234
 235
 236 //**********************************************************************************************************************
 237
 238 int ClassifySeqsCommand::execute(){
 239         try {
 240                 if (abort == true) {    return 0;       }
 241
 242                 if(method == "bayesian"){       classify = new Bayesian(taxonomyFileName, templateFileName, search, kmerSize, cutoff, iters);           }
 243                 else if(method == "knn"){       classify = new Knn(taxonomyFileName, templateFileName, search, kmerSize, gapOpen, gapExtend, match, misMatch, numWanted);                               }
 244                 else {
 245                         m->mothurOut(search + " is not a valid method option. I will run the command using bayesian.");
 246                         m->mothurOutEndLine();
 247                         classify = new Bayesian(taxonomyFileName, templateFileName, search, kmerSize, cutoff, iters);
 248                 }
 249
 250                 vector<string> outputNames;
 251
 252                 for (int s = 0; s < fastaFileNames.size(); s++) {
 253
 254                         //read namefile
 255                         if(namefile != "") {
 256                                 nameMap.clear(); //remove old names
 257
 258                                 ifstream inNames;
 259                                 openInputFile(namefileNames[s], inNames);
 260
 261                                 string firstCol, secondCol;
 262                                 while(!inNames.eof()) {
 263                                         inNames >> firstCol >> secondCol; gobble(inNames);
 264                                         nameMap[firstCol] = getNumNames(secondCol);  //ex. seq1 seq1,seq3,seq5 -> seq1 = 3.
 265                                 }
 266                                 inNames.close();
 267                         }
 268
 269                         m->mothurOut("Classifying sequences from " + fastaFileNames[s] + " ..." ); m->mothurOutEndLine();
 270
 271                         if (outputDir == "") { outputDir += hasPath(fastaFileNames[s]); }
 272                         string newTaxonomyFile = outputDir + getRootName(getSimpleName(fastaFileNames[s])) + getRootName(getSimpleName(taxonomyFileName)) + "taxonomy";
 273                         string tempTaxonomyFile = outputDir + getRootName(getSimpleName(fastaFileNames[s])) + "taxonomy.temp";
 274                         string taxSummary = outputDir + getRootName(getSimpleName(fastaFileNames[s])) + getRootName(getSimpleName(taxonomyFileName)) + "tax.summary";
 275
 276                         outputNames.push_back(newTaxonomyFile);
 277                         outputNames.push_back(taxSummary);
 278
 279                         int start = time(NULL);
 280                         int numFastaSeqs = 0;
 281                         for (int i = 0; i < lines.size(); i++) {  delete lines[i];  }  lines.clear();
 282
 283 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
 284                         if(processors == 1){
 285                                 ifstream inFASTA;
 286                                 openInputFile(fastaFileNames[s], inFASTA);
 287                                 numFastaSeqs=count(istreambuf_iterator<char>(inFASTA),istreambuf_iterator<char>(), '>');
 288                                 inFASTA.close();
 289
 290                                 lines.push_back(new linePair(0, numFastaSeqs));
 291
 292                                 driver(lines[0], newTaxonomyFile, tempTaxonomyFile, fastaFileNames[s]);
 293                         }
 294                         else{
 295                                 vector<int> positions;
 296                                 processIDS.resize(0);
 297
 298                                 ifstream inFASTA;
 299                                 openInputFile(fastaFileNames[s], inFASTA);
 300
 301                                 string input;
 302                                 while(!inFASTA.eof()){
 303                                         input = getline(inFASTA);
 304                                         if (input.length() != 0) {
 305                                                 if(input[0] == '>'){    int pos = inFASTA.tellg(); positions.push_back(pos - input.length() - 1);       }
 306                                         }
 307                                 }
 308                                 inFASTA.close();
 309
 310                                 numFastaSeqs = positions.size();
 311
 312                                 int numSeqsPerProcessor = numFastaSeqs / processors;
 313
 314                                 for (int i = 0; i < processors; i++) {
 315                                         int startPos = positions[ i * numSeqsPerProcessor ];
 316                                         if(i == processors - 1){
 317                                                 numSeqsPerProcessor = numFastaSeqs - i * numSeqsPerProcessor;
 318                                         }
 319                                         lines.push_back(new linePair(startPos, numSeqsPerProcessor));
 320                                 }
 321                                 createProcesses(newTaxonomyFile, tempTaxonomyFile, fastaFileNames[s]);
 322
 323                                 rename((newTaxonomyFile + toString(processIDS[0]) + ".temp").c_str(), newTaxonomyFile.c_str());
 324                                 rename((tempTaxonomyFile + toString(processIDS[0]) + ".temp").c_str(), tempTaxonomyFile.c_str());
 325
 326                                 for(int i=1;i<processors;i++){
 327                                         appendTaxFiles((newTaxonomyFile + toString(processIDS[i]) + ".temp"), newTaxonomyFile);
 328                                         appendTaxFiles((tempTaxonomyFile + toString(processIDS[i]) + ".temp"), tempTaxonomyFile);
 329                                         remove((newTaxonomyFile + toString(processIDS[i]) + ".temp").c_str());
 330                                         remove((tempTaxonomyFile + toString(processIDS[i]) + ".temp").c_str());
 331                                 }
 332
 333                         }
 334 #else
 335                         ifstream inFASTA;
 336                         openInputFile(fastaFileNames[s], inFASTA);
 337                         numFastaSeqs=count(istreambuf_iterator<char>(inFASTA),istreambuf_iterator<char>(), '>');
 338                         inFASTA.close();
 339
 340                         lines.push_back(new linePair(0, numFastaSeqs));
 341
 342                         driver(lines[0], newTaxonomyFile, tempTaxonomyFile, fastaFileNames[s]);
 343 #endif
 344                         //make taxonomy tree from new taxonomy file
 345                         PhyloTree taxaBrowser;
 346
 347                         ifstream in;
 348                         openInputFile(tempTaxonomyFile, in);
 349
 350                         //read in users taxonomy file and add sequences to tree
 351                         string name, taxon;
 352                         while(!in.eof()){
 353                                 in >> name >> taxon; gobble(in);
 354
 355                                 if (namefile != "") {
 356                                         itNames = nameMap.find(name);
 357
 358                                         if (itNames == nameMap.end()) {
 359                                                 m->mothurOut(name + " is not in your name file please correct."); m->mothurOutEndLine(); exit(1);
 360                                         }else{
 361                                                 for (int i = 0; i < itNames->second; i++) {
 362                                                         taxaBrowser.addSeqToTree(name+toString(i), taxon);  //add it as many times as there are identical seqs
 363                                                 }
 364                                         }
 365                                 }else {  taxaBrowser.addSeqToTree(name, taxon);  } //add it once
 366                         }
 367                         in.close();
 368
 369                         taxaBrowser.assignHeirarchyIDs(0);
 370
 371                         taxaBrowser.binUnclassified();
 372
 373                         remove(tempTaxonomyFile.c_str());
 374
 375                         //print summary file
 376                         ofstream outTaxTree;
 377                         openOutputFile(taxSummary, outTaxTree);
 378                         taxaBrowser.print(outTaxTree);
 379                         outTaxTree.close();
 380
 381                         //output taxonomy with the unclassified bins added
 382                         ifstream inTax;
 383                         openInputFile(newTaxonomyFile, inTax);
 384
 385                         ofstream outTax;
 386                         string unclass = newTaxonomyFile + ".unclass.temp";
 387                         openOutputFile(unclass, outTax);
 388
 389                         //get maxLevel from phylotree so you know how many 'unclassified's to add
 390                         int maxLevel = taxaBrowser.getMaxLevel();
 391
 392                         //read taxfile - this reading and rewriting is done to preserve the confidence sscores.
 393                         while (!inTax.eof()) {
 394                                 inTax >> name >> taxon; gobble(inTax);
 395
 396                                 string newTax = addUnclassifieds(taxon, maxLevel);
 397
 398                                 outTax << name << '\t' << newTax << endl;
 399                         }
 400                         inTax.close();
 401                         outTax.close();
 402
 403                         remove(newTaxonomyFile.c_str());
 404                         rename(unclass.c_str(), newTaxonomyFile.c_str());
 405
 406                         m->mothurOutEndLine();
 407                         m->mothurOut("Output File Names: "); m->mothurOutEndLine();
 408                         for (int i = 0; i < outputNames.size(); i++) {  m->mothurOut(outputNames[i]); m->mothurOutEndLine();    }
 409                         m->mothurOutEndLine();
 410
 411
 412                         m->mothurOutEndLine();
 413                         m->mothurOut("It took " + toString(time(NULL) - start) + " secs to classify " + toString(numFastaSeqs) + " sequences."); m->mothurOutEndLine(); m->mothurOutEndLine();
 414                 }
 415
 416                 delete classify;
 417                 return 0;
 418         }
 419         catch(exception& e) {
 420                 m->errorOut(e, "ClassifySeqsCommand", "execute");
 421                 exit(1);
 422         }
 423 }
 424
 425 /**************************************************************************************************/
 426 string ClassifySeqsCommand::addUnclassifieds(string tax, int maxlevel) {
 427         try{
 428                 string newTax, taxon;
 429                 int level = 0;
 430
 431                 //keep what you have counting the levels
 432                 while (tax.find_first_of(';') != -1) {
 433                         //get taxon
 434                         taxon = tax.substr(0,tax.find_first_of(';'))+';';
 435                         tax = tax.substr(tax.find_first_of(';')+1, tax.length());
 436                         newTax += taxon;
 437                         level++;
 438                 }
 439
 440                 //add "unclassified" until you reach maxLevel
 441                 while (level < maxlevel) {
 442                         newTax += "unclassified;";
 443                         level++;
 444                 }
 445
 446                 return newTax;
 447         }
 448         catch(exception& e) {
 449                 m->errorOut(e, "ClassifySeqsCommand", "addUnclassifieds");
 450                 exit(1);
 451         }
 452 }
 453
 454 /**************************************************************************************************/
 455
 456 void ClassifySeqsCommand::createProcesses(string taxFileName, string tempTaxFile, string filename) {
 457         try {
 458 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
 459                 int process = 0;
 460                 //              processIDS.resize(0);
 461
 462                 //loop through and create all the processes you want
 463                 while (process != processors) {
 464                         int pid = fork();
 465
 466                         if (pid > 0) {
 467                                 processIDS.push_back(pid);  //create map from line number to pid so you can append files in correct order later
 468                                 process++;
 469                         }else if (pid == 0){
 470                                 driver(lines[process], taxFileName + toString(getpid()) + ".temp", tempTaxFile + toString(getpid()) + ".temp", filename);
 471                                 exit(0);
 472                         }else { m->mothurOut("unable to spawn the necessary processes."); m->mothurOutEndLine(); exit(0); }
 473                 }
 474
 475                 //force parent to wait until all the processes are done
 476                 for (int i=0;i<processors;i++) {
 477                         int temp = processIDS[i];
 478                         wait(&temp);
 479                 }
 480 #endif
 481         }
 482         catch(exception& e) {
 483                 m->errorOut(e, "ClassifySeqsCommand", "createProcesses");
 484                 exit(1);
 485         }
 486 }
 487 /**************************************************************************************************/
 488
 489 void ClassifySeqsCommand::appendTaxFiles(string temp, string filename) {
 490         try{
 491
 492                 ofstream output;
 493                 ifstream input;
 494                 openOutputFileAppend(filename, output);
 495                 openInputFile(temp, input);
 496
 497                 while(char c = input.get()){
 498                         if(input.eof())         {       break;                  }
 499                         else                            {       output << c;    }
 500                 }
 501
 502                 input.close();
 503                 output.close();
 504         }
 505         catch(exception& e) {
 506                 m->errorOut(e, "ClassifySeqsCommand", "appendTaxFiles");
 507                 exit(1);
 508         }
 509 }
 510
 511 //**********************************************************************************************************************
 512
 513 int ClassifySeqsCommand::driver(linePair* line, string taxFName, string tempTFName, string filename){
 514         try {
 515                 ofstream outTax;
 516                 openOutputFile(taxFName, outTax);
 517
 518                 ofstream outTaxSimple;
 519                 openOutputFile(tempTFName, outTaxSimple);
 520
 521                 ifstream inFASTA;
 522                 openInputFile(filename, inFASTA);
 523
 524                 inFASTA.seekg(line->start);
 525
 526                 string taxonomy;
 527
 528                 for(int i=0;i<line->numSeqs;i++){
 529
 530                         Sequence* candidateSeq = new Sequence(inFASTA);
 531
 532                         if (candidateSeq->getName() != "") {
 533                                 taxonomy = classify->getTaxonomy(candidateSeq);
 534
 535                                 if (taxonomy != "bad seq") {
 536                                         //output confidence scores or not
 537                                         if (probs) {
 538                                                 outTax << candidateSeq->getName() << '\t' << taxonomy << endl;
 539                                         }else{
 540                                                 outTax << candidateSeq->getName() << '\t' << classify->getSimpleTax() << endl;
 541                                         }
 542
 543                                         outTaxSimple << candidateSeq->getName() << '\t' << classify->getSimpleTax() << endl;
 544                                 }
 545                         }
 546                         delete candidateSeq;
 547
 548                         if((i+1) % 100 == 0){
 549                                 m->mothurOut("Classifying sequence " + toString(i+1)); m->mothurOutEndLine();
 550                         }
 551                 }
 552
 553                 inFASTA.close();
 554                 outTax.close();
 555                 outTaxSimple.close();
 556
 557                 return 1;
 558         }
 559         catch(exception& e) {
 560                 m->errorOut(e, "ClassifySeqsCommand", "driver");
 561                 exit(1);
 562         }
 563 }
 564
 565 /**************************************************************************************************/