]> git.donarmstrong.com Git - mothur.git/blob - treegroupscommand.cpp
0f106c493d1d55f7e742ed1195e1557f435d6e49
[mothur.git] / treegroupscommand.cpp
1 /*
2  *  treegroupscommand.cpp
3  *  Mothur
4  *
5  *  Created by Sarah Westcott on 4/8/09.
6  *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
7  *
8  */
9
10 #include "treegroupscommand.h"
11 #include "sharedjabund.h"
12 #include "sharedsorabund.h"
13 #include "sharedjclass.h"
14 #include "sharedsorclass.h"
15 #include "sharedjest.h"
16 #include "sharedsorest.h"
17 #include "sharedthetayc.h"
18 #include "sharedthetan.h"
19 #include "sharedmorisitahorn.h"
20 #include "sharedbraycurtis.h"
21
22
23 //**********************************************************************************************************************
24
25 TreeGroupCommand::TreeGroupCommand(string option){
26         try {
27                 globaldata = GlobalData::getInstance();
28                 abort = false;
29                 allLines = 1;
30                 lines.clear();
31                 labels.clear();
32                 Groups.clear();
33                 Estimators.clear();
34                 
35                 //allow user to run help
36                 if(option == "help") { validCalculator = new ValidCalculators(); help(); abort = true; }
37                 
38                 else {
39                         //valid paramters for this command
40                         string Array[] =  {"line","label","calc","groups", "phylip", "column", "name", "precision","cutoff"};
41                         vector<string> myArray (Array, Array+(sizeof(Array)/sizeof(string)));
42                         
43                         OptionParser parser(option);
44                         map<string, string> parameters = parser. getParameters();
45                         
46                         ValidParameters validParameter;
47                 
48                         //check to make sure all parameters are valid for command
49                         for (map<string, string>::iterator it = parameters.begin(); it != parameters.end(); it++) { 
50                                 if (validParameter.isValidParameter(it->first, myArray, it->second) != true) {  abort = true;  }
51                         }
52                         
53                         //required parameters
54                         phylipfile = validParameter.validFile(parameters, "phylip", true);
55                         if (phylipfile == "not open") { abort = true; }
56                         else if (phylipfile == "not found") { phylipfile = ""; }        
57                         else {  format = "phylip";      }
58                         
59                         columnfile = validParameter.validFile(parameters, "column", true);
60                         if (columnfile == "not open") { abort = true; } 
61                         else if (columnfile == "not found") { columnfile = ""; }
62                         else {  format = "column";      }
63                         
64                         namefile = validParameter.validFile(parameters, "name", true);
65                         if (namefile == "not open") { abort = true; }   
66                         else if (namefile == "not found") { namefile = ""; }
67                         else {  globaldata->setNameFile(namefile);      }
68                         
69                         format = globaldata->getFormat();
70                         
71                         //error checking on files                       
72                         if ((globaldata->getSharedFile() == "") && ((phylipfile == "") && (columnfile == "")))  { cout << "You must run the read.otu command or provide a distance file before running the tree.shared command." << endl; abort = true; }
73                         else if ((phylipfile != "") && (columnfile != "")) { cout << "When running the tree.shared command with a distance file you may not use both the column and the phylip parameters." << endl; abort = true; }
74                         
75                         if (columnfile != "") {
76                                 if (namefile == "") {  cout << "You need to provide a namefile if you are going to use the column format." << endl; abort = true; }
77                         }
78
79                         //check for optional parameter and set defaults
80                         // ...at some point should added some additional type checking...
81                         line = validParameter.validFile(parameters, "line", false);                             
82                         if (line == "not found") { line = "";  }
83                         else { 
84                                 if(line != "all") {  splitAtDash(line, lines);  allLines = 0;  }
85                                 else { allLines = 1;  }
86                         }
87                         
88                         label = validParameter.validFile(parameters, "label", false);                   
89                         if (label == "not found") { label = ""; }
90                         else { 
91                                 if(label != "all") {  splitAtDash(label, labels);  allLines = 0;  }
92                                 else { allLines = 1;  }
93                         }
94                         
95                         //make sure user did not use both the line and label parameters
96                         if ((line != "") && (label != "")) { cout << "You cannot use both the line and label parameters at the same time. " << endl; abort = true; }
97                         //if the user has not specified any line or labels use the ones from read.otu
98                         else if((line == "") && (label == "")) {  
99                                 allLines = globaldata->allLines; 
100                                 labels = globaldata->labels; 
101                                 lines = globaldata->lines;
102                         }
103                                 
104                         groups = validParameter.validFile(parameters, "groups", false);                 
105                         if (groups == "not found") { groups = ""; }
106                         else { 
107                                 splitAtDash(groups, Groups);
108                                 globaldata->Groups = Groups;
109                         }
110                                 
111                         calc = validParameter.validFile(parameters, "calc", false);                     
112                         if (calc == "not found") { calc = "jclass-thetayc";  }
113                         else { 
114                                  if (calc == "default")  {  calc = "jclass-thetayc";  }
115                         }
116                         splitAtDash(calc, Estimators);
117
118                         string temp;
119                         temp = validParameter.validFile(parameters, "precision", false);                        if (temp == "not found") { temp = "100"; }
120                         convert(temp, precision); 
121                         
122                         temp = validParameter.validFile(parameters, "cutoff", false);                   if (temp == "not found") { temp = "10"; }
123                         convert(temp, cutoff); 
124                         cutoff += (5 / (precision * 10.0));
125
126                                 
127                         if (abort == false) {
128                         
129                                 validCalculator = new ValidCalculators();
130                                 
131                                 if (format == "sharedfile") {
132                                         int i;
133                                         for (i=0; i<Estimators.size(); i++) {
134                                                 if (validCalculator->isValidCalculator("treegroup", Estimators[i]) == true) { 
135                                                         if (Estimators[i] == "jabund") {        
136                                                                 treeCalculators.push_back(new JAbund());
137                                                         }else if (Estimators[i] == "sorabund") { 
138                                                                 treeCalculators.push_back(new SorAbund());
139                                                         }else if (Estimators[i] == "jclass") { 
140                                                                 treeCalculators.push_back(new Jclass());
141                                                         }else if (Estimators[i] == "sorclass") { 
142                                                                 treeCalculators.push_back(new SorClass());
143                                                         }else if (Estimators[i] == "jest") { 
144                                                                 treeCalculators.push_back(new Jest());
145                                                         }else if (Estimators[i] == "sorest") { 
146                                                                 treeCalculators.push_back(new SorEst());
147                                                         }else if (Estimators[i] == "thetayc") { 
148                                                                 treeCalculators.push_back(new ThetaYC());
149                                                         }else if (Estimators[i] == "thetan") { 
150                                                                 treeCalculators.push_back(new ThetaN());
151                                                         }else if (Estimators[i] == "morisitahorn") { 
152                                                                 treeCalculators.push_back(new MorHorn());
153                                                         }else if (Estimators[i] == "braycurtis") { 
154                                                                 treeCalculators.push_back(new BrayCurtis());
155                                                         }
156                                                 }
157                                         }
158                                 }
159                         }       
160                 }
161
162         }
163         catch(exception& e) {
164                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function TreeGroupCommand. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
165                 exit(1);
166         }
167         catch(...) {
168                 cout << "An unknown error has occurred in the TreeGroupCommand class function TreeGroupCommand. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
169                 exit(1);
170         }       
171 }
172
173 //**********************************************************************************************************************
174
175 void TreeGroupCommand::help(){
176         try {
177                 cout << "The tree.shared command creates a .tre to represent the similiarity between groups or sequences." << "\n";
178                 cout << "The tree.shared command can only be executed after a successful read.otu command or by providing a distance file." << "\n";
179                 cout << "The tree.shared command parameters are groups, calc, phylip, column, name, cutoff, precision, line and label.  You may not use line and label at the same time." << "\n";
180                 cout << "The groups parameter allows you to specify which of the groups in your groupfile you would like included used." << "\n";
181                 cout << "The group names are separated by dashes. The line and label allow you to select what distance levels you would like trees created for, and are also separated by dashes." << "\n";
182                 cout << "The phylip or column parameter are required if you do not run the read.otu command first, and only one may be used.  If you use a column file the name filename is required. " << "\n";
183                 cout << "If you do not provide a cutoff value 10.00 is assumed. If you do not provide a precision value then 100 is assumed." << "\n";
184                 cout << "The tree.shared command should be in the following format: tree.shared(groups=yourGroups, calc=yourCalcs, line=yourLines, label=yourLabels)." << "\n";
185                 cout << "Example tree.shared(groups=A-B-C, line=1-3-5, calc=jabund-sorabund)." << "\n";
186                 cout << "The default value for groups is all the groups in your groupfile." << "\n";
187                 cout << "The default value for calc is jclass-thetayc." << "\n";
188                 cout << "The tree.shared command outputs a .tre file for each calculator you specify at each distance you choose." << "\n";
189                 validCalculator->printCalc("treegroup", cout);
190                 cout << "Or the tree.shared command can be in the following format: tree.shared(phylip=yourPhylipFile)." << "\n";
191                 cout << "Example tree.shared(phylip=abrecovery.dist)." << "\n";
192                 cout << "Note: No spaces between parameter labels (i.e. groups), '=' and parameters (i.e.yourGroups)." << "\n" << "\n";
193         }
194         catch(exception& e) {
195                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function help. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
196                 exit(1);
197         }
198         catch(...) {
199                 cout << "An unknown error has occurred in the TreeGroupCommand class function help. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
200                 exit(1);
201         }       
202 }
203
204
205 //**********************************************************************************************************************
206
207 TreeGroupCommand::~TreeGroupCommand(){
208         delete input;
209         if (format == "sharedfile") {delete read;}
210         else { delete readMatrix;  delete matrix; delete list; }
211         delete tmap;
212         delete validCalculator;
213         
214 }
215
216 //**********************************************************************************************************************
217
218 int TreeGroupCommand::execute(){
219         try {
220         
221                 if (abort == true) { return 0; }
222                 
223                 if (format == "sharedfile") {
224                         //if the users entered no valid calculators don't execute command
225                         if (treeCalculators.size() == 0) { cout << "You have given no valid calculators." << endl; return 0; }
226
227                         //you have groups
228                         read = new ReadOTUFile(globaldata->inputFileName);      
229                         read->read(&*globaldata); 
230                         
231                         input = globaldata->ginput;
232                         lookup = input->getSharedRAbundVectors();
233                         lastLookup = lookup;
234                         
235                         if (lookup.size() < 2) { cout << "You have not provided enough valid groups.  I cannot run the command." << endl; return 0; }
236                 
237                         globaldata->runParse = false;
238                         
239                         //create tree file
240                         makeSimsShared();
241                 }else{
242                         //read in dist file
243                         filename = globaldata->inputFileName;
244                 
245                         if (format == "column") { readMatrix = new ReadColumnMatrix(filename); }        
246                         else if (format == "phylip") { readMatrix = new ReadPhylipMatrix(filename); }
247                                 
248                         readMatrix->setCutoff(cutoff);
249         
250                         if(namefile != ""){     
251                                 nameMap = new NameAssignment(namefile);
252                                 nameMap->readMap(1,2);
253                         }
254                         else{
255                                 nameMap = NULL;
256                         }
257         
258                         readMatrix->read(nameMap);
259                         list = readMatrix->getListVector();
260                         matrix = readMatrix->getMatrix();
261
262                         //make treemap
263                         tmap = new TreeMap();
264                         tmap->makeSim(list);
265                         globaldata->gTreemap = tmap;
266                         
267                         globaldata->Groups = tmap->namesOfGroups;
268                 
269                         //clear globaldatas old tree names if any
270                         globaldata->Treenames.clear();
271                 
272                         //fills globaldatas tree names
273                         globaldata->Treenames = globaldata->Groups;
274                         
275                         globaldata->runParse = false;
276                         
277                         makeSimsDist();
278
279                         //create a new filename
280                         outputFile = getRootName(globaldata->inputFileName) + "tre";    
281                                 
282                         createTree();
283                         cout << "Tree complete. " << endl;
284                 }
285                                 
286                 //reset groups parameter
287                 globaldata->Groups.clear();  
288
289                 return 0;
290         }
291         catch(exception& e) {
292                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function execute. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
293                 exit(1);
294         }
295         catch(...) {
296                 cout << "An unknown error has occurred in the TreeGroupCommand class function execute. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
297                 exit(1);
298         }               
299 }
300 //**********************************************************************************************************************
301
302 void TreeGroupCommand::createTree(){
303         try {
304                 //create tree
305                 t = new Tree();
306                 
307                 //do merges and create tree structure by setting parents and children
308                 //there are numGroups - 1 merges to do
309                 for (int i = 0; i < (numGroups - 1); i++) {
310                         float largest = -1000.0;
311
312                         int row, column;
313                         //find largest value in sims matrix by searching lower triangle
314                         for (int j = 1; j < simMatrix.size(); j++) {
315                                 for (int k = 0; k < j; k++) {
316                                         if (simMatrix[j][k] > largest) {  largest = simMatrix[j][k]; row = j; column = k;  }
317                                 }
318                         }
319
320                         //set non-leaf node info and update leaves to know their parents
321                         //non-leaf
322                         t->tree[numGroups + i].setChildren(index[row], index[column]);
323                         
324                         //parents
325                         t->tree[index[row]].setParent(numGroups + i);
326                         t->tree[index[column]].setParent(numGroups + i);
327                         
328                         //blength = distance / 2;
329                         float blength = ((1.0 - largest) / 2);
330                         
331                         //branchlengths
332                         t->tree[index[row]].setBranchLength(blength - t->tree[index[row]].getLengthToLeaves());
333                         t->tree[index[column]].setBranchLength(blength - t->tree[index[column]].getLengthToLeaves());
334                         
335                         //set your length to leaves to your childs length plus branchlength
336                         t->tree[numGroups + i].setLengthToLeaves(t->tree[index[row]].getLengthToLeaves() + t->tree[index[row]].getBranchLength());
337                         
338                         
339                         //update index 
340                         index[row] = numGroups+i;
341                         index[column] = numGroups+i;
342                         
343                         //remove highest value that caused the merge.
344                         simMatrix[row][column] = -1000.0;
345                         simMatrix[column][row] = -1000.0;
346                         
347                         //merge values in simsMatrix
348                         for (int n = 0; n < simMatrix.size(); n++)      {
349                                 //row becomes merge of 2 groups
350                                 simMatrix[row][n] = (simMatrix[row][n] + simMatrix[column][n]) / 2;
351                                 simMatrix[n][row] = simMatrix[row][n];
352                                 //delete column
353                                 simMatrix[column][n] = -1000.0;
354                                 simMatrix[n][column] = -1000.0;
355                         }
356                 }
357                 
358                 //adjust tree to make sure root to tip length is .5
359                 int root = t->findRoot();
360                 t->tree[root].setBranchLength((0.5 - t->tree[root].getLengthToLeaves()));
361                 
362                 //assemble tree
363                 t->assembleTree();
364                 
365                 //print newick file
366                 t->createNewickFile(outputFile);
367                 
368                 //delete tree
369                 delete t;
370         
371         }
372         catch(exception& e) {
373                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function createTree. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
374                 exit(1);
375         }
376         catch(...) {
377                 cout << "An unknown error has occurred in the TreeGroupCommand class function createTree. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
378                 exit(1);
379         }
380 }
381 /***********************************************************/
382 void TreeGroupCommand::printSims(ostream& out) {
383         try {
384                 
385                 //output column headers
386                 //out << '\t';
387                 //for (int i = 0; i < lookup.size(); i++) {     out << lookup[i]->getGroup() << '\t';           }
388                 //out << endl;
389                 
390                 
391                 for (int m = 0; m < simMatrix.size(); m++)      {
392                         //out << lookup[m]->getGroup() << '\t';
393                         for (int n = 0; n < simMatrix.size(); n++)      {
394                                 out << simMatrix[m][n] << '\t'; 
395                         }
396                         out << endl;
397                 }
398
399         }
400         catch(exception& e) {
401                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function printSims. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
402                 exit(1);
403         }
404         catch(...) {
405                 cout << "An unknown error has occurred in the TreeGroupCommand class function printSims. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
406                 exit(1);
407         }               
408 }
409 /***********************************************************/
410 void TreeGroupCommand::makeSimsDist() {
411         try {
412                 numGroups = list->size();
413                 
414                 //initialize index
415                 index.clear();
416                 for (int g = 0; g < numGroups; g++) {   index[g] = g;   }
417                 
418                 //initialize simMatrix
419                 simMatrix.clear();
420                 simMatrix.resize(numGroups);
421                 for (int m = 0; m < simMatrix.size(); m++)      {
422                         for (int j = 0; j < simMatrix.size(); j++)      {
423                                 simMatrix[m].push_back(0.0);
424                         }
425                 }
426                 
427                 //go through sparse matrix and fill sims
428                 //go through each cell in the sparsematrix
429                 for(MatData currentCell = matrix->begin(); currentCell != matrix->end(); currentCell++){
430                         //similairity = -(distance-1)
431                         simMatrix[currentCell->row][currentCell->column] = -(currentCell->dist -1.0);   
432                         simMatrix[currentCell->column][currentCell->row] = -(currentCell->dist -1.0);                           
433                 }
434
435
436         }
437         catch(exception& e) {
438                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function makeSimsDist. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
439                 exit(1);
440         }
441         catch(...) {
442                 cout << "An unknown error has occurred in the TreeGroupCommand class function makeSimsDist. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
443                 exit(1);
444         }               
445 }
446
447 /***********************************************************/
448 void TreeGroupCommand::makeSimsShared() {
449         try {
450                 int count = 1;  
451         
452                 //clear globaldatas old tree names if any
453                 globaldata->Treenames.clear();
454                 
455                 //fills globaldatas tree names
456                 globaldata->Treenames = globaldata->Groups;
457                 
458                 //create treemap class from groupmap for tree class to use
459                 tmap = new TreeMap();
460                 tmap->makeSim(globaldata->gGroupmap);
461                 globaldata->gTreemap = tmap;
462                 
463                 set<string> processedLabels;
464                 set<string> userLabels = labels;
465                 set<int> userLines = lines;
466
467                 //as long as you are not at the end of the file or done wih the lines you want
468                 while((lookup[0] != NULL) && ((allLines == 1) || (userLabels.size() != 0) || (userLines.size() != 0))) {
469                 
470                         if(allLines == 1 || lines.count(count) == 1 || labels.count(lookup[0]->getLabel()) == 1){                       
471                                 cout << lookup[0]->getLabel() << '\t' << count << endl;
472                                 process(lookup);
473                                 
474                                 processedLabels.insert(lookup[0]->getLabel());
475                                 userLabels.erase(lookup[0]->getLabel());
476                                 userLines.erase(count);
477                         }
478                         
479                         if ((anyLabelsToProcess(lookup[0]->getLabel(), userLabels, "") == true) && (processedLabels.count(lastLookup[0]->getLabel()) != 1)) {
480                                 cout << lastLookup[0]->getLabel() << '\t' << count << endl;
481                                 process(lastLookup);
482                                         
483                                 processedLabels.insert(lastLookup[0]->getLabel());
484                                 userLabels.erase(lastLookup[0]->getLabel());
485                         }
486
487                         //prevent memory leak
488                         if (count != 1) { for (int i = 0; i < lastLookup.size(); i++) {  delete lastLookup[i];  } }
489                         lastLookup = lookup;                    
490                         
491                         //get next line to process
492                         lookup = input->getSharedRAbundVectors();
493                         count++;
494                 }
495                 
496                 //output error messages about any remaining user labels
497                 set<string>::iterator it;
498                 bool needToRun = false;
499                 for (it = userLabels.begin(); it != userLabels.end(); it++) {  
500                         cout << "Your file does not include the label "<< *it; 
501                         if (processedLabels.count(lastLookup[0]->getLabel()) != 1) {
502                                 cout << ". I will use " << lastLookup[0]->getLabel() << "." << endl;
503                                 needToRun = true;
504                         }else {
505                                 cout << ". Please refer to " << lastLookup[0]->getLabel() << "." << endl;
506                         }
507                 }
508                 
509                 //run last line if you need to
510                 if (needToRun == true)  {
511                         cout << lastLookup[0]->getLabel() << '\t' << count << endl;
512                         process(lastLookup);
513                 }
514                 
515                 for (int i = 0; i < lastLookup.size(); i++) {  delete lastLookup[i];  }
516                 for(int i = 0 ; i < treeCalculators.size(); i++) {  delete treeCalculators[i]; }
517         }
518         catch(exception& e) {
519                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function makeSimsShared. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
520                 exit(1);
521         }
522         catch(...) {
523                 cout << "An unknown error has occurred in the TreeGroupCommand class function makeSimsShared. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
524                 exit(1);
525         }               
526 }
527
528 /***********************************************************/
529 void TreeGroupCommand::process(vector<SharedRAbundVector*> thisLookup) {
530         try{
531                                 EstOutput data;
532                                 vector<SharedRAbundVector*> subset;
533                                 numGroups = thisLookup.size();
534                                 
535                                 //for each calculator                                                                                           
536                                 for(int i = 0 ; i < treeCalculators.size(); i++) {
537                                         //initialize simMatrix
538                                         simMatrix.clear();
539                                         simMatrix.resize(numGroups);
540                                         for (int m = 0; m < simMatrix.size(); m++)      {
541                                                 for (int j = 0; j < simMatrix.size(); j++)      {
542                                                         simMatrix[m].push_back(0.0);
543                                                 }
544                                         }
545                 
546                                         //initialize index
547                                         index.clear();
548                                         for (int g = 0; g < numGroups; g++) {   index[g] = g;   }
549                 
550                                         //create a new filename
551                                         outputFile = getRootName(globaldata->inputFileName) + treeCalculators[i]->getName() + "." + thisLookup[0]->getLabel() + ".tre";                         
552                                                                                                 
553                                         for (int k = 0; k < thisLookup.size(); k++) { 
554                                                 for (int l = k; l < thisLookup.size(); l++) {
555                                                         if (k != l) { //we dont need to similiarity of a groups to itself
556                                                                 //get estimated similarity between 2 groups
557                                                                 
558                                                                 subset.clear(); //clear out old pair of sharedrabunds
559                                                                 //add new pair of sharedrabunds
560                                                                 subset.push_back(thisLookup[k]); subset.push_back(thisLookup[l]); 
561                                                                 
562                                                                 data = treeCalculators[i]->getValues(subset); //saves the calculator outputs
563                                                                 //save values in similarity matrix
564                                                                 simMatrix[k][l] = data[0];
565                                                                 simMatrix[l][k] = data[0];
566                                                         }
567                                                 }
568                                         }
569                                 
570                                         //creates tree from similarity matrix and write out file
571                                         createTree();
572                                 }
573
574         }
575         catch(exception& e) {
576                 cout << "Standard Error: " << e.what() << " has occurred in the TreeGroupCommand class Function process. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
577                 exit(1);
578         }
579         catch(...) {
580                 cout << "An unknown error has occurred in the TreeGroupCommand class function process. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
581                 exit(1);
582         }               
583 }
584 /***********************************************************/
585
586         
587