X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=blastdb.cpp;h=438d90c30961dfbabe5436483f3d33a23fc537ae;hb=eccface807733d7b770c95716d05067d276ead26;hp=6d7ab18b870567cff8a39dc3b848a3de9b3c9c4f;hpb=ed4fc0b4ae476621747d9bfdce733e878e040e2f;p=mothur.git

diff --git a/blastdb.cpp b/blastdb.cpp
index 6d7ab18..438d90c 100644
--- a/blastdb.cpp
+++ b/blastdb.cpp
@@ -128,6 +128,7 @@ vector<int> BlastDB::findClosestMegaBlast(Sequence* seq, int n, int minPerID) {
 		//	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.
 //7000004128189528left	0	100		66	0	0	1	66	61	126	1e-31	 131	
+		
 		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+seq->getName()) + " -o " + blastFileName+seq->getName());
 		system(blastCommand.c_str());