X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=blastdb.cpp;h=48ae1686a35aae2f1a19e980c8b057c827c40021;hb=4de093e3b92bdab1579565cb2873553412f6671e;hp=dff1074e92a3d405419712c72c3528333a004814;hpb=e72551c9cc5542e6a354f0f3e415fea261421d72;p=mothur.git diff --git a/blastdb.cpp b/blastdb.cpp index dff1074..48ae168 100644 --- a/blastdb.cpp +++ b/blastdb.cpp @@ -14,25 +14,53 @@ /**************************************************************************************************/ -BlastDB::BlastDB(float gO, float gE, float m, float mM) : Database(), +BlastDB::BlastDB(string tag, float gO, float gE, float m, float mM) : Database(), gapOpen(gO), gapExtend(gE), match(m), misMatch(mM) { - globaldata = GlobalData::getInstance(); count = 0; int randNumber = rand(); - dbFileName = toString(randNumber) + ".template.unaligned.fasta"; - queryFileName = toString(randNumber) + ".candidate.unaligned.fasta"; - blastFileName = toString(randNumber) + ".blast"; + //int randNumber = 12345; + dbFileName = tag + toString(randNumber) + ".template.unaligned.fasta"; + queryFileName = tag + toString(randNumber) + ".candidate.unaligned.fasta"; + blastFileName = tag + toString(randNumber) + ".blast"; } +/**************************************************************************************************/ + +BlastDB::BlastDB() : Database() { + try { + count = 0; + + int randNumber = rand(); + //int randNumber = 12345; + dbFileName = toString(randNumber) + ".template.unaligned.fasta"; + queryFileName = toString(randNumber) + ".candidate.unaligned.fasta"; + blastFileName = toString(randNumber) + ".blast"; + } + catch(exception& e) { + m->errorOut(e, "BlastDB", "BlastDB"); + exit(1); + } +} /**************************************************************************************************/ BlastDB::~BlastDB(){ - remove(queryFileName.c_str()); // let's clean stuff up and remove the temp files - remove(dbFileName.c_str()); // let's clean stuff up and remove the temp files - remove(blastFileName.c_str()); // let's clean stuff up and remove the temp files + try{ + remove(queryFileName.c_str()); // let's clean stuff up and remove the temp files + remove(dbFileName.c_str()); // let's clean stuff up and remove the temp files + remove((dbFileName+".nsq").c_str()); // let's clean stuff up and remove the temp files + remove((dbFileName+".nsi").c_str()); // let's clean stuff up and remove the temp files + remove((dbFileName+".nsd").c_str()); // let's clean stuff up and remove the temp files + remove((dbFileName+".nin").c_str()); // let's clean stuff up and remove the temp files + remove((dbFileName+".nhr").c_str()); // let's clean stuff up and remove the temp files + remove(blastFileName.c_str()); // let's clean stuff up and remove the temp files + } + catch(exception& e) { + m->errorOut(e, "BlastDB", "~BlastDB"); + exit(1); + } } /**************************************************************************************************/ //assumes you have added all the template sequences using the addSequence function and run generateDB. @@ -41,25 +69,37 @@ vector BlastDB::findClosestSequences(Sequence* seq, int n) { vector topMatches; ofstream queryFile; - openOutputFile(queryFileName, queryFile); + int randNumber = rand(); + m->openOutputFile((queryFileName+toString(randNumber)), queryFile); queryFile << '>' << seq->getName() << endl; queryFile << seq->getUnaligned() << endl; queryFile.close(); + // the goal here is to quickly survey the database to find the closest match. To do this we are using the default // wordsize used in megablast. I'm sure we're sacrificing accuracy for speed, but anyother way would take way too // long. With this setting, it seems comparable in speed to the suffix tree approach. - string blastCommand = path + "blast/bin/blastall -p blastn -d " + dbFileName + " -m 8 -W 28 -v " + toString(n) + " -b " + toString(n);; - blastCommand += (" -i " + queryFileName + " -o " + blastFileName); + string blastCommand; + #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux) + + blastCommand = path + "blast/bin/blastall -p blastn -d " + dbFileName + " -m 8 -W 28 -v " + toString(n) + " -b " + toString(n); + blastCommand += (" -i " + (queryFileName+toString(randNumber)) + " -o " + blastFileName+toString(randNumber)); + #else + blastCommand = "\"" + path + "blast\\bin\\blastall\" -p blastn -d " + "\"" + dbFileName + "\"" + " -m 8 -W 28 -v " + toString(n) + " -b " + toString(n); + blastCommand += (" -i " + (queryFileName+toString(randNumber)) + " -o " + blastFileName+toString(randNumber)); + //wrap entire string in "" + blastCommand = "\"" + blastCommand + "\""; + #endif + system(blastCommand.c_str()); ifstream m8FileHandle; - openInputFile(blastFileName, m8FileHandle); + m->openInputFile(blastFileName+toString(randNumber), m8FileHandle, "no error"); string dummy; int templateAccession; - gobble(m8FileHandle); + m->gobble(m8FileHandle); while(!m8FileHandle.eof()){ m8FileHandle >> dummy >> templateAccession >> searchScore; @@ -67,78 +107,87 @@ vector BlastDB::findClosestSequences(Sequence* seq, int n) { //get rest of junk in line while (!m8FileHandle.eof()) { char c = m8FileHandle.get(); if (c == 10 || c == 13){ break; } } - gobble(m8FileHandle); + m->gobble(m8FileHandle); topMatches.push_back(templateAccession); } m8FileHandle.close(); - - string root = dbFileName; - string temp = dbFileName + ".nsq"; - remove(temp.c_str()); - temp = dbFileName + ".nsi"; - remove(temp.c_str()); - - temp = dbFileName + ".nsd"; - remove(temp.c_str()); - - temp = dbFileName + ".nin"; - remove(temp.c_str()); + remove((queryFileName+toString(randNumber)).c_str()); + remove((blastFileName+toString(randNumber)).c_str()); - temp = dbFileName + ".nhr"; - remove(temp.c_str()); - - - return topMatches; } catch(exception& e) { - errorOut(e, "BlastDB", "findClosestSequences"); + m->errorOut(e, "BlastDB", "findClosestSequences"); exit(1); } } /**************************************************************************************************/ //assumes you have added all the template sequences using the addSequence function and run generateDB. -vector BlastDB::findClosestMegaBlast(Sequence* seq, int n) { +vector BlastDB::findClosestMegaBlast(Sequence* seq, int n, int minPerID) { try{ vector topMatches; + float numBases, mismatch, gap, startQuery, endQuery, startRef, endRef, score; + Scores.clear(); ofstream queryFile; - openOutputFile(queryFileName, queryFile); + int randNumber = rand(); + //int randNumber = 12345; + m->openOutputFile((queryFileName+toString(randNumber)), queryFile); queryFile << '>' << seq->getName() << endl; queryFile << seq->getUnaligned() << endl; queryFile.close(); - +// cout << seq->getUnaligned() << endl; // the goal here is to quickly survey the database to find the closest match. To do this we are using the default // wordsize used in megablast. I'm sure we're sacrificing accuracy for speed, but anyother way would take way too // long. With this setting, it seems comparable in speed to the suffix tree approach. - - string blastCommand = path + "blast/bin/megablast -e 1e-10 -d " + dbFileName + " -m 8 -b " + toString(n) + " -v " + toString(n); //-W 28 -p blastn - blastCommand += (" -i " + queryFileName + " -o " + blastFileName); +//7000004128189528left 0 100 66 0 0 1 66 61 126 1e-31 131 + string blastCommand; + #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux) + blastCommand = path + "blast/bin/megablast -e 1e-10 -d " + dbFileName + " -m 8 -b " + toString(n) + " -v " + toString(n); //-W 28 -p blastn + blastCommand += (" -i " + (queryFileName+toString(randNumber)) + " -o " + blastFileName+toString(randNumber)); + #else + //blastCommand = path + "blast\\bin\\megablast -e 1e-10 -d " + dbFileName + " -m 8 -b " + toString(n) + " -v " + toString(n); //-W 28 -p blastn + //blastCommand += (" -i " + (queryFileName+toString(randNumber)) + " -o " + blastFileName+toString(randNumber)); + + blastCommand = "\"" + path + "blast\\bin\\megablast\" -e 1e-10 -d " + "\"" + dbFileName + "\"" + " -m 8 -b " + toString(n) + " -v " + toString(n); //-W 28 -p blastn + blastCommand += (" -i " + (queryFileName+toString(randNumber)) + " -o " + blastFileName+toString(randNumber)); + //wrap entire string in "" + blastCommand = "\"" + blastCommand + "\""; + + #endif + //cout << blastCommand << endl; system(blastCommand.c_str()); - + ifstream m8FileHandle; - openInputFile(blastFileName, m8FileHandle); + m->openInputFile(blastFileName+toString(randNumber), m8FileHandle, "no error"); - string dummy; + string dummy, eScore; int templateAccession; - gobble(m8FileHandle); + m->gobble(m8FileHandle); while(!m8FileHandle.eof()){ - m8FileHandle >> dummy >> templateAccession >> searchScore; + m8FileHandle >> dummy >> templateAccession >> searchScore >> numBases >> mismatch >> gap >> startQuery >> endQuery >> startRef >> endRef >> eScore >> score; +// cout << dummy << '\t' << templateAccession << '\t' << searchScore << '\t' << numBases << '\t' << mismatch << '\t' << gap << '\t' << startQuery << '\t' << endQuery << '\t' << startRef << '\t' << endRef << '\t' << eScore << '\t' << score << endl; //get rest of junk in line - while (!m8FileHandle.eof()) { char c = m8FileHandle.get(); if (c == 10 || c == 13){ break; } } - - gobble(m8FileHandle); - topMatches.push_back(templateAccession); + //while (!m8FileHandle.eof()) { char c = m8FileHandle.get(); if (c == 10 || c == 13){ break; }else{ cout << c; } } // + //cout << endl; + m->gobble(m8FileHandle); + if (searchScore >= minPerID) { + topMatches.push_back(templateAccession); + Scores.push_back(searchScore); + } +//cout << templateAccession << endl; } m8FileHandle.close(); - + remove((queryFileName+toString(randNumber)).c_str()); + remove((blastFileName+toString(randNumber)).c_str()); +//cout << "\n" ; return topMatches; } catch(exception& e) { - errorOut(e, "BlastDB", "findClosest"); + m->errorOut(e, "BlastDB", "findClosestMegaBlast"); exit(1); } } @@ -147,17 +196,17 @@ void BlastDB::addSequence(Sequence seq) { try { ofstream unalignedFastaFile; - openOutputFileAppend(dbFileName, unalignedFastaFile); + m->openOutputFileAppend(dbFileName, unalignedFastaFile); // generating a fasta file with unaligned template unalignedFastaFile << '>' << count << endl; // sequences, which will be input to formatdb unalignedFastaFile << seq.getUnaligned() << endl; unalignedFastaFile.close(); - + count++; } catch(exception& e) { - errorOut(e, "BlastDB", "addSequence"); + m->errorOut(e, "BlastDB", "addSequence"); exit(1); } } @@ -165,21 +214,35 @@ void BlastDB::addSequence(Sequence seq) { void BlastDB::generateDB() { try { - //mothurOut("Generating the temporary BLAST database...\t"); cout.flush(); + //m->mothurOut("Generating the temporary BLAST database...\t"); cout.flush(); - path = globaldata->argv; - path = path.substr(0, (path.find_last_of('m'))); + path = m->argv; + string tempPath = path; + for (int i = 0; i < path.length(); i++) { tempPath[i] = tolower(path[i]); } + path = path.substr(0, (tempPath.find_last_of('m'))); - string formatdbCommand = path + "blast/bin/formatdb -p F -o T -i " + dbFileName; // format the database, -o option gives us the ability + string formatdbCommand; + + #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux) + formatdbCommand = path + "blast/bin/formatdb -p F -o T -i " + dbFileName; // format the database, -o option gives us the ability + #else + //formatdbCommand = path + "blast\\bin\\formatdb -p F -o T -i " + dbFileName; // format the database, -o option gives us the ability + + formatdbCommand = "\"" + path + "blast\\bin\\formatdb\" -p F -o T -i " + "\"" + dbFileName + "\""; + //wrap entire string in "" + formatdbCommand = "\"" + formatdbCommand + "\""; + #endif + //cout << formatdbCommand << endl; system(formatdbCommand.c_str()); // to get the right sequence names, i think. -p F // option tells formatdb that seqs are DNA, not prot - //mothurOut("DONE."); mothurOutEndLine(); mothurOutEndLine(); cout.flush(); + //m->mothurOut("DONE."); m->mothurOutEndLine(); m->mothurOutEndLine(); cout.flush(); } catch(exception& e) { - errorOut(e, "BlastDB", "generateDB"); + m->errorOut(e, "BlastDB", "generateDB"); exit(1); } } +/**************************************************************************************************/ /**************************************************************************************************/