1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
|
/*
* indicatorcommand.cpp
* Mothur
*
* Created by westcott on 11/12/10.
* Copyright 2010 Schloss Lab. All rights reserved.
*
*/
#include "indicatorcommand.h"
//**********************************************************************************************************************
vector<string> IndicatorCommand::setParameters(){
try {
CommandParameter piters("iters", "Number", "", "1000", "", "", "","",false,false); parameters.push_back(piters);
CommandParameter pdesign("design", "InputTypes", "", "", "TreeDesign", "TreeDesign", "none","summary",false,false,true); parameters.push_back(pdesign);
CommandParameter pshared("shared", "InputTypes", "", "", "SharedRel", "SharedRel", "none","summary",false,false,true); parameters.push_back(pshared);
CommandParameter prelabund("relabund", "InputTypes", "", "", "SharedRel", "SharedRel", "none","summary",false,false); parameters.push_back(prelabund);
CommandParameter pgroups("groups", "String", "", "", "", "", "","",false,false); parameters.push_back(pgroups);
CommandParameter plabel("label", "String", "", "", "", "", "","",false,false); parameters.push_back(plabel);
CommandParameter ptree("tree", "InputTypes", "", "", "TreeDesign", "TreeDesign", "none","tree-summary",false,false,true); parameters.push_back(ptree);
CommandParameter pseed("seed", "Number", "", "0", "", "", "","",false,false); parameters.push_back(pseed);
CommandParameter pinputdir("inputdir", "String", "", "", "", "", "","",false,false); parameters.push_back(pinputdir);
CommandParameter poutputdir("outputdir", "String", "", "", "", "", "","",false,false); parameters.push_back(poutputdir);
CommandParameter pprocessors("processors", "Number", "", "1", "", "", "","",false,false); parameters.push_back(pprocessors);
abort = false; calledHelp = false;
vector<string> tempOutNames;
outputTypes["tree"] = tempOutNames;
outputTypes["summary"] = tempOutNames;
vector<string> myArray;
for (int i = 0; i < parameters.size(); i++) { myArray.push_back(parameters[i].name); }
return myArray;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "setParameters");
exit(1);
}
}
//**********************************************************************************************************************
string IndicatorCommand::getHelpString(){
try {
string helpString = "";
helpString += "The indicator command can be run in 3 ways: with a shared or relabund file and a design file, or with a shared or relabund file and a tree file, or with a shared or relabund file, tree file and design file. \n";
helpString += "The indicator command outputs a .indicator.summary file and a .indicator.tre if a tree is given. \n";
helpString += "The new tree contains labels at each internal node. The label is the node number so you can relate the tree to the summary file.\n";
helpString += "The summary file lists the indicator value for each OTU for each node.\n";
helpString += "The indicator command parameters are tree, groups, shared, relabund, design and label. \n";
helpString += "The design parameter allows you to relate the tree to the shared or relabund file, if your tree contains the grouping names, or if no tree is provided to group your groups into groupings.\n";
helpString += "The groups parameter allows you to specify which of the groups in your shared or relabund you would like analyzed, or if you provide a design file the groups in your design file. The groups may be entered separated by dashes.\n";
helpString += "The label parameter indicates at what distance your tree relates to the shared or relabund.\n";
helpString += "The processors parameter allows you to specify how many processors you would like to use. The default is 1. \n";
helpString += "The iters parameter allows you to set number of randomization for the P value. The default is 1000.";
helpString += "The indicator command should be used in the following format: indicator(tree=test.tre, shared=test.shared, label=0.03)\n";
return helpString;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getHelpString");
exit(1);
}
}
//**********************************************************************************************************************
string IndicatorCommand::getOutputPattern(string type) {
try {
string pattern = "";
if (type == "tree") { pattern = "[filename],indicator.tre"; }
else if (type == "summary") { pattern = "[filename],indicator.summary"; }
else { m->mothurOut("[ERROR]: No definition for type " + type + " output pattern.\n"); m->setControl_pressed(true); }
return pattern;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getOutputPattern");
exit(1);
}
}
//**********************************************************************************************************************
IndicatorCommand::IndicatorCommand(string option) : Command() {
try {
//allow user to run help
if(option == "help") { help(); abort = true; calledHelp = true; }
else if(option == "citation") { citation(); abort = true; calledHelp = true;}
else if(option == "category") { abort = true; calledHelp = true; }
else {
OptionParser parser(option, setParameters());
map<string, string> parameters = parser.getParameters();
ValidParameters validParameter;
//check for required parameters
treefile = validParameter.validFile(parameters, "tree");
if (treefile == "not open") { treefile = ""; abort = true; }
else if (treefile == "not found") { treefile = ""; }
else { current->setTreeFile(treefile); }
sharedfile = validParameter.validFile(parameters, "shared");
if (sharedfile == "not open") { abort = true; }
else if (sharedfile == "not found") { sharedfile = ""; }
else { inputFileName = sharedfile; current->setSharedFile(sharedfile); }
relabundfile = validParameter.validFile(parameters, "relabund");
if (relabundfile == "not open") { abort = true; }
else if (relabundfile == "not found") { relabundfile = ""; }
else { inputFileName = relabundfile; current->setRelAbundFile(relabundfile); }
designfile = validParameter.validFile(parameters, "design");
if (designfile == "not open") { designfile = ""; abort = true; }
else if (designfile == "not found") { designfile = ""; }
else { current->setDesignFile(designfile); }
groups = validParameter.valid(parameters, "groups");
if (groups == "not found") { groups = ""; }
else { util.splitAtDash(groups, Groups); if (Groups.size() != 0) { if (Groups[0]== "all") { Groups.clear(); } } }
label = validParameter.valid(parameters, "label");
if (label == "not found") { label = ""; m->mothurOut("You did not provide a label, I will use the first label in your inputfile.\n"); label=""; }
string temp = validParameter.valid(parameters, "iters"); if (temp == "not found") { temp = "1000"; }
util.mothurConvert(temp, iters);
temp = validParameter.valid(parameters, "processors"); if (temp == "not found"){ temp = current->getProcessors(); }
processors = current->setProcessors(temp);
if ((relabundfile == "") && (sharedfile == "")) {
//is there are current file available for either of these?
//give priority to shared, then relabund
sharedfile = current->getSharedFile();
if (sharedfile != "") { inputFileName = sharedfile; m->mothurOut("Using " + sharedfile + " as input file for the shared parameter.\n"); }
else {
relabundfile = current->getRelAbundFile();
if (relabundfile != "") { inputFileName = relabundfile; m->mothurOut("Using " + relabundfile + " as input file for the relabund parameter.\n"); }
else {
m->mothurOut("No valid current files. You must provide a shared or relabund.\n");
abort = true;
}
}
}
if ((designfile == "") && (treefile == "")) {
treefile = current->getTreeFile();
if (treefile != "") { m->mothurOut("Using " + treefile + " as input file for the tree parameter.\n"); }
else {
designfile = current->getDesignFile();
if (designfile != "") { m->mothurOut("Using " + designfile + " as input file for the design parameter.\n"); }
else {
m->mothurOut("[ERROR]: You must provide either a tree or design file.\n"); abort = true;
}
}
}
if ((relabundfile != "") && (sharedfile != "")) { m->mothurOut("[ERROR]: You may not use both a shared and relabund file.\n"); abort = true; }
}
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "IndicatorCommand");
exit(1);
}
}
//**********************************************************************************************************************
int IndicatorCommand::execute(){
try {
if (abort) { if (calledHelp) { return 0; } return 2; }
cout.setf(ios::fixed, ios::floatfield); cout.setf(ios::showpoint);
long start = time(nullptr);
//read designfile if given and set up groups for read of sharedfiles
vector<string> allGroups;
if (designfile != "") {
designMap = new DesignMap(designfile); if (m->getControl_pressed()) { delete designMap; return 0; }
if (Groups.size() == 0) { Groups = designMap->getCategory(); }
allGroups = designMap->getCategory();
namesSeqs = designMap->getNamesGroups(Groups);
}else {
InputData* input = nullptr;
if (sharedfile != "") { input = new InputData(sharedfile, "sharedfile", Groups); }
else { input = new InputData(sharedfile, "relabundfile", Groups); }
SharedRAbundVectors* lookup = input->getSharedRAbundVectors();
Groups = lookup->getNamesGroups();
namesSeqs = Groups;
delete lookup; delete input;
}
if (treefile != "") {
string groupfile = "";
current->setTreeFile(treefile);
vector<string> Treenames = util.parseTreeFile(treefile);
CountTable ct;
bool mismatch = false;
set<string> nameMap; map<string, string> groupMap; set<string> gps;
for (int i = 0; i < Treenames.size(); i++) {
nameMap.insert(Treenames[i]);
//sanity check - is this a group that is not in the sharedfile?
if (i == 0) { gps.insert("Group1"); }
if (designfile == "") {
if (!(util.inUsersGroups(Treenames[i], namesSeqs))) { m->mothurOut("[ERROR]: " + Treenames[i] + " is not a group in your shared or relabund file.\n"); mismatch = true; }
groupMap[Treenames[i]] = "Group1";
}else{
vector<string> myGroups; myGroups.push_back(Treenames[i]);
vector<string> myNames = designMap->getNamesGroups(myGroups);
for(int k = 0; k < myNames.size(); k++) {
if (!(util.inUsersGroups(myNames[k], allGroups))) { m->mothurOut("[ERROR]: " + myNames[k] + " is not a group in your shared or relabund file.\n"); mismatch = true; }
}
groupMap[Treenames[i]] = designMap->get(Treenames[i]);
}
}
ct.createTable(nameMap, groupMap, gps);
if ((designfile != "") && (Treenames.size() != namesSeqs.size())) { m->mothurOut("[ERROR]: You design file does not match your tree, aborting.\n"); mismatch = true; }
if (mismatch) { //cleanup and exit
if (designfile != "") { delete designMap; } return 0;
}
ReadTree* read = new ReadNewickTree(treefile, Treenames);
int readOk = read->read(&ct); if (readOk != 0) { m->mothurOut("Read Terminated.\n"); delete read; return 0; }
vector<Tree*> T = read->getTrees(); delete read;
if (m->getControl_pressed()) { if (designfile != "") { delete designMap; } for (int i = 0; i < T.size(); i++) { delete T[i]; } return 0; }
T[0]->assembleTree();
Tree* outputTree = new Tree(namesSeqs.size(), &ct, Treenames); //create ouptut tree - respecting pickedGroups
outputTree->getSubTree(T[0], namesSeqs);
outputTree->assembleTree();
//no longer need original tree, we have output tree to use and label
for (int i = 0; i < T.size(); i++) { delete T[i]; }
if (m->getControl_pressed()) { if (designfile != "") { delete designMap; } delete outputTree; return 0; }
GetIndicatorSpecies(outputTree); //get indicator species values
delete outputTree;
}else { GetIndicatorSpecies(); } //run with design file only
if (designfile != "") { delete designMap; }
if (m->getControl_pressed()) { for (int i = 0; i < outputNames.size(); i++) { util.mothurRemove(outputNames[i]); } return 0; }
//set tree file as new current treefile
if (treefile != "") {
string currentName = "";
itTypes = outputTypes.find("tree");
if (itTypes != outputTypes.end()) {
if ((itTypes->second).size() != 0) { currentName = (itTypes->second)[0]; current->setTreeFile(currentName); }
}
}
m->mothurOut("\n\nIt took " + toString(time(nullptr) - start) + " secs to find the indicator species.\n");
m->mothurOut("\nOutput File Names: \n");
for (int i = 0; i < outputNames.size(); i++) { m->mothurOut(outputNames[i] +"\n"); } m->mothurOutEndLine();
return 0;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "execute");
exit(1);
}
}
//**********************************************************************************************************************
//indicatorValues = getValues(groupings, groupingNames, indicatorGroups, randomGroupingsMap, m);
vector<float> getValues(vector< vector<SharedRAbundFloatVector*> >& groupings, vector< vector<string> >& groupingNames, vector<string>& indicatorGroupings, map<sharedIndexes, vector<int> > groupingsMap, MothurOut* m){
try {
vector<float> values;
map<sharedIndexes, vector<int> >::iterator it;
indicatorGroupings.clear();
//create grouping strings
vector<string> groupingsGroups;
for (int j = 0; j < groupings.size(); j++) {
string tempGrouping = "";
for (int k = 0; k < groupings[j].size()-1; k++) { tempGrouping += groupingNames[j][k] + "-"; }
tempGrouping += groupingNames[j][groupingNames[j].size()-1];
groupingsGroups.push_back(tempGrouping);
}
Utils util;
//for each otu
for (int i = 0; i < groupings[0][0]->getNumBins(); i++) {
if (m->getControl_pressed()) { return values; }
vector<float> terms;
float AijDenominator = 0.0;
vector<float> Bij;
//get overall abundance of each grouping
for (int j = 0; j < groupings.size(); j++) {
float totalAbund = 0;
int numNotZero = 0;
for (int k = 0; k < groupings[j].size(); k++) {
sharedIndexes temp(j,k);
it = groupingsMap.find(temp);
if (it == groupingsMap.end()) { //this one didnt get moved, or initial calc
totalAbund += groupings[j][k]->get(i);
if (!util.isEqual(groupings[j][k]->get(i), 0)) { numNotZero++; }
}else {
float thisAbund = groupings[(it->second)[0]][(it->second)[1]]->get(i);
totalAbund += thisAbund;
if (!util.isEqual(thisAbund, 0)) { numNotZero++; }
}
}
//mean abundance
float Aij = (totalAbund / (float) groupings[j].size());
terms.push_back(Aij);
//percentage of sites represented
Bij.push_back(numNotZero / (float) groupings[j].size());
AijDenominator += Aij;
}
float maxIndVal = 0.0;
string maxGrouping = "";
for (int j = 0; j < terms.size(); j++) {
float thisAij = (terms[j] / AijDenominator); //relative abundance
float thisValue = thisAij * Bij[j] * 100.0;
//save largest
if (thisValue > maxIndVal) { maxIndVal = thisValue; maxGrouping = groupingsGroups[j]; }
}
values.push_back(maxIndVal);
indicatorGroupings.push_back(maxGrouping);
}
return values;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getValues");
exit(1);
}
}
//**********************************************************************************************************************
//same as above, just data type difference
//indicatorValues = getValues(groupings, groupingNames, indicatorGroups, randomGroupingsMap, m);
vector<float> getValues(vector< vector<SharedRAbundVector*> >& groupings, vector< vector<string> >& groupingNames, vector<string>& indicatorGroupings, map<sharedIndexes, vector<int> > groupingsMap, MothurOut* m){
try {
vector<float> values;
map<sharedIndexes, vector<int> >::iterator it;
indicatorGroupings.clear();
//create grouping strings
vector<string> groupingsGroups;
for (int j = 0; j < groupings.size(); j++) {
string tempGrouping = "";
for (int k = 0; k < groupings[j].size()-1; k++) {
tempGrouping += groupingNames[j][k] + "-";
}
tempGrouping += groupingNames[j][groupingNames[j].size()-1];
groupingsGroups.push_back(tempGrouping);
}
//for each otu
for (int i = 0; i < groupings[0][0]->getNumBins(); i++) {
vector<float> terms;
float AijDenominator = 0.0;
vector<float> Bij;
//get overall abundance of each grouping
for (int j = 0; j < groupings.size(); j++) {
int totalAbund = 0.0;
int numNotZero = 0;
for (int k = 0; k < groupings[j].size(); k++) {
sharedIndexes temp(j,k);
it = groupingsMap.find(temp);
if (it == groupingsMap.end()) { //this one didnt get moved
totalAbund += groupings[j][k]->get(i);
if (groupings[j][k]->get(i) != 0) { numNotZero++; }
}else {
//cout << j << "," << k << '\t' << (it->second).treatmentIndex << "," << (it->second).sampleIndex << endl;
int thisAbund = groupings[(it->second)[0]][(it->second)[1]]->get(i);
totalAbund += thisAbund;
if (thisAbund != 0) { numNotZero++; }
}
}
//mean abundance
float Aij = (totalAbund / (float) groupings[j].size());
terms.push_back(Aij);
//percentage of sites represented
Bij.push_back(numNotZero / (float) groupings[j].size());
AijDenominator += Aij;
}
float maxIndVal = 0.0;
string maxGrouping = "";
for (int j = 0; j < terms.size(); j++) {
float thisAij = (terms[j] / AijDenominator); //relative abundance
float thisValue = thisAij * Bij[j] * 100.0;
//save largest
if (thisValue > maxIndVal) { maxIndVal = thisValue; maxGrouping = groupingsGroups[j]; }
}
values.push_back(maxIndVal);
indicatorGroupings.push_back(maxGrouping);
}
return values;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getValues");
exit(1);
}
}
//**********************************************************************************************************************
//divide shared or relabund file by groupings in the design file
//report all otu values to file
int IndicatorCommand::GetIndicatorSpecies(){
try {
SharedRAbundVectors* lookup = nullptr; SharedRAbundFloatVectors* lookupFloat = nullptr;
if (sharedfile != "") {
lookup = getShared();
if (m->getControl_pressed()) { if (designfile != "") { delete designMap; } delete lookup; return 0; }
if (lookup == nullptr) { m->mothurOut("[ERROR] reading shared file.\n"); return 0; }
}else {
lookupFloat = getSharedFloat();
if (m->getControl_pressed()) { if (designfile != "") { delete designMap; } delete lookupFloat; return 0; }
if (lookupFloat == nullptr) { m->mothurOut("[ERROR] reading relabund file.\n"); return 0; }
}
string thisOutputDir = outputdir;
if (outputdir == "") { thisOutputDir += util.hasPath(inputFileName); }
map<string, string> variables;
variables["[filename]"] = thisOutputDir + util.getRootName(util.getSimpleName(inputFileName));
string outputFileName = getOutputFileName("summary", variables);
outputNames.push_back(outputFileName); outputTypes["summary"].push_back(outputFileName);
ofstream out;
util.openOutputFile(outputFileName, out);
out.setf(ios::fixed, ios::floatfield); out.setf(ios::showpoint);
cout.setf(ios::fixed, ios::floatfield); cout.setf(ios::showpoint);
m->mothurOut("\nSpecies\tIndicator_Groups\tIndicatorValue\tpValue\n");
int numBins = 0;
vector<string> currentLabels;
if (sharedfile != "") { numBins = lookup->getNumBins(); currentLabels = lookup->getOTUNames(); }
else { numBins = lookupFloat->getNumBins(); currentLabels = lookupFloat->getOTUNames(); }
if (m->getControl_pressed()) { out.close(); if (sharedfile != "") { delete lookup; }
else { delete lookupFloat; } return 0; }
/*****************************************************/
//create vectors containing rabund info //
/*****************************************************/
vector<float> indicatorValues; //size of numBins
vector<float> pValues;
vector<string> indicatorGroups;
map<sharedIndexes, vector<int> > randomGroupingsMap; //maps location in groupings to location in groupings, ie, [0][0] -> [1][2]. This is so we don't have to actually move the sharedRabundVectors.
if (sharedfile != "") {
vector< vector<SharedRAbundVector*> > groupings;
vector< vector<string> > groupingNames;
/*
Consider design file:
C10 Y
C11 Y
C12 Y
C13 O
C14 O
C15 O
C19 N
C20 N
C21 N
groupings[0] = sharedRabundvectors for treatment Y -> C10,C11,C12
groupings[1] = sharedRabundvectors for treatment O -> C13,C15,C15
groupings[2] = sharedRabundvectors for treatment N -> C13,C15,C15
groupingNames[0] = vector of sample names in treatment Y {C10,C11,C12}
groupingNames[1] = vector of sample names in treatment 0 {C13,C15,C15}
groupingNames[2] = vector of sample names in treatment N {C13,C15,C15}
*/
set<string> groupsAlreadyAdded;
vector<SharedRAbundVector*> subset;
vector<string> subsetNames;
vector<SharedRAbundVector*> data = lookup->getSharedRAbundVectors();
vector<string> dataGroupNames = lookup->getNamesGroups();
//for each grouping, clustering together
for (int i = 0; i < (designMap->getCategory()).size(); i++) {
for (int k = 0; k < data.size(); k++) {
//are you from this grouping?
if (designMap->get(dataGroupNames[k]) == (designMap->getCategory())[i]) {
subset.push_back(data[k]);
subsetNames.push_back(dataGroupNames[k]);
groupsAlreadyAdded.insert(dataGroupNames[k]);
}
}
if (subset.size() != 0) { groupings.push_back(subset); groupingNames.push_back(subsetNames); }
subset.clear();
}
if (groupsAlreadyAdded.size() != data.size()) { m->mothurOut("[ERROR]: could not make proper groupings.\n"); }
indicatorValues = getValues(groupings, groupingNames, indicatorGroups, randomGroupingsMap, m);
pValues = getPValues(groupings, groupingNames, lookup->size(), indicatorValues);
}else {
vector< vector<SharedRAbundFloatVector*> > groupings;
vector< vector<string> > groupingNames;
set<string> groupsAlreadyAdded;
vector<SharedRAbundFloatVector*> subset;
vector<string> subsetNames;
vector<SharedRAbundFloatVector*> data = lookupFloat->getSharedRAbundFloatVectors();
vector<string> dataGroupNames = lookupFloat->getNamesGroups();
//for each grouping
for (int i = 0; i < (designMap->getCategory()).size(); i++) {
for (int k = 0; k < data.size(); k++) {
//are you from this grouping?
if (designMap->get(dataGroupNames[k]) == (designMap->getCategory())[i]) {
subset.push_back(data[k]);
subsetNames.push_back(dataGroupNames[k]);
groupsAlreadyAdded.insert(dataGroupNames[k]);
}
}
if (subset.size() != 0) { groupings.push_back(subset); groupingNames.push_back(subsetNames); }
subset.clear();
}
if (groupsAlreadyAdded.size() != data.size()) { m->mothurOut("[ERROR]: could not make proper groupings.\n"); }
indicatorValues = getValues(groupings, groupingNames, indicatorGroups, randomGroupingsMap, m);
pValues = getPValues(groupings, groupingNames, lookupFloat->size(), indicatorValues);
}
if (m->getControl_pressed()) { out.close(); return 0; }
/******************************************************/
//output indicator values to table form //
/*****************************************************/
out << "OTU\tIndicator_Groups\tIndicator_Value\tpValue" << endl;
for (int j = 0; j < indicatorValues.size(); j++) {
if (m->getControl_pressed()) { out.close(); return 0; }
out << currentLabels[j] << '\t' << indicatorGroups[j] << '\t' << indicatorValues[j] << '\t';
if (pValues[j] > (1/(float)iters)) { out << pValues[j] << endl; }
else { out << "<" << (1/(float)iters) << endl; }
if (pValues[j] <= 0.05) {
string pValueString = "<" + toString((1/(float)iters));
if (pValues[j] > (1/(float)iters)) { pValueString = toString(pValues[j]); }
m->mothurOut(currentLabels[j] + "\t" + indicatorGroups[j] + "\t" + toString(indicatorValues[j]) + "\t" + pValueString + "\n");
}
}
out.close();
if (sharedfile != "") { delete lookup; }
else { delete lookupFloat; }
return 0;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "GetIndicatorSpecies");
exit(1);
}
}
//**********************************************************************************************************************
//traverse tree finding indicator species values for each otu at each node
//label node with otu number that has highest indicator value
//report all otu values to file
int IndicatorCommand::GetIndicatorSpecies(Tree*& T){
try {
SharedRAbundVectors* lookup = nullptr; SharedRAbundFloatVectors* lookupFloat = nullptr;
if (sharedfile != "") {
lookup = getShared();
if (m->getControl_pressed()) { if (designfile != "") { delete designMap; } delete lookup; return 0; }
if (lookup == nullptr) { m->mothurOut("[ERROR] reading shared file.\n"); return 0; }
}else {
lookupFloat = getSharedFloat();
if (m->getControl_pressed()) { if (designfile != "") { delete designMap; } delete lookupFloat; return 0; }
if (lookupFloat == nullptr) { m->mothurOut("[ERROR] reading relabund file.\n"); return 0; }
}
string thisOutputDir = outputdir;
if (outputdir == "") { thisOutputDir += util.hasPath(inputFileName); }
map<string, string> variables;
variables["[filename]"] = thisOutputDir + util.getRootName(util.getSimpleName(inputFileName));
string outputFileName = getOutputFileName("summary",variables);
outputNames.push_back(outputFileName); outputTypes["summary"].push_back(outputFileName);
ofstream out;
util.openOutputFile(outputFileName, out);
out.setf(ios::fixed, ios::floatfield); out.setf(ios::showpoint);
int numBins = 0;
vector<string> currentLabels;
if (sharedfile != "") { numBins = lookup->getNumBins(); currentLabels = lookup->getOTUNames(); }
else { numBins = lookupFloat->getNumBins(); currentLabels = lookupFloat->getOTUNames(); }
//print headings
out << "TreeNode\t";
for (int i = 0; i < numBins; i++) { out << currentLabels[i] << "_IndGroups" << '\t' << currentLabels[i] << "_IndValue" << '\t' << "pValue" << '\t'; } out << endl;
m->mothurOut("\nNode\tSpecies\tIndicator_Groups\tIndicatorValue\tpValue\n");
string treeOutputDir = outputdir;
if (outputdir == "") { treeOutputDir += util.hasPath(treefile); }
variables["[filename]"] = treeOutputDir + util.getRootName(util.getSimpleName(treefile));
string outputTreeFileName = getOutputFileName("tree", variables);
//create a map from tree node index to names of descendants, save time later to know which sharedRabund you need
map<int, set<string> > nodeToDescendants;
map<int, set<int> > descendantNodes;
for (int i = 0; i < T->getNumNodes(); i++) { if (m->getControl_pressed()) { return 0; }
nodeToDescendants[i] = getDescendantList(T, i, nodeToDescendants, descendantNodes);
}
//you need the distances to leaf to decide grouping below
//this will also set branch lengths if the tree does not include them
map<int, float> distToRoot = getDistToRoot(T);
//for each node
for (int i = T->getNumLeaves(); i < T->getNumNodes(); i++) {
if (m->getControl_pressed()) { out.close(); return 0; }
/*****************************************************/
//create vectors containing rabund info //
/*****************************************************/
vector<float> indicatorValues; //size of numBins
vector<float> pValues;
vector<string> indicatorGroups;
vector< map<sharedIndexes, sharedIndexes> > randomGroupingsMap; //maps location in groupings to location in groupings, ie, [0][0] -> [1][2]. This is so we don't have to actually move the sharedRabundVectors.
if (sharedfile != "") {
vector< vector<SharedRAbundVector*> > groupings;
vector< vector<string> > groupingNames;
//get nodes that will be a valid grouping
//you are valid if you are not one of my descendants
//AND your distToRoot is >= mine
//AND you were not added as part of a larger grouping. Largest nodes are added first.
set<string> groupsAlreadyAdded;
//create a grouping with my grouping
vector<SharedRAbundVector*> subset;
vector<string> subsetNames;
int count = 0;
int doneCount = nodeToDescendants[i].size();
vector<SharedRAbundVector*> data = lookup->getSharedRAbundVectors();
vector<string> dataGroupNames = lookup->getNamesGroups();
for (int k = 0; k < data.size(); k++) {
//is this descendant of i
if ((nodeToDescendants[i].count(dataGroupNames[k]) != 0)) {
subset.push_back(data[k]);
subsetNames.push_back(dataGroupNames[k]);
groupsAlreadyAdded.insert(dataGroupNames[k]);
count++;
}
if (count == doneCount) { break; } //quit once you get the rabunds for this grouping
}
if (subset.size() != 0) { groupings.push_back(subset); groupingNames.push_back(subsetNames); }
for (int j = (T->getNumNodes()-1); j >= 0; j--) {
if ((descendantNodes[i].count(j) == 0) && (distToRoot[j] >= distToRoot[i])) {
vector<SharedRAbundVector*> subset;
vector<string> subsetNames;
int count = 0;
int doneCount = nodeToDescendants[j].size();
for (int k = 0; k < data.size(); k++) {
//is this descendant of j, and we didn't already add this as part of a larger grouping
if ((nodeToDescendants[j].count(dataGroupNames[k]) != 0) && (groupsAlreadyAdded.count(dataGroupNames[k]) == 0)) {
subset.push_back(data[k]);
subsetNames.push_back(dataGroupNames[k]);
groupsAlreadyAdded.insert(dataGroupNames[k]);
count++;
}
if (count == doneCount) { break; } //quit once you get the rabunds for this grouping
}
//if subset.size == 0 then the node was added as part of a larger grouping
if (subset.size() != 0) { groupings.push_back(subset); groupingNames.push_back(subsetNames); }
}
}
if (groupsAlreadyAdded.size() != data.size()) { m->mothurOut("[ERROR]: could not make proper groupings.\n"); }
map<sharedIndexes, vector<int> > placeHolder; //don't need randomization for initial calc
indicatorValues = getValues(groupings, groupingNames, indicatorGroups, placeHolder, m);
pValues = getPValues(groupings, groupingNames, lookup->getNumGroups(), indicatorValues);
}else {
vector< vector<SharedRAbundFloatVector*> > groupings;
vector< vector<string> > groupingNames;
//get nodes that will be a valid grouping
//you are valid if you are not one of my descendants
//AND your distToRoot is >= mine
//AND you were not added as part of a larger grouping. Largest nodes are added first.
set<string> groupsAlreadyAdded;
//create a grouping with my grouping
vector<SharedRAbundFloatVector*> subset;
vector<string> subsetNames;
int count = 0;
int doneCount = nodeToDescendants[i].size();
vector<SharedRAbundFloatVector*> data = lookupFloat->getSharedRAbundFloatVectors();
vector<string> dataGroupNames = lookupFloat->getNamesGroups();
for (int k = 0; k < data.size(); k++) {
//is this descendant of i
if ((nodeToDescendants[i].count(dataGroupNames[k]) != 0)) {
subset.push_back(data[k]);
subsetNames.push_back(dataGroupNames[k]);
groupsAlreadyAdded.insert(dataGroupNames[k]);
count++;
}
if (count == doneCount) { break; } //quit once you get the rabunds for this grouping
}
if (subset.size() != 0) { groupings.push_back(subset); groupingNames.push_back(subsetNames); }
for (int j = (T->getNumNodes()-1); j >= 0; j--) {
if ((descendantNodes[i].count(j) == 0) && (distToRoot[j] >= distToRoot[i])) {
vector<SharedRAbundFloatVector*> subset;
vector<string> subsetNames;
int count = 0;
int doneCount = nodeToDescendants[j].size();
for (int k = 0; k < data.size(); k++) {
//is this descendant of j, and we didn't already add this as part of a larger grouping
if ((nodeToDescendants[j].count(dataGroupNames[k]) != 0) && (groupsAlreadyAdded.count(dataGroupNames[k]) == 0)) {
subset.push_back(data[k]);
subsetNames.push_back(dataGroupNames[k]);
groupsAlreadyAdded.insert(dataGroupNames[k]);
count++;
}
if (count == doneCount) { break; } //quit once you get the rabunds for this grouping
}
//if subset.size == 0 then the node was added as part of a larger grouping
if (subset.size() != 0) { groupings.push_back(subset); groupingNames.push_back(subsetNames); }
}
}
if (groupsAlreadyAdded.size() != data.size()) { m->mothurOut("[ERROR]: could not make proper groupings.\n"); }
map<sharedIndexes, vector<int> > placeHolder; //don't need randomization for initial calc
indicatorValues = getValues(groupings, groupingNames, indicatorGroups, placeHolder, m);
pValues = getPValues(groupings, groupingNames, lookupFloat->getNumGroups(), indicatorValues);
}
if (m->getControl_pressed()) { out.close(); return 0; }
/******************************************************/
//output indicator values to table form + label tree //
/*****************************************************/
out << (i+1);
for (int j = 0; j < indicatorValues.size(); j++) {
if (m->getControl_pressed()) { out.close(); if (sharedfile != "") { delete lookup; }
else { delete lookupFloat; } return 0; }
if (pValues[j] < (1/(float)iters)) {
out << '\t' << indicatorGroups[j] << '\t' << indicatorValues[j] << '\t' << '<' << (1/(float)iters);
}else {
out << '\t' << indicatorGroups[j] << '\t' << indicatorValues[j] << '\t' << pValues[j];
}
if (pValues[j] <= 0.05) {
string pValueString = "\t<" + toString((1/(float)iters));
if (pValues[j] > (1/(float)iters)) { pValueString = toString('\t' + pValues[j]); }
m->mothurOut(toString(i+1) + "\t" + currentLabels[j] + "\t" + indicatorGroups[j] + "\t" + toString(indicatorValues[j]) + "\t" + pValueString + "\n");
}
}
out << endl;
T->tree[i].setLabel(toString(i+1));
}
out.close();
ofstream outTree;
util.openOutputFile(outputTreeFileName, outTree);
outputNames.push_back(outputTreeFileName); outputTypes["tree"].push_back(outputTreeFileName);
T->print(outTree, "both");
outTree.close();
if (sharedfile != "") { delete lookup; }
else { delete lookupFloat; }
return 0;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "GetIndicatorSpecies");
exit(1);
}
}
/**************************************************************************************************/
struct indicatorFloatData {
vector< vector<SharedRAbundFloatVector*> > groupings;
vector< vector<string> > groupingNames;
vector< map<sharedIndexes, vector<int> > > randomGroupings;
MothurOut* m;
int iters, numGroups;
vector<float> indicatorValues, pvalues;
indicatorFloatData(){}
indicatorFloatData(int it, vector< map<sharedIndexes, vector<int> > > ran, vector< vector<SharedRAbundFloatVector*> > ng, vector< vector<string> > gn, int n, vector<float> iv) {
m = MothurOut::getInstance();
iters = it;
groupings = ng;
groupingNames = gn;
randomGroupings = ran;
indicatorValues = iv;
pvalues.resize(indicatorValues.size(), 0);
numGroups = n;
}
};
struct indicatorData {
vector< vector<SharedRAbundVector*> > groupings;
vector< vector<string> > groupingNames;
vector< map<sharedIndexes, vector<int> > > randomGroupings;
MothurOut* m;
int iters, numGroups;
vector<float> indicatorValues, pvalues;
indicatorData(){}
indicatorData(int it, vector< map<sharedIndexes, vector<int> > > ran, vector< vector<SharedRAbundVector*> > ng, vector< vector<string> > gn, int n, vector<float> iv) {
m = MothurOut::getInstance();
iters = it;
groupings = ng;
groupingNames = gn;
randomGroupings = ran;
indicatorValues = iv;
pvalues.resize(indicatorValues.size(), 0);
numGroups = n;
}
};
//**********************************************************************************************************************
void driverValues(indicatorData* params){
try {
vector<string> notUsedGroupings; //we dont care about the grouping for the pvalues since they are randomized, but we need to pass the function something
for(int i=0;i<params->iters;i++){
if (params->m->getControl_pressed()) { break; }
map<sharedIndexes, vector<int> > groupingsMap = params->randomGroupings[i];
vector<float> randomIndicatorValues = getValues(params->groupings, params->groupingNames, notUsedGroupings, groupingsMap, params->m);
for (int j = 0; j < params->indicatorValues.size(); j++) { if (randomIndicatorValues[j] >= params->indicatorValues[j]) { params->pvalues[j]++; } }
}
}catch(exception& e) {
params->m->errorOut(e, "IndicatorCommand", "driver");
exit(1);
}
}
//**********************************************************************************************************************
void driverValuesFloat(indicatorFloatData* params){
try {
vector<string> notUsedGroupings; //we dont care about the grouping for the pvalues since they are randomized, but we need to pass the function something
for(int i=0;i<params->iters;i++){
if (params->m->getControl_pressed()) { break; }
map<sharedIndexes, vector<int> > groupingsMap = params->randomGroupings[i];
vector<float> randomIndicatorValues = getValues(params->groupings, params->groupingNames, notUsedGroupings, groupingsMap, params->m);
for (int j = 0; j < params->indicatorValues.size(); j++) {
if (randomIndicatorValues[j] >= params->indicatorValues[j]) { params->pvalues[j]++; }
}
}
}catch(exception& e) {
params->m->errorOut(e, "IndicatorCommand", "driver");
exit(1);
}
}
//**********************************************************************************************************************
vector<float> IndicatorCommand::getPValues(vector< vector<SharedRAbundFloatVector*> >& groupings, vector< vector<string> >& groupingNames, int num, vector<float> indicatorValues){
try {
vector<float> pvalues;
vector<int> groupingsSize;
for (int i = 0; i < groupings.size(); i++) { groupingsSize.push_back(groupings[i].size()); }
vector< map<sharedIndexes, vector<int> > > randomize = randomizeGroupings(groupingsSize, groupings.size());
//create array of worker threads
vector<std::thread*> workerThreads;
vector<indicatorFloatData*> data;
//divide iters between processors
vector<int> procIters;
int numItersPerProcessor = iters / processors;
//divide iters between processes
for (int h = 0; h < processors; h++) {
if(h == processors - 1){ numItersPerProcessor = iters - h * numItersPerProcessor; }
procIters.push_back(numItersPerProcessor);
}
//Lauch worker threads
int start = 0;
for (int i = 0; i < processors-1; i++) {
//make copy of lookup so we don't get access violations
vector< vector<SharedRAbundFloatVector*> > newGroupings;
for (int k = 0; k < groupings.size(); k++) {
vector<SharedRAbundFloatVector*> newLookup;
for (int l = 0; l < groupings[k].size(); l++) {
SharedRAbundFloatVector* temp = new SharedRAbundFloatVector(*groupings[k][l]);
newLookup.push_back(temp);
}
newGroupings.push_back(newLookup);
}
vector< map<sharedIndexes, vector<int> > > thisProcessorsRandom;
thisProcessorsRandom.insert(thisProcessorsRandom.begin(), randomize.begin()+start, randomize.begin()+start+procIters[i]); start += procIters[i];
indicatorFloatData* dataBundle = new indicatorFloatData(procIters[i], thisProcessorsRandom, newGroupings, groupingNames, num, indicatorValues);
data.push_back(dataBundle);
workerThreads.push_back(new std::thread(driverValuesFloat, dataBundle));
}
//make copy of lookup so we don't get access violations
vector< vector<SharedRAbundFloatVector*> > newGroupings;
for (int k = 0; k < groupings.size(); k++) {
vector<SharedRAbundFloatVector*> newLookup;
for (int l = 0; l < groupings[k].size(); l++) {
SharedRAbundFloatVector* temp = new SharedRAbundFloatVector(*groupings[k][l]);
newLookup.push_back(temp);
}
newGroupings.push_back(newLookup);
}
vector< map<sharedIndexes, vector<int> > > thisProcessorsRandom;
thisProcessorsRandom.insert(thisProcessorsRandom.begin(), randomize.begin()+start, randomize.begin()+start+procIters[processors-1]);
indicatorFloatData* dataBundle = new indicatorFloatData(procIters[processors-1], thisProcessorsRandom, newGroupings, groupingNames, num, indicatorValues);
driverValuesFloat(dataBundle);
pvalues = dataBundle->pvalues;
for (int l = 0; l < newGroupings.size(); l++) { for (int j = 0; j < newGroupings[l].size(); j++) { delete newGroupings[l][j]; } }
for (int i = 0; i < processors-1; i++) {
workerThreads[i]->join();
for (int j = 0; j < data[i]->pvalues.size(); j++) { pvalues[j] += data[i]->pvalues[j]; }
for (int l = 0; l < data[i]->groupings.size(); l++) { for (int j = 0; j < data[i]->groupings[l].size(); j++) { delete data[i]->groupings[l][j]; } }
delete data[i];
delete workerThreads[i];
}
delete dataBundle;
for (int i = 0; i < pvalues.size(); i++) { pvalues[i] /= (double)iters; }
return pvalues;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getPValues");
exit(1);
}
}
//**********************************************************************************************************************
//same as above, just data type difference
vector<float> IndicatorCommand::getPValues(vector< vector<SharedRAbundVector*> >& groupings, vector< vector<string> >& groupingNames, int num, vector<float> indicatorValues){
try {
vector<float> pvalues;
vector<int> groupingsSize;
for (int i = 0; i < groupings.size(); i++) { groupingsSize.push_back(groupings[i].size()); }
vector< map<sharedIndexes, vector<int> > > randomize = randomizeGroupings(groupingsSize, groupings.size());
//create array of worker threads
vector<std::thread*> workerThreads;
vector<indicatorData*> data;
//divide iters between processors
vector<int> procIters;
int numItersPerProcessor = iters / processors;
//divide iters between processes
for (int h = 0; h < processors; h++) {
if(h == processors - 1){ numItersPerProcessor = iters - h * numItersPerProcessor; }
procIters.push_back(numItersPerProcessor);
}
//Lauch worker threads
int start = 0;
for (int i = 0; i < processors-1; i++) {
//make copy of lookup so we don't get access violations
vector< vector<SharedRAbundVector*> > newGroupings;
for (int k = 0; k < groupings.size(); k++) {
vector<SharedRAbundVector*> newLookup;
for (int l = 0; l < groupings[k].size(); l++) {
SharedRAbundVector* temp = new SharedRAbundVector(*groupings[k][l]);
newLookup.push_back(temp);
}
newGroupings.push_back(newLookup);
}
vector< map<sharedIndexes, vector<int> > > thisProcessorsRandom;
thisProcessorsRandom.insert(thisProcessorsRandom.begin(), randomize.begin()+start, randomize.begin()+start+procIters[i]); start += procIters[i];
indicatorData* dataBundle = new indicatorData(procIters[i], thisProcessorsRandom, newGroupings, groupingNames, num, indicatorValues);
data.push_back(dataBundle);
workerThreads.push_back(new std::thread(driverValues, dataBundle));
}
//make copy of lookup so we don't get access violations
vector< vector<SharedRAbundVector*> > newGroupings;
for (int k = 0; k < groupings.size(); k++) {
vector<SharedRAbundVector*> newLookup;
for (int l = 0; l < groupings[k].size(); l++) {
SharedRAbundVector* temp = new SharedRAbundVector(*groupings[k][l]);
newLookup.push_back(temp);
}
newGroupings.push_back(newLookup);
}
vector< map<sharedIndexes, vector<int> > > thisProcessorsRandom;
thisProcessorsRandom.insert(thisProcessorsRandom.begin(), randomize.begin()+start, randomize.begin()+start+procIters[processors-1]);
indicatorData* dataBundle = new indicatorData(procIters[processors-1], thisProcessorsRandom, newGroupings, groupingNames, num, indicatorValues);
driverValues(dataBundle);
pvalues = dataBundle->pvalues;
for (int l = 0; l < newGroupings.size(); l++) { for (int j = 0; j < newGroupings[l].size(); j++) { delete newGroupings[l][j]; } }
for (int i = 0; i < processors-1; i++) {
workerThreads[i]->join();
for (int j = 0; j < data[i]->pvalues.size(); j++) { pvalues[j] += data[i]->pvalues[j]; }
for (int l = 0; l < data[i]->groupings.size(); l++) { for (int j = 0; j < data[i]->groupings[l].size(); j++) { delete data[i]->groupings[l][j]; } }
delete data[i];
delete workerThreads[i];
}
delete dataBundle;
for (int i = 0; i < pvalues.size(); i++) { pvalues[i] /= (double)iters; }
return pvalues;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getPValues");
exit(1);
}
}
//**********************************************************************************************************************
//swap samples between treatments, in essence randomizing the second column of the design file
vector< map<sharedIndexes, vector<int> > > IndicatorCommand::randomizeGroupings(vector<int> sizesOfEachTreatment, int numTreatments){
try {
int numSamplesToSwap = 0;
for (int i = 0; i < sizesOfEachTreatment.size(); i++) {
numSamplesToSwap += sizesOfEachTreatment[i];
}
vector< map<sharedIndexes, vector<int> > > randomGroupings; //map for each iter randomGroupings[0] ->
for (int k = 0; k < iters; k++) {
if (m->getControl_pressed()) {break;}
map<sharedIndexes, vector<int> > thisRandomization;
for (int i = 0; i < numSamplesToSwap; i++) {
//select random treatment and random sample to swap
int z = util.getRandomIndex(numTreatments-1);
int a = util.getRandomIndex(sizesOfEachTreatment[z]-1);
int x = util.getRandomIndex(numTreatments-1);
int b = util.getRandomIndex(sizesOfEachTreatment[x]-1);
sharedIndexes from(z, a);
vector<int> to; to.push_back(x); to.push_back(b);
thisRandomization[from] = to;
//cout << k << " : " << z << "," << a << '\t' << x << "," << b << endl;
//cout << from.treatmentIndex << "," << from.sampleIndex << '\t' << to[0] << "," << to[1] << endl;
}
randomGroupings.push_back(thisRandomization);
}
return randomGroupings;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "randomizeGroupings");
exit(1);
}
}
//**********************************************************************************************************************
SharedRAbundVectors* IndicatorCommand::getShared(){
try {
InputData input(sharedfile, "sharedfile", namesSeqs);
set<string> processedLabels;
set<string> userLabels;
string lastLabel = "";
if (label != "") { userLabels.insert(label); }
SharedRAbundVectors* lookup = util.getNextShared(input, true, userLabels, processedLabels, lastLabel);
Groups = lookup->getNamesGroups();
if (label == "") { label = lastLabel; }
return lookup;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getShared");
exit(1);
}
}
//**********************************************************************************************************************
SharedRAbundFloatVectors* IndicatorCommand::getSharedFloat(){
try {
InputData input(relabundfile, "relabund", namesSeqs);
set<string> processedLabels;
set<string> userLabels;
string lastLabel = "";
if (label != "") { userLabels.insert(label); }
SharedRAbundFloatVectors* lookup = util.getNextRelabund(input, true, userLabels, processedLabels, lastLabel);
Groups = lookup->getNamesGroups();
if (label == "") { label = lastLabel; }
return lookup;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getSharedFloat");
exit(1);
}
}
//**********************************************************************************************************************
//you need the distances to root to decide groupings
//this will also set branch lengths if the tree does not include them
map<int, float> IndicatorCommand::getDistToRoot(Tree*& T){
try {
map<int, float> dists;
bool hasBranchLengths = false;
for (int i = 0; i < T->getNumNodes(); i++) {
if (T->tree[i].getBranchLength() > 0.0) { hasBranchLengths = true; break; }
}
//set branchlengths if needed
if (!hasBranchLengths) {
for (int i = 0; i < T->getNumNodes(); i++) {
int lc = T->tree[i].getLChild();
int rc = T->tree[i].getRChild();
if (lc == -1) { // you are a leaf
//if you are a leaf set you priliminary length to 1.0, this may adjust later
T->tree[i].setBranchLength(1.0);
dists[i] = 1.0;
}else{ // you are an internal node
//look at your children's length to leaf
float ldist = dists[lc];
float rdist = dists[rc];
float greater = ldist;
if (rdist > greater) { greater = rdist; dists[i] = ldist + 1.0;}
else { dists[i] = rdist + 1.0; }
//branch length = difference + 1
T->tree[lc].setBranchLength((abs(ldist-greater) + 1.0));
T->tree[rc].setBranchLength((abs(rdist-greater) + 1.0));
}
}
}
dists.clear();
for (int i = 0; i < T->getNumNodes(); i++) {
double sum = 0.0;
int index = i;
while(T->tree[index].getParent() != -1){
if (!util.isEqual(T->tree[index].getBranchLength(), -1)) {
sum += abs(T->tree[index].getBranchLength());
}
index = T->tree[index].getParent();
}
dists[i] = sum;
}
return dists;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getLengthToLeaf");
exit(1);
}
}
//**********************************************************************************************************************
set<string> IndicatorCommand::getDescendantList(Tree*& T, int i, map<int, set<string> > descendants, map<int, set<int> >& nodes){
try {
set<string> names;
set<string>::iterator it;
int lc = T->tree[i].getLChild();
int rc = T->tree[i].getRChild();
if (lc == -1) { //you are a leaf your only descendant is yourself
set<int> temp; temp.insert(i);
nodes[i] = temp;
if (designfile == "") { names.insert(T->tree[i].getName()); }
else {
//string myRep = designMap->get(T->tree[i].getName());
names.insert(T->tree[i].getName());
}
}else{ //your descedants are the combination of your childrens descendants
names = descendants[lc];
nodes[i] = nodes[lc];
for (it = descendants[rc].begin(); it != descendants[rc].end(); it++) { names.insert(*it); }
for (set<int>::iterator itNum = nodes[rc].begin(); itNum != nodes[rc].end(); itNum++) { nodes[i].insert(*itNum); }
nodes[i].insert(i); //you are your own descendant
}
return names;
}
catch(exception& e) {
m->errorOut(e, "IndicatorCommand", "getDescendantList");
exit(1);
}
}
/*****************************************************************/
|
