2 * classifyseqscommand.cpp
5 * Created by westcott on 11/2/09.
6 * Copyright 2009 Schloss Lab. All rights reserved.
10 #include "classifyseqscommand.h"
14 //**********************************************************************************************************************
15 vector<string> ClassifySeqsCommand::setParameters(){
17 CommandParameter ptaxonomy("taxonomy", "InputTypes", "", "", "none", "none", "none",false,true); parameters.push_back(ptaxonomy);
18 CommandParameter ptemplate("reference", "InputTypes", "", "", "none", "none", "none",false,true); parameters.push_back(ptemplate);
19 CommandParameter pfasta("fasta", "InputTypes", "", "", "none", "none", "none",false,true); parameters.push_back(pfasta);
20 CommandParameter pname("name", "InputTypes", "", "", "none", "none", "none",false,false); parameters.push_back(pname);
21 CommandParameter pgroup("group", "InputTypes", "", "", "none", "none", "none",false,false); parameters.push_back(pgroup);
22 CommandParameter psearch("search", "Multiple", "kmer-blast-suffix-distance", "kmer", "", "", "",false,false); parameters.push_back(psearch);
23 CommandParameter pksize("ksize", "Number", "", "8", "", "", "",false,false); parameters.push_back(pksize);
24 CommandParameter pmethod("method", "Multiple", "bayesian-knn", "bayesian", "", "", "",false,false); parameters.push_back(pmethod);
25 CommandParameter pprocessors("processors", "Number", "", "1", "", "", "",false,false); parameters.push_back(pprocessors);
26 CommandParameter pmatch("match", "Number", "", "1.0", "", "", "",false,false); parameters.push_back(pmatch);
27 CommandParameter pmismatch("mismatch", "Number", "", "-1.0", "", "", "",false,false); parameters.push_back(pmismatch);
28 CommandParameter pgapopen("gapopen", "Number", "", "-2.0", "", "", "",false,false); parameters.push_back(pgapopen);
29 CommandParameter pgapextend("gapextend", "Number", "", "-1.0", "", "", "",false,false); parameters.push_back(pgapextend);
30 //CommandParameter pflip("flip", "Boolean", "", "F", "", "", "",false,false); parameters.push_back(pflip);
31 CommandParameter pcutoff("cutoff", "Number", "", "0", "", "", "",false,true); parameters.push_back(pcutoff);
32 CommandParameter pprobs("probs", "Boolean", "", "T", "", "", "",false,false); parameters.push_back(pprobs);
33 CommandParameter piters("iters", "Number", "", "100", "", "", "",false,true); parameters.push_back(piters);
34 CommandParameter psave("save", "Boolean", "", "F", "", "", "",false,false); parameters.push_back(psave);
35 CommandParameter pnumwanted("numwanted", "Number", "", "10", "", "", "",false,true); parameters.push_back(pnumwanted);
36 CommandParameter pinputdir("inputdir", "String", "", "", "", "", "",false,false); parameters.push_back(pinputdir);
37 CommandParameter poutputdir("outputdir", "String", "", "", "", "", "",false,false); parameters.push_back(poutputdir);
39 vector<string> myArray;
40 for (int i = 0; i < parameters.size(); i++) { myArray.push_back(parameters[i].name); }
44 m->errorOut(e, "ClassifySeqsCommand", "setParameters");
48 //**********************************************************************************************************************
49 string ClassifySeqsCommand::getHelpString(){
51 string helpString = "";
52 helpString += "The classify.seqs command reads a fasta file containing sequences and creates a .taxonomy file and a .tax.summary file.\n";
53 helpString += "The classify.seqs command parameters are reference, fasta, name, search, ksize, method, taxonomy, processors, match, mismatch, gapopen, gapextend, numwanted and probs.\n";
54 helpString += "The reference, 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";
55 helpString += "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";
56 helpString += "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";
57 helpString += "The group parameter allows you add a group file so you can have the summary totals broken up by group.\n";
58 helpString += "The method parameter allows you to specify classification method to use. Your options are: bayesian and knn. The default is bayesian.\n";
59 helpString += "The ksize parameter allows you to specify the kmer size for finding most similar template to candidate. The default is 8.\n";
60 helpString += "The processors parameter allows you to specify the number of processors to use. The default is 1.\n";
62 helpString += "When using MPI, the processors parameter is set to the number of MPI processes running. \n";
64 helpString += "If the save parameter is set to true the reference sequences will be saved in memory, to clear them later you can use the clear.memory command. Default=f.";
65 helpString += "The match parameter allows you to specify the bonus for having the same base. The default is 1.0.\n";
66 helpString += "The mistmatch parameter allows you to specify the penalty for having different bases. The default is -1.0.\n";
67 helpString += "The gapopen parameter allows you to specify the penalty for opening a gap in an alignment. The default is -2.0.\n";
68 helpString += "The gapextend parameter allows you to specify the penalty for extending a gap in an alignment. The default is -1.0.\n";
69 helpString += "The numwanted parameter allows you to specify the number of sequence matches you want with the knn method. The default is 10.\n";
70 helpString += "The cutoff parameter allows you to specify a bootstrap confidence threshold for your taxonomy. The default is 0.\n";
71 helpString += "The probs parameter shuts off the bootstrapping results for the bayesian method. The default is true, meaning you want the bootstrapping to be shown.\n";
72 helpString += "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";
73 //helpString += "The flip parameter allows you shut off mothur's The default is T.\n";
74 helpString += "The classify.seqs command should be in the following format: \n";
75 helpString += "classify.seqs(reference=yourTemplateFile, fasta=yourFastaFile, method=yourClassificationMethod, search=yourSearchmethod, ksize=yourKmerSize, taxonomy=yourTaxonomyFile, processors=yourProcessors) \n";
76 helpString += "Example classify.seqs(fasta=amazon.fasta, reference=core.filtered, method=knn, search=gotoh, ksize=8, processors=2)\n";
77 helpString += "The .taxonomy file consists of 2 columns: 1 = your sequence name, 2 = the taxonomy for your sequence. \n";
78 helpString += "The .tax.summary is a summary of the different taxonomies represented in your fasta file. \n";
79 helpString += "Note: No spaces between parameter labels (i.e. fasta), '=' and parameters (i.e.yourFastaFile).\n";
83 m->errorOut(e, "ClassifySeqsCommand", "getHelpString");
87 //**********************************************************************************************************************
88 ClassifySeqsCommand::ClassifySeqsCommand(){
90 abort = true; calledHelp = true;
92 vector<string> tempOutNames;
93 outputTypes["taxonomy"] = tempOutNames;
94 outputTypes["accnos"] = tempOutNames;
95 outputTypes["taxsummary"] = tempOutNames;
96 outputTypes["matchdist"] = tempOutNames;
99 m->errorOut(e, "ClassifySeqsCommand", "ClassifySeqsCommand");
103 //**********************************************************************************************************************
104 ClassifySeqsCommand::ClassifySeqsCommand(string option) {
106 abort = false; calledHelp = false;
107 rdb = ReferenceDB::getInstance();
109 //allow user to run help
110 if(option == "help") { help(); abort = true; calledHelp = true; }
111 else if(option == "citation") { citation(); abort = true; calledHelp = true;}
114 vector<string> myArray = setParameters();
116 OptionParser parser(option);
117 map<string, string> parameters = parser.getParameters();
119 ValidParameters validParameter("classify.seqs");
120 map<string, string>::iterator it;
122 //check to make sure all parameters are valid for command
123 for (it = parameters.begin(); it != parameters.end(); it++) {
124 if (validParameter.isValidParameter(it->first, myArray, it->second) != true) { abort = true; }
127 //initialize outputTypes
128 vector<string> tempOutNames;
129 outputTypes["taxonomy"] = tempOutNames;
130 outputTypes["taxsummary"] = tempOutNames;
131 outputTypes["matchdist"] = tempOutNames;
132 outputTypes["accnos"] = tempOutNames;
134 //if the user changes the output directory command factory will send this info to us in the output parameter
135 outputDir = validParameter.validFile(parameters, "outputdir", false); if (outputDir == "not found"){ outputDir = ""; }
137 //if the user changes the input directory command factory will send this info to us in the output parameter
138 string inputDir = validParameter.validFile(parameters, "inputdir", false);
139 if (inputDir == "not found"){ inputDir = ""; }
142 it = parameters.find("reference");
143 //user has given a template file
144 if(it != parameters.end()){
145 path = m->hasPath(it->second);
146 //if the user has not given a path then, add inputdir. else leave path alone.
147 if (path == "") { parameters["reference"] = inputDir + it->second; }
150 it = parameters.find("taxonomy");
151 //user has given a template file
152 if(it != parameters.end()){
153 path = m->hasPath(it->second);
154 //if the user has not given a path then, add inputdir. else leave path alone.
155 if (path == "") { parameters["taxonomy"] = inputDir + it->second; }
158 it = parameters.find("group");
159 //user has given a template file
160 if(it != parameters.end()){
161 path = m->hasPath(it->second);
162 //if the user has not given a path then, add inputdir. else leave path alone.
163 if (path == "") { parameters["group"] = inputDir + it->second; }
167 fastaFileName = validParameter.validFile(parameters, "fasta", false);
168 if (fastaFileName == "not found") {
169 //if there is a current fasta file, use it
170 string filename = m->getFastaFile();
171 if (filename != "") { fastaFileNames.push_back(filename); m->mothurOut("Using " + filename + " as input file for the fasta parameter."); m->mothurOutEndLine(); }
172 else { m->mothurOut("You have no current fastafile and the fasta parameter is required."); m->mothurOutEndLine(); abort = true; }
175 m->splitAtDash(fastaFileName, fastaFileNames);
177 //go through files and make sure they are good, if not, then disregard them
178 for (int i = 0; i < fastaFileNames.size(); i++) {
181 if (fastaFileNames[i] == "current") {
182 fastaFileNames[i] = m->getFastaFile();
183 if (fastaFileNames[i] != "") { m->mothurOut("Using " + fastaFileNames[i] + " as input file for the fasta parameter where you had given current."); m->mothurOutEndLine(); }
185 m->mothurOut("You have no current fastafile, ignoring current."); m->mothurOutEndLine(); ignore=true;
186 //erase from file list
187 fastaFileNames.erase(fastaFileNames.begin()+i);
194 if (inputDir != "") {
195 string path = m->hasPath(fastaFileNames[i]);
196 //if the user has not given a path then, add inputdir. else leave path alone.
197 if (path == "") { fastaFileNames[i] = inputDir + fastaFileNames[i]; }
203 ableToOpen = m->openInputFile(fastaFileNames[i], in, "noerror");
205 //if you can't open it, try default location
206 if (ableToOpen == 1) {
207 if (m->getDefaultPath() != "") { //default path is set
208 string tryPath = m->getDefaultPath() + m->getSimpleName(fastaFileNames[i]);
209 m->mothurOut("Unable to open " + fastaFileNames[i] + ". Trying default " + tryPath); m->mothurOutEndLine();
211 ableToOpen = m->openInputFile(tryPath, in2, "noerror");
213 fastaFileNames[i] = tryPath;
217 if (ableToOpen == 1) {
218 if (m->getOutputDir() != "") { //default path is set
219 string tryPath = m->getOutputDir() + m->getSimpleName(fastaFileNames[i]);
220 m->mothurOut("Unable to open " + fastaFileNames[i] + ". Trying output directory " + tryPath); m->mothurOutEndLine();
222 ableToOpen = m->openInputFile(tryPath, in2, "noerror");
224 fastaFileNames[i] = tryPath;
230 if (ableToOpen == 1) {
231 m->mothurOut("Unable to open " + fastaFileNames[i] + ". It will be disregarded."); m->mothurOutEndLine();
232 //erase from file list
233 fastaFileNames.erase(fastaFileNames.begin()+i);
236 m->setFastaFile(fastaFileNames[i]);
242 //make sure there is at least one valid file left
243 if (fastaFileNames.size() == 0) { m->mothurOut("no valid files."); m->mothurOutEndLine(); abort = true; }
246 namefile = validParameter.validFile(parameters, "name", false);
247 if (namefile == "not found") { namefile = ""; }
250 m->splitAtDash(namefile, namefileNames);
252 //go through files and make sure they are good, if not, then disregard them
253 for (int i = 0; i < namefileNames.size(); i++) {
255 if (namefileNames[i] == "current") {
256 namefileNames[i] = m->getNameFile();
257 if (namefileNames[i] != "") { m->mothurOut("Using " + namefileNames[i] + " as input file for the name parameter where you had given current."); m->mothurOutEndLine(); }
259 m->mothurOut("You have no current namefile, ignoring current."); m->mothurOutEndLine(); ignore=true;
260 //erase from file list
261 namefileNames.erase(namefileNames.begin()+i);
268 if (inputDir != "") {
269 string path = m->hasPath(namefileNames[i]);
270 //if the user has not given a path then, add inputdir. else leave path alone.
271 if (path == "") { namefileNames[i] = inputDir + namefileNames[i]; }
276 ableToOpen = m->openInputFile(namefileNames[i], in, "noerror");
278 //if you can't open it, try default location
279 if (ableToOpen == 1) {
280 if (m->getDefaultPath() != "") { //default path is set
281 string tryPath = m->getDefaultPath() + m->getSimpleName(namefileNames[i]);
282 m->mothurOut("Unable to open " + namefileNames[i] + ". Trying default " + tryPath); m->mothurOutEndLine();
284 ableToOpen = m->openInputFile(tryPath, in2, "noerror");
286 namefileNames[i] = tryPath;
290 if (ableToOpen == 1) {
291 if (m->getOutputDir() != "") { //default path is set
292 string tryPath = m->getOutputDir() + m->getSimpleName(namefileNames[i]);
293 m->mothurOut("Unable to open " + namefileNames[i] + ". Trying output directory " + tryPath); m->mothurOutEndLine();
295 ableToOpen = m->openInputFile(tryPath, in2, "noerror");
297 namefileNames[i] = tryPath;
302 if (ableToOpen == 1) {
303 m->mothurOut("Unable to open " + namefileNames[i] + ". It will be disregarded."); m->mothurOutEndLine(); abort = true;
304 //erase from file list
305 namefileNames.erase(namefileNames.begin()+i);
308 m->setNameFile(namefileNames[i]);
314 if (namefile != "") {
315 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(); }
318 groupfile = validParameter.validFile(parameters, "group", false);
319 if (groupfile == "not found") { groupfile = ""; }
321 m->splitAtDash(groupfile, groupfileNames);
323 //go through files and make sure they are good, if not, then disregard them
324 for (int i = 0; i < groupfileNames.size(); i++) {
325 if (inputDir != "") {
326 string path = m->hasPath(groupfileNames[i]);
327 //if the user has not given a path then, add inputdir. else leave path alone.
328 if (path == "") { groupfileNames[i] = inputDir + groupfileNames[i]; }
333 ableToOpen = m->openInputFile(groupfileNames[i], in, "noerror");
335 //if you can't open it, try default location
336 if (ableToOpen == 1) {
337 if (m->getDefaultPath() != "") { //default path is set
338 string tryPath = m->getDefaultPath() + m->getSimpleName(groupfileNames[i]);
339 m->mothurOut("Unable to open " + groupfileNames[i] + ". Trying default " + tryPath); m->mothurOutEndLine();
341 ableToOpen = m->openInputFile(tryPath, in2, "noerror");
343 groupfileNames[i] = tryPath;
347 if (ableToOpen == 1) {
348 if (m->getOutputDir() != "") { //default path is set
349 string tryPath = m->getOutputDir() + m->getSimpleName(groupfileNames[i]);
350 m->mothurOut("Unable to open " + groupfileNames[i] + ". Trying output directory " + tryPath); m->mothurOutEndLine();
352 ableToOpen = m->openInputFile(tryPath, in2, "noerror");
354 groupfileNames[i] = tryPath;
360 if (ableToOpen == 1) {
361 m->mothurOut("Unable to open " + groupfileNames[i] + ". It will be disregarded."); m->mothurOutEndLine(); groupfileNames[i] = "";
362 //erase from file list
363 groupfileNames.erase(groupfileNames.begin()+i);
366 m->setGroupFile(groupfileNames[i]);
371 if (groupfile != "") {
372 if (groupfileNames.size() != fastaFileNames.size()) { abort = true; m->mothurOut("If you provide a group file, you must have one for each fasta file."); m->mothurOutEndLine(); }
374 for (int i = 0; i < fastaFileNames.size(); i++) { groupfileNames.push_back(""); }
377 //check for optional parameter and set defaults
378 // ...at some point should added some additional type checking...
380 temp = validParameter.validFile(parameters, "ksize", false); if (temp == "not found"){ temp = "8"; }
381 m->mothurConvert(temp, kmerSize);
383 temp = validParameter.validFile(parameters, "processors", false); if (temp == "not found"){ temp = m->getProcessors(); }
384 m->setProcessors(temp);
385 m->mothurConvert(temp, processors);
387 temp = validParameter.validFile(parameters, "save", false); if (temp == "not found"){ temp = "f"; }
388 save = m->isTrue(temp);
390 if (save) { //clear out old references
394 //this has to go after save so that if the user sets save=t and provides no reference we abort
395 templateFileName = validParameter.validFile(parameters, "reference", true);
396 if (templateFileName == "not found") {
397 //check for saved reference sequences
398 if (rdb->referenceSeqs.size() != 0) {
399 templateFileName = "saved";
401 m->mothurOut("[ERROR]: You don't have any saved reference sequences and the reference parameter is a required for the classify.seqs command.");
402 m->mothurOutEndLine();
405 }else if (templateFileName == "not open") { abort = true; }
406 else { if (save) { rdb->setSavedReference(templateFileName); } }
408 //this has to go after save so that if the user sets save=t and provides no reference we abort
409 taxonomyFileName = validParameter.validFile(parameters, "taxonomy", true);
410 if (taxonomyFileName == "not found") {
411 //check for saved reference sequences
412 if (rdb->wordGenusProb.size() != 0) {
413 taxonomyFileName = "saved";
415 m->mothurOut("[ERROR]: You don't have any saved taxonomy information and the taxonomy parameter is a required for the classify.seqs command.");
416 m->mothurOutEndLine();
419 }else if (taxonomyFileName == "not open") { abort = true; }
420 else { if (save) { rdb->setSavedTaxonomy(taxonomyFileName); } }
422 search = validParameter.validFile(parameters, "search", false); if (search == "not found"){ search = "kmer"; }
424 method = validParameter.validFile(parameters, "method", false); if (method == "not found"){ method = "bayesian"; }
426 temp = validParameter.validFile(parameters, "match", false); if (temp == "not found"){ temp = "1.0"; }
427 m->mothurConvert(temp, match);
429 temp = validParameter.validFile(parameters, "mismatch", false); if (temp == "not found"){ temp = "-1.0"; }
430 m->mothurConvert(temp, misMatch);
432 temp = validParameter.validFile(parameters, "gapopen", false); if (temp == "not found"){ temp = "-2.0"; }
433 m->mothurConvert(temp, gapOpen);
435 temp = validParameter.validFile(parameters, "gapextend", false); if (temp == "not found"){ temp = "-1.0"; }
436 m->mothurConvert(temp, gapExtend);
438 temp = validParameter.validFile(parameters, "numwanted", false); if (temp == "not found"){ temp = "10"; }
439 m->mothurConvert(temp, numWanted);
441 temp = validParameter.validFile(parameters, "cutoff", false); if (temp == "not found"){ temp = "0"; }
442 m->mothurConvert(temp, cutoff);
444 temp = validParameter.validFile(parameters, "probs", false); if (temp == "not found"){ temp = "true"; }
445 probs = m->isTrue(temp);
447 //temp = validParameter.validFile(parameters, "flip", false); if (temp == "not found"){ temp = "T"; }
448 //flip = m->isTrue(temp);
451 temp = validParameter.validFile(parameters, "iters", false); if (temp == "not found") { temp = "100"; }
452 m->mothurConvert(temp, iters);
455 if ((method == "bayesian") && (search != "kmer")) {
456 m->mothurOut("The bayesian method requires the kmer search." + search + "will be disregarded." ); m->mothurOutEndLine();
460 if (namefileNames.size() == 0){
461 vector<string> files; files.push_back(fastaFileNames[fastaFileNames.size()-1]);
462 parser.getNameFile(files);
468 catch(exception& e) {
469 m->errorOut(e, "ClassifySeqsCommand", "ClassifySeqsCommand");
474 //**********************************************************************************************************************
475 ClassifySeqsCommand::~ClassifySeqsCommand(){
476 if (abort == false) {
477 for (int i = 0; i < lines.size(); i++) { delete lines[i]; } lines.clear();
480 //**********************************************************************************************************************
482 int ClassifySeqsCommand::execute(){
484 if (abort == true) { if (calledHelp) { return 0; } return 2; }
486 if(method == "bayesian"){ classify = new Bayesian(taxonomyFileName, templateFileName, search, kmerSize, cutoff, iters, rand(), flip); }
487 else if(method == "knn"){ classify = new Knn(taxonomyFileName, templateFileName, search, kmerSize, gapOpen, gapExtend, match, misMatch, numWanted, rand()); }
489 m->mothurOut(search + " is not a valid method option. I will run the command using bayesian.");
490 m->mothurOutEndLine();
491 classify = new Bayesian(taxonomyFileName, templateFileName, search, kmerSize, cutoff, iters, rand(), flip);
494 if (m->control_pressed) { delete classify; return 0; }
496 for (int s = 0; s < fastaFileNames.size(); s++) {
498 m->mothurOut("Classifying sequences from " + fastaFileNames[s] + " ..." ); m->mothurOutEndLine();
500 string baseTName = taxonomyFileName;
501 if (taxonomyFileName == "saved") {baseTName = rdb->getSavedTaxonomy(); }
503 string RippedTaxName = m->getRootName(m->getSimpleName(baseTName));
504 RippedTaxName = m->getExtension(RippedTaxName.substr(0, RippedTaxName.length()-1));
505 if (RippedTaxName[0] == '.') { RippedTaxName = RippedTaxName.substr(1, RippedTaxName.length()); }
506 RippedTaxName += ".";
508 if (outputDir == "") { outputDir += m->hasPath(fastaFileNames[s]); }
509 string newTaxonomyFile = outputDir + m->getRootName(m->getSimpleName(fastaFileNames[s])) + RippedTaxName + "taxonomy";
510 string newaccnosFile = outputDir + m->getRootName(m->getSimpleName(fastaFileNames[s])) + RippedTaxName + "flip.accnos";
511 string tempTaxonomyFile = outputDir + m->getRootName(m->getSimpleName(fastaFileNames[s])) + "taxonomy.temp";
512 string taxSummary = outputDir + m->getRootName(m->getSimpleName(fastaFileNames[s])) + RippedTaxName + "tax.summary";
514 if ((method == "knn") && (search == "distance")) {
515 string DistName = outputDir + m->getRootName(m->getSimpleName(fastaFileNames[s])) + "match.dist";
516 classify->setDistName(DistName); outputNames.push_back(DistName); outputTypes["matchdist"].push_back(DistName);
519 outputNames.push_back(newTaxonomyFile); outputTypes["taxonomy"].push_back(newTaxonomyFile);
520 outputNames.push_back(newaccnosFile); outputTypes["accnos"].push_back(newaccnosFile);
521 outputNames.push_back(taxSummary); outputTypes["taxsummary"].push_back(taxSummary);
523 int start = time(NULL);
524 int numFastaSeqs = 0;
525 for (int i = 0; i < lines.size(); i++) { delete lines[i]; } lines.clear();
528 int pid, numSeqsPerProcessor;
530 vector<unsigned long long> MPIPos;
533 MPI_Comm_rank(MPI_COMM_WORLD, &pid); //find out who we are
534 MPI_Comm_size(MPI_COMM_WORLD, &processors);
537 MPI_File outMPINewTax;
538 MPI_File outMPITempTax;
541 int outMode=MPI_MODE_CREATE|MPI_MODE_WRONLY;
542 int inMode=MPI_MODE_RDONLY;
544 char outNewTax[1024];
545 strcpy(outNewTax, newTaxonomyFile.c_str());
547 char outTempTax[1024];
548 strcpy(outTempTax, tempTaxonomyFile.c_str());
551 strcpy(outAcc, newaccnosFile.c_str());
553 char inFileName[1024];
554 strcpy(inFileName, fastaFileNames[s].c_str());
556 MPI_File_open(MPI_COMM_WORLD, inFileName, inMode, MPI_INFO_NULL, &inMPI); //comm, filename, mode, info, filepointer
557 MPI_File_open(MPI_COMM_WORLD, outNewTax, outMode, MPI_INFO_NULL, &outMPINewTax);
558 MPI_File_open(MPI_COMM_WORLD, outTempTax, outMode, MPI_INFO_NULL, &outMPITempTax);
559 MPI_File_open(MPI_COMM_WORLD, outAcc, outMode, MPI_INFO_NULL, &outMPIAcc);
561 if (m->control_pressed) { outputTypes.clear(); MPI_File_close(&inMPI); MPI_File_close(&outMPINewTax); MPI_File_close(&outMPIAcc); MPI_File_close(&outMPITempTax); delete classify; return 0; }
563 if (pid == 0) { //you are the root process
565 MPIPos = m->setFilePosFasta(fastaFileNames[s], numFastaSeqs); //fills MPIPos, returns numSeqs
567 //send file positions to all processes
568 for(int i = 1; i < processors; i++) {
569 MPI_Send(&numFastaSeqs, 1, MPI_INT, i, tag, MPI_COMM_WORLD);
570 MPI_Send(&MPIPos[0], (numFastaSeqs+1), MPI_LONG, i, tag, MPI_COMM_WORLD);
573 //figure out how many sequences you have to align
574 numSeqsPerProcessor = numFastaSeqs / processors;
575 int startIndex = pid * numSeqsPerProcessor;
576 if(pid == (processors - 1)){ numSeqsPerProcessor = numFastaSeqs - pid * numSeqsPerProcessor; }
580 driverMPI(startIndex, numSeqsPerProcessor, inMPI, outMPINewTax, outMPITempTax, outMPIAcc, MPIPos);
582 if (m->control_pressed) { outputTypes.clear(); MPI_File_close(&inMPI); MPI_File_close(&outMPINewTax); MPI_File_close(&outMPIAcc); MPI_File_close(&outMPITempTax); for (int i = 0; i < outputNames.size(); i++) { m->mothurRemove(outputNames[i]); } delete classify; return 0; }
584 for (int i = 1; i < processors; i++) {
586 MPI_Recv(&done, 1, MPI_INT, i, tag, MPI_COMM_WORLD, &status);
588 }else{ //you are a child process
589 MPI_Recv(&numFastaSeqs, 1, MPI_INT, 0, tag, MPI_COMM_WORLD, &status);
590 MPIPos.resize(numFastaSeqs+1);
591 MPI_Recv(&MPIPos[0], (numFastaSeqs+1), MPI_LONG, 0, tag, MPI_COMM_WORLD, &status);
593 //figure out how many sequences you have to align
594 numSeqsPerProcessor = numFastaSeqs / processors;
595 int startIndex = pid * numSeqsPerProcessor;
596 if(pid == (processors - 1)){ numSeqsPerProcessor = numFastaSeqs - pid * numSeqsPerProcessor; }
600 driverMPI(startIndex, numSeqsPerProcessor, inMPI, outMPINewTax, outMPITempTax, outMPIAcc, MPIPos);
602 if (m->control_pressed) { outputTypes.clear(); MPI_File_close(&inMPI); MPI_File_close(&outMPINewTax); MPI_File_close(&outMPIAcc); MPI_File_close(&outMPITempTax); delete classify; return 0; }
605 MPI_Send(&done, 1, MPI_INT, 0, tag, MPI_COMM_WORLD);
609 MPI_File_close(&inMPI);
610 MPI_File_close(&outMPINewTax);
611 MPI_File_close(&outMPITempTax);
612 MPI_File_close(&outMPIAcc);
613 MPI_Barrier(MPI_COMM_WORLD); //make everyone wait - just in case
617 vector<unsigned long long> positions;
618 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
619 positions = m->divideFile(fastaFileNames[s], processors);
620 for (int i = 0; i < (positions.size()-1); i++) { lines.push_back(new linePair(positions[i], positions[(i+1)])); }
622 if (processors == 1) {
623 lines.push_back(new linePair(0, 1000));
625 positions = m->setFilePosFasta(fastaFileNames[s], numFastaSeqs);
627 //figure out how many sequences you have to process
628 int numSeqsPerProcessor = numFastaSeqs / processors;
629 for (int i = 0; i < processors; i++) {
630 int startIndex = i * numSeqsPerProcessor;
631 if(i == (processors - 1)){ numSeqsPerProcessor = numFastaSeqs - i * numSeqsPerProcessor; }
632 lines.push_back(new linePair(positions[startIndex], numSeqsPerProcessor));
637 numFastaSeqs = driver(lines[0], newTaxonomyFile, tempTaxonomyFile, newaccnosFile, fastaFileNames[s]);
639 numFastaSeqs = createProcesses(newTaxonomyFile, tempTaxonomyFile, newaccnosFile, fastaFileNames[s]);
643 if (!m->isBlank(newaccnosFile)) { m->mothurOutEndLine(); m->mothurOut("[WARNING]: mothur suspects some of your sequences may be reversed, please check " + newaccnosFile + " for the list of the sequences."); m->mothurOutEndLine(); }
645 m->mothurOutEndLine();
646 m->mothurOut("It took " + toString(time(NULL) - start) + " secs to classify " + toString(numFastaSeqs) + " sequences."); m->mothurOutEndLine(); m->mothurOutEndLine();
652 if (pid == 0) { //this part does not need to be paralellized
654 if(namefile != "") { m->mothurOut("Reading " + namefileNames[s] + "..."); cout.flush(); MPIReadNamesFile(namefileNames[s]); m->mothurOut(" Done."); m->mothurOutEndLine(); }
659 m->mothurOut("Reading " + namefileNames[s] + "..."); cout.flush();
661 nameMap.clear(); //remove old names
664 m->openInputFile(namefileNames[s], inNames);
666 string firstCol, secondCol;
667 while(!inNames.eof()) {
668 inNames >> firstCol >> secondCol; m->gobble(inNames);
671 m->splitAtComma(secondCol, temp);
673 nameMap[firstCol] = temp;
677 m->mothurOut(" Done."); m->mothurOutEndLine();
682 if (groupfile != "") { group = groupfileNames[s]; }
684 PhyloSummary taxaSum(baseTName, group);
686 if (m->control_pressed) { outputTypes.clear(); for (int i = 0; i < outputNames.size(); i++) { m->mothurRemove(outputNames[i]); } delete classify; return 0; }
688 if (namefile == "") { taxaSum.summarize(tempTaxonomyFile); }
691 m->openInputFile(tempTaxonomyFile, in);
693 //read in users taxonomy file and add sequences to tree
697 in >> name >> taxon; m->gobble(in);
699 itNames = nameMap.find(name);
701 if (itNames == nameMap.end()) {
702 m->mothurOut(name + " is not in your name file please correct."); m->mothurOutEndLine(); exit(1);
704 for (int i = 0; i < itNames->second.size(); i++) {
705 taxaSum.addSeqToTree(itNames->second[i], taxon); //add it as many times as there are identical seqs
707 itNames->second.clear();
708 nameMap.erase(itNames->first);
713 m->mothurRemove(tempTaxonomyFile);
715 if (m->control_pressed) { outputTypes.clear(); for (int i = 0; i < outputNames.size(); i++) { m->mothurRemove(outputNames[i]); } delete classify; return 0; }
719 m->openOutputFile(taxSummary, outTaxTree);
720 taxaSum.print(outTaxTree);
723 //output taxonomy with the unclassified bins added
725 m->openInputFile(newTaxonomyFile, inTax);
728 string unclass = newTaxonomyFile + ".unclass.temp";
729 m->openOutputFile(unclass, outTax);
731 //get maxLevel from phylotree so you know how many 'unclassified's to add
732 int maxLevel = taxaSum.getMaxLevel();
734 //read taxfile - this reading and rewriting is done to preserve the confidence scores.
736 while (!inTax.eof()) {
737 if (m->control_pressed) { outputTypes.clear(); for (int i = 0; i < outputNames.size(); i++) { m->mothurRemove(outputNames[i]); } m->mothurRemove(unclass); delete classify; return 0; }
739 inTax >> name >> taxon; m->gobble(inTax);
741 string newTax = addUnclassifieds(taxon, maxLevel);
743 outTax << name << '\t' << newTax << endl;
748 m->mothurRemove(newTaxonomyFile);
749 rename(unclass.c_str(), newTaxonomyFile.c_str());
751 m->mothurOutEndLine();
752 m->mothurOut("It took " + toString(time(NULL) - start) + " secs to create the summary file for " + toString(numFastaSeqs) + " sequences."); m->mothurOutEndLine(); m->mothurOutEndLine();
758 m->mothurOutEndLine();
759 m->mothurOut("Output File Names: "); m->mothurOutEndLine();
760 for (int i = 0; i < outputNames.size(); i++) { m->mothurOut(outputNames[i]); m->mothurOutEndLine(); }
761 m->mothurOutEndLine();
764 //set taxonomy file as new current taxonomyfile
766 itTypes = outputTypes.find("taxonomy");
767 if (itTypes != outputTypes.end()) {
768 if ((itTypes->second).size() != 0) { current = (itTypes->second)[0]; m->setTaxonomyFile(current); }
772 itTypes = outputTypes.find("accnos");
773 if (itTypes != outputTypes.end()) {
774 if ((itTypes->second).size() != 0) { current = (itTypes->second)[0]; m->setAccnosFile(current); }
781 catch(exception& e) {
782 m->errorOut(e, "ClassifySeqsCommand", "execute");
787 /**************************************************************************************************/
788 string ClassifySeqsCommand::addUnclassifieds(string tax, int maxlevel) {
790 string newTax, taxon;
793 //keep what you have counting the levels
794 while (tax.find_first_of(';') != -1) {
796 taxon = tax.substr(0,tax.find_first_of(';'))+';';
797 tax = tax.substr(tax.find_first_of(';')+1, tax.length());
802 //add "unclassified" until you reach maxLevel
803 while (level < maxlevel) {
804 newTax += "unclassified;";
810 catch(exception& e) {
811 m->errorOut(e, "ClassifySeqsCommand", "addUnclassifieds");
816 /**************************************************************************************************/
818 int ClassifySeqsCommand::createProcesses(string taxFileName, string tempTaxFile, string accnos, string filename) {
824 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
827 //loop through and create all the processes you want
828 while (process != processors) {
832 processIDS.push_back(pid); //create map from line number to pid so you can append files in correct order later
835 num = driver(lines[process], taxFileName + toString(getpid()) + ".temp", tempTaxFile + toString(getpid()) + ".temp", accnos + toString(getpid()) + ".temp", filename);
837 //pass numSeqs to parent
839 string tempFile = filename + toString(getpid()) + ".num.temp";
840 m->openOutputFile(tempFile, out);
846 m->mothurOut("[ERROR]: unable to spawn the necessary processes."); m->mothurOutEndLine();
847 for (int i = 0; i < processIDS.size(); i++) { kill (processIDS[i], SIGINT); }
852 //parent does its part
853 num = driver(lines[0], taxFileName, tempTaxFile, accnos, filename);
855 //force parent to wait until all the processes are done
856 for (int i=0;i<processIDS.size();i++) {
857 int temp = processIDS[i];
861 for (int i = 0; i < processIDS.size(); i++) {
863 string tempFile = filename + toString(processIDS[i]) + ".num.temp";
864 m->openInputFile(tempFile, in);
865 if (!in.eof()) { int tempNum = 0; in >> tempNum; num += tempNum; }
866 in.close(); m->mothurRemove(m->getFullPathName(tempFile));
869 //////////////////////////////////////////////////////////////////////////////////////////////////////
870 //Windows version shared memory, so be careful when passing variables through the alignData struct.
871 //Above fork() will clone, so memory is separate, but that's not the case with windows,
872 //////////////////////////////////////////////////////////////////////////////////////////////////////
874 vector<classifyData*> pDataArray;
875 DWORD dwThreadIdArray[processors-1];
876 HANDLE hThreadArray[processors-1];
878 //Create processor worker threads.
879 for( int i=0; i<processors-1; i++ ){
880 // Allocate memory for thread data.
881 string extension = "";
882 if (i != 0) { extension = toString(i) + ".temp"; processIDS.push_back(i); }
884 classifyData* tempclass = new classifyData((accnos + extension), probs, method, templateFileName, taxonomyFileName, (taxFileName + extension), (tempTaxFile + extension), filename, search, kmerSize, iters, numWanted, m, lines[i]->start, lines[i]->end, match, misMatch, gapOpen, gapExtend, cutoff, i, flipThreshold);
885 pDataArray.push_back(tempclass);
887 //MySeqSumThreadFunction is in header. It must be global or static to work with the threads.
888 //default security attributes, thread function name, argument to thread function, use default creation flags, returns the thread identifier
889 hThreadArray[i] = CreateThread(NULL, 0, MyClassThreadFunction, pDataArray[i], 0, &dwThreadIdArray[i]);
893 //parent does its part
894 num = driver(lines[processors-1], taxFileName + toString(processors-1) + ".temp", tempTaxFile + toString(processors-1) + ".temp", accnos + toString(processors-1) + ".temp", filename);
895 processIDS.push_back((processors-1));
897 //Wait until all threads have terminated.
898 WaitForMultipleObjects(processors-1, hThreadArray, TRUE, INFINITE);
900 //Close all thread handles and free memory allocations.
901 for(int i=0; i < pDataArray.size(); i++){
902 num += pDataArray[i]->count;
903 CloseHandle(hThreadArray[i]);
904 delete pDataArray[i];
909 for(int i=0;i<processIDS.size();i++){
910 appendTaxFiles((taxFileName + toString(processIDS[i]) + ".temp"), taxFileName);
911 appendTaxFiles((tempTaxFile + toString(processIDS[i]) + ".temp"), tempTaxFile);
912 appendTaxFiles((accnos + toString(processIDS[i]) + ".temp"), accnos);
913 m->mothurRemove((m->getFullPathName(taxFileName) + toString(processIDS[i]) + ".temp"));
914 m->mothurRemove((m->getFullPathName(tempTaxFile) + toString(processIDS[i]) + ".temp"));
915 m->mothurRemove((m->getFullPathName(accnos) + toString(processIDS[i]) + ".temp"));
921 catch(exception& e) {
922 m->errorOut(e, "ClassifySeqsCommand", "createProcesses");
926 /**************************************************************************************************/
928 void ClassifySeqsCommand::appendTaxFiles(string temp, string filename) {
933 m->openOutputFileAppend(filename, output);
934 m->openInputFile(temp, input);
936 while(char c = input.get()){
937 if(input.eof()) { break; }
938 else { output << c; }
944 catch(exception& e) {
945 m->errorOut(e, "ClassifySeqsCommand", "appendTaxFiles");
950 //**********************************************************************************************************************
952 int ClassifySeqsCommand::driver(linePair* filePos, string taxFName, string tempTFName, string accnos, string filename){
955 m->openOutputFile(taxFName, outTax);
957 ofstream outTaxSimple;
958 m->openOutputFile(tempTFName, outTaxSimple);
961 m->openOutputFile(accnos, outAcc);
964 m->openInputFile(filename, inFASTA);
968 inFASTA.seekg(filePos->start);
974 if (m->control_pressed) {
977 outTaxSimple.close();
978 outAcc.close(); return 0; }
980 Sequence* candidateSeq = new Sequence(inFASTA); m->gobble(inFASTA);
982 if (candidateSeq->getName() != "") {
984 taxonomy = classify->getTaxonomy(candidateSeq);
986 if (m->control_pressed) { delete candidateSeq; return 0; }
988 if (taxonomy == "unknown;") { m->mothurOut("[WARNING]: " + candidateSeq->getName() + " could not be classified. You can use the remove.lineage command with taxon=unknown; to remove such sequences."); m->mothurOutEndLine(); }
990 //output confidence scores or not
992 outTax << candidateSeq->getName() << '\t' << taxonomy << endl;
994 outTax << candidateSeq->getName() << '\t' << classify->getSimpleTax() << endl;
997 if (classify->getFlipped()) { outAcc << candidateSeq->getName() << endl; }
999 outTaxSimple << candidateSeq->getName() << '\t' << classify->getSimpleTax() << endl;
1003 delete candidateSeq;
1005 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
1006 unsigned long long pos = inFASTA.tellg();
1007 if ((pos == -1) || (pos >= filePos->end)) { break; }
1009 if (inFASTA.eof()) { break; }
1013 if((count) % 100 == 0){ m->mothurOut("Processing sequence: " + toString(count)); m->mothurOutEndLine(); }
1017 if((count) % 100 != 0){ m->mothurOut("Processing sequence: " + toString(count)); m->mothurOutEndLine(); }
1021 outTaxSimple.close();
1026 catch(exception& e) {
1027 m->errorOut(e, "ClassifySeqsCommand", "driver");
1031 //**********************************************************************************************************************
1033 int ClassifySeqsCommand::driverMPI(int start, int num, MPI_File& inMPI, MPI_File& newFile, MPI_File& tempFile, MPI_File& accFile, vector<unsigned long long>& MPIPos){
1035 MPI_Status statusNew;
1036 MPI_Status statusTemp;
1037 MPI_Status statusAcc;
1041 MPI_Comm_rank(MPI_COMM_WORLD, &pid); //find out who we are
1044 string outputString;
1046 for(int i=0;i<num;i++){
1048 if (m->control_pressed) { return 0; }
1050 //read next sequence
1051 int length = MPIPos[start+i+1] - MPIPos[start+i];
1052 char* buf4 = new char[length];
1053 MPI_File_read_at(inMPI, MPIPos[start+i], buf4, length, MPI_CHAR, &status);
1055 string tempBuf = buf4;
1056 if (tempBuf.length() > length) { tempBuf = tempBuf.substr(0, length); }
1057 istringstream iss (tempBuf,istringstream::in);
1060 Sequence* candidateSeq = new Sequence(iss);
1062 if (candidateSeq->getName() != "") {
1063 taxonomy = classify->getTaxonomy(candidateSeq);
1065 if (taxonomy == "unknown;") { m->mothurOut("[WARNING]: " + candidateSeq->getName() + " could not be classified. You can use the remove.lineage command with taxon=unknown; to remove such sequences."); m->mothurOutEndLine(); }
1067 //output confidence scores or not
1069 outputString = candidateSeq->getName() + "\t" + taxonomy + "\n";
1071 outputString = candidateSeq->getName() + "\t" + classify->getSimpleTax() + "\n";
1074 int length = outputString.length();
1075 char* buf2 = new char[length];
1076 memcpy(buf2, outputString.c_str(), length);
1078 MPI_File_write_shared(newFile, buf2, length, MPI_CHAR, &statusNew);
1081 outputString = candidateSeq->getName() + "\t" + classify->getSimpleTax() + "\n";
1082 length = outputString.length();
1083 char* buf = new char[length];
1084 memcpy(buf, outputString.c_str(), length);
1086 MPI_File_write_shared(tempFile, buf, length, MPI_CHAR, &statusTemp);
1089 if (classify->getFlipped()) {
1090 outputString = candidateSeq->getName() + "\n";
1091 length = outputString.length();
1092 char* buf3 = new char[length];
1093 memcpy(buf3, outputString.c_str(), length);
1095 MPI_File_write_shared(accFile, buf3, length, MPI_CHAR, &statusAcc);
1100 delete candidateSeq;
1102 if((i+1) % 100 == 0){ cout << "Classifying sequence " << (i+1) << endl; }
1105 if(num % 100 != 0){ cout << "Classifying sequence " << (num) << endl; }
1110 catch(exception& e) {
1111 m->errorOut(e, "ClassifySeqsCommand", "driverMPI");
1116 //**********************************************************************************************************************
1117 int ClassifySeqsCommand::MPIReadNamesFile(string nameFilename){
1120 nameMap.clear(); //remove old names
1126 //char* inFileName = new char[nameFilename.length()];
1127 //memcpy(inFileName, nameFilename.c_str(), nameFilename.length());
1129 char inFileName[1024];
1130 strcpy(inFileName, nameFilename.c_str());
1132 MPI_File_open(MPI_COMM_WORLD, inFileName, MPI_MODE_RDONLY, MPI_INFO_NULL, &inMPI);
1133 MPI_File_get_size(inMPI, &size);
1134 //delete inFileName;
1136 char* buffer = new char[size];
1137 MPI_File_read(inMPI, buffer, size, MPI_CHAR, &status);
1139 string tempBuf = buffer;
1140 if (tempBuf.length() > size) { tempBuf = tempBuf.substr(0, size); }
1141 istringstream iss (tempBuf,istringstream::in);
1144 string firstCol, secondCol;
1146 iss >> firstCol >> secondCol; m->gobble(iss);
1148 vector<string> temp;
1149 m->splitAtComma(secondCol, temp);
1151 nameMap[firstCol] = temp;
1154 MPI_File_close(&inMPI);
1158 catch(exception& e) {
1159 m->errorOut(e, "ClassifySeqsCommand", "MPIReadNamesFile");
1164 /**************************************************************************************************/