X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=pairwiseseqscommand.h;h=a3a91f7bcd1f4ad2bbd52024d36153399ebc1414;hb=2bb9267aa4b4ecdf8488b06605cc9f3f36fa4332;hp=cbd5aa402e7c61d624671590313bb32cb974dc11;hpb=8f7f4fc08b8c70d9ef0f79607813dba4e926e102;p=mothur.git

diff --git a/pairwiseseqscommand.h b/pairwiseseqscommand.h
index cbd5aa4..a3a91f7 100644
--- a/pairwiseseqscommand.h
+++ b/pairwiseseqscommand.h
@@ -30,7 +30,8 @@ public:
 	string getCommandCategory()		{ return "Sequence Processing"; }
 	string getHelpString();	
 	string getCitation() { return "Needleman SB, Wunsch CD (1970). A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol 48: 443-53. [ for needleman ]\nGotoh O (1982). An improved algorithm for matching biological sequences. J Mol Biol 162: 705-8. [ for gotoh ] \nhttp://www.mothur.org/wiki/Pairwise.seqs"; }
-	
+	string getDescription()		{ return "calculates pairwise distances from an unaligned fasta file"; }
+
 	int execute(); 
 	void help() { m->mothurOut(getHelpString()); }	
 	
@@ -53,8 +54,8 @@ private:
 	
 	#ifdef USE_MPI 
 	int driverMPI(int, int, MPI_File&, float);
-	int driverMPI(int, int, string, unsigned long int&);
-	int driverMPI(int, int, string, unsigned long int&, string);
+	int driverMPI(int, int, string, unsigned long long&);
+	int driverMPI(int, int, string, unsigned long long&, string);
 	#endif
 	
 	string fastaFileName, align, calc, outputDir, output;