6 * Created by westcott on 1/4/10.
7 * Copyright 2010 Schloss Lab. All rights reserved.
11 #include "pcacommand.h"
13 //**********************************************************************************************************************
15 PCACommand::PCACommand(string option){
19 //allow user to run help
20 if(option == "help") { help(); abort = true; }
23 //valid paramters for this command
24 string Array[] = {"phylip","outputdir", "inputdir"};
25 vector<string> myArray (Array, Array+(sizeof(Array)/sizeof(string)));
27 OptionParser parser(option);
28 map<string, string> parameters = parser. getParameters();
30 ValidParameters validParameter;
31 map<string, string>::iterator it;
33 //check to make sure all parameters are valid for command
34 for (it = parameters.begin(); it != parameters.end(); it++) {
35 if (validParameter.isValidParameter(it->first, myArray, it->second) != true) { abort = true; }
37 //if the user changes the input directory command factory will send this info to us in the output parameter
38 string inputDir = validParameter.validFile(parameters, "inputdir", false);
39 if (inputDir == "not found"){ inputDir = ""; }
42 it = parameters.find("phylip");
43 //user has given a template file
44 if(it != parameters.end()){
45 path = hasPath(it->second);
46 //if the user has not given a path then, add inputdir. else leave path alone.
47 if (path == "") { parameters["phylip"] = inputDir + it->second; }
52 phylipfile = validParameter.validFile(parameters, "phylip", true);
53 if (phylipfile == "not open") { abort = true; }
54 else if (phylipfile == "not found") { phylipfile = ""; abort = true; }
55 else { filename = phylipfile; }
57 //if the user changes the output directory command factory will send this info to us in the output parameter
58 outputDir = validParameter.validFile(parameters, "outputdir", false); if (outputDir == "not found"){
60 outputDir += hasPath(phylipfile); //if user entered a file with a path then preserve it
63 //error checking on files
64 if (phylipfile == "") { mothurOut("You must provide a distance file before running the pca command."); mothurOutEndLine(); abort = true; }
69 errorOut(e, "PCACommand", "PCACommand");
73 //**********************************************************************************************************************
74 void PCACommand::help(){
77 mothurOut("The pca command..."); mothurOutEndLine();
80 errorOut(e, "PCACommand", "help");
84 //**********************************************************************************************************************
85 PCACommand::~PCACommand(){}
86 //**********************************************************************************************************************
87 int PCACommand::execute(){
90 if (abort == true) { return 0; }
92 cout.setf(ios::fixed, ios::floatfield);
93 cout.setf(ios::showpoint);
94 cerr.setf(ios::fixed, ios::floatfield);
95 cerr.setf(ios::showpoint);
98 vector<vector<double> > D;
101 //if(fbase.find_last_of(".")!=string::npos){
102 // fbase.erase(fbase.find_last_of(".")+1);
108 fbase = outputDir + getRootName(getSimpleName(filename));
110 read(filename, names, D);
112 double offset = 0.0000;
115 vector<vector<double> > G = D;
116 vector<vector<double> > copy_G;
117 //int rank = D.size();
119 cout << "\nProcessing...\n";
121 for(int count=0;count<2;count++){
122 recenter(offset, D, G);
125 offset = d[d.size()-1];
126 if(offset > 0.0) break;
130 output(fbase, names, G, d);
134 catch(exception& e) {
135 errorOut(e, "PCACommand", "execute");
139 /*********************************************************************************************************************************/
141 inline double SIGN(const double a, const double b)
143 return b>=0 ? (a>=0 ? a:-a) : (a>=0 ? -a:a);
146 /*********************************************************************************************************************************/
148 void PCACommand::get_comment(istream& f, char begin, char end){
151 while(d != end){ d = f.get(); }
154 catch(exception& e) {
155 errorOut(e, "PCACommand", "get_comment");
160 /*********************************************************************************************************************************/
162 void PCACommand::read_phylip(istream& f, int square_m, vector<string>& name_list, vector<vector<double> >& d){
170 name_list.resize(rank);
173 for(int i=0;i<rank;i++)
175 for(int i=0;i<rank;i++) {
177 // cout << i << "\t" << name_list[i] << endl;
178 for(int j=0;j<rank;j++) {
180 if (d[i][j] == -0.0000)
185 else if(square_m == 2){
186 for(int i=0;i<rank;i++){
191 for(int i=1;i<rank;i++){
194 for(int j=0;j<i;j++){
196 if (d[i][j] == -0.0000)
203 catch(exception& e) {
204 errorOut(e, "PCACommand", "read_phylip");
210 /*********************************************************************************************************************************/
212 void PCACommand::read(string fname, vector<string>& names, vector<vector<double> >& D){
215 openInputFile(fname, f);
217 //check whether matrix is square
223 f >> numSeqs >> name;
225 while((d=f.get()) != EOF){
227 //is d a number meaning its square
233 //is d a line return meaning its lower triangle
241 //reopen to get back to beginning
242 openInputFile(fname, f);
243 read_phylip(f, m, names, D);
245 catch(exception& e) {
246 errorOut(e, "PCACommand", "read");
251 /*********************************************************************************************************************************/
253 double PCACommand::pythag(double a, double b) { return(pow(a*a+b*b,0.5)); }
255 /*********************************************************************************************************************************/
257 void PCACommand::matrix_mult(vector<vector<double> > first, vector<vector<double> > second, vector<vector<double> >& product){
259 int first_rows = first.size();
260 int first_cols = first[0].size();
261 int second_cols = second[0].size();
263 product.resize(first_rows);
264 for(int i=0;i<first_rows;i++){
265 product[i].resize(second_cols);
268 for(int i=0;i<first_rows;i++){
269 for(int j=0;j<second_cols;j++){
271 for(int k=0;k<first_cols;k++){
272 product[i][j] += first[i][k] * second[k][j];
277 catch(exception& e) {
278 errorOut(e, "PCACommand", "matrix_mult");
284 /*********************************************************************************************************************************/
286 void PCACommand::recenter(double offset, vector<vector<double> > D, vector<vector<double> >& G){
290 vector<vector<double> > A(rank);
291 vector<vector<double> > C(rank);
292 for(int i=0;i<rank;i++){
297 double scale = -1.0000 / (double) rank;
299 for(int i=0;i<rank;i++){
301 C[i][i] = 1.0000 + scale;
302 for(int j=i+1;j<rank;j++){
303 A[i][j] = A[j][i] = -0.5 * D[i][j] * D[i][j] + offset;
304 C[i][j] = C[j][i] = scale;
311 catch(exception& e) {
312 errorOut(e, "PCACommand", "recenter");
318 /*********************************************************************************************************************************/
320 // This function is taken from Numerical Recipes in C++ by Press et al., 2nd edition, pg. 479
322 void PCACommand::tred2(vector<vector<double> >& a, vector<double>& d, vector<double>& e){
324 double scale, hh, h, g, f;
331 for(int i=n-1;i>0;i--){
335 for(int k=0;k<l+1;k++){
336 scale += fabs(a[i][k]);
342 for(int k=0;k<l+1;k++){
344 h += a[i][k] * a[i][k];
347 g = (f >= 0.0 ? -sqrt(h) : sqrt(h));
352 for(int j=0;j<l+1;j++){
353 a[j][i] = a[i][j] / h;
355 for(int k=0;k<j+1;k++){
356 g += a[j][k] * a[i][k];
358 for(int k=j+1;k<l+1;k++){
359 g += a[k][j] * a[i][k];
365 for(int j=0;j<l+1;j++){
367 e[j] = g = e[j] - hh * f;
368 for(int k=0;k<j+1;k++){
369 a[j][k] -= (f * e[k] + g * a[i][k]);
384 for(int i=0;i<n;i++){
387 for(int j=0;j<l;j++){
389 for(int k=0;k<l;k++){
390 g += a[i][k] * a[k][j];
392 for(int k=0;k<l;k++){
393 a[k][j] -= g * a[k][i];
399 for(int j=0;j<l;j++){
400 a[j][i] = a[i][j] = 0.0;
404 catch(exception& e) {
405 errorOut(e, "PCACommand", "tred2");
411 /*********************************************************************************************************************************/
413 // This function is taken from Numerical Recipes in C++ by Press et al., 2nd edition, pg. 479
415 void PCACommand::qtli(vector<double>& d, vector<double>& e, vector<vector<double> >& z) {
418 double s, r, p, g, f, dd, c, b;
421 for(int i=1;i<=n;i++){
426 for(int l=0;l<n;l++){
430 dd = fabs(d[m]) + fabs(d[m+1]);
431 if(fabs(e[m])+dd == dd) break;
434 if(iter++ == 30) cerr << "Too many iterations in tqli\n";
435 g = (d[l+1]-d[l]) / (2.0 * e[l]);
437 g = d[m] - d[l] + e[l] / (g + SIGN(r,g));
443 e[i+1] = (r=pythag(f,g));
452 r = (d[i] - g) * s + 2.0 * c * b;
453 d[i+1] = g + ( p = s * r);
455 for(int k=0;k<n;k++){
457 z[k][i+1] = s * z[k][i] + c * f;
458 z[k][i] = c * z[k][i] - s * f;
461 if(r == 0.00 && i >= l) continue;
470 for(int i=0;i<n;i++){
472 for(int j=i;j<n;j++){
480 for(int j=0;j<n;j++){
488 catch(exception& e) {
489 errorOut(e, "PCACommand", "qtli");
494 /*********************************************************************************************************************************/
496 void PCACommand::output(string fnameRoot, vector<string> name_list, vector<vector<double> > G, vector<double> d) {
498 int rank = name_list.size();
499 double dsum = 0.0000;
500 for(int i=0;i<rank;i++){
502 for(int j=0;j<rank;j++){
503 if(d[j] >= 0) { G[i][j] *= pow(d[j],0.5); }
504 else { G[i][j] = 0.00000; }
508 ofstream pcaData((fnameRoot+"pca").c_str(), ios::trunc);
509 pcaData.setf(ios::fixed, ios::floatfield);
510 pcaData.setf(ios::showpoint);
512 ofstream pcaLoadings((fnameRoot+"pca.loadings").c_str(), ios::trunc);
513 pcaLoadings.setf(ios::fixed, ios::floatfield);
514 pcaLoadings.setf(ios::showpoint);
516 pcaLoadings << "axis\tloading\n";
517 for(int i=0;i<rank;i++){
518 pcaLoadings << i+1 << '\t' << d[i] * 100.0 / dsum << endl;
522 for(int i=0;i<rank;i++){
523 pcaData << '\t' << "axis" << i+1;
527 for(int i=0;i<rank;i++){
528 pcaData << name_list[i] << '\t';
529 for(int j=0;j<rank;j++){
530 pcaData << G[i][j] << '\t';
535 catch(exception& e) {
536 errorOut(e, "PCACommand", "output");
541 /*********************************************************************************************************************************/