vector<data_struct> all; all.clear();
myQuery = *query;
+
for (int i = 0; i < refSeqs.size(); i++) {
for (int j = i+1; j < refSeqs.size(); j++) {
//are we within 10 points of the bootstrap cutoff?
- if ((divs[k].bsMax >= (minBS-10)) && (iters < 1000)) {
- bootstrapSNPS(snpsLeft, snpsRight, BS_A, BS_B, 1000);
-
- if (m->control_pressed) { delete q; delete leftParent; delete rightParent; return "no"; }
-
- divs[k].bsa = BS_A;
- divs[k].bsb = BS_B;
- divs[k].bsMax = max(BS_A, BS_B);
- divs[k].chimeraMax = max(divs[k].qla_qrb, divs[k].qlb_qra);
- }
+// if ((divs[k].bsMax >= (minBS-10)) && (iters < 1000)) {
+// bootstrapSNPS(snpsLeft, snpsRight, BS_A, BS_B, 1000);
+//
+// if (m->control_pressed) { delete q; delete leftParent; delete rightParent; return "no"; }
+//
+// divs[k].bsa = BS_A;
+// divs[k].bsb = BS_B;
+// divs[k].bsMax = max(BS_A, BS_B);
+// divs[k].chimeraMax = max(divs[k].qla_qrb, divs[k].qlb_qra);
+// }
//so results reflect orignal alignment
divs[k].winLStart = spots[divs[k].winLStart];
float QRA = computePercentID(query, parentA, breakpoint+1, length);
float LAB = computePercentID(parentA, parentB, 0, breakpoint);
- float RAB = computePercentID(parentA, parentB, breakpoint+1, length);
-
+ float RAB = computePercentID(parentA, parentB, breakpoint+1, length);
+
float AB = ((LAB*leftLength) + (RAB*rightLength)) / (float) length;
float QA = ((QLA*leftLength) + (QRA*rightLength)) / (float) length;
float QB = ((QLB*leftLength) + (QRB*rightLength)) / (float) length;
float divR_QLA_QRB = min((QLA_QRB/QA), (QLA_QRB/QB));
float divR_QLB_QRA = min((QLB_QRA/QA), (QLB_QRA/QB));
+
//cout << q->getName() << '\t';
//cout << pA->getName() << '\t';
//cout << pB->getName() << '\t';
}//if
}//for
+
return data;
}