- /*vector<data_struct> newAll;
-
- for (int i = 0; i < all.size(); i++) {
-
- //are we within 10 points of the bootstrap cutoff?
- if (all[i].bsMax >= (minBS-10)) {
-
- vector<snps> snpsLeft = getSNPS(all[i].parentA.getAligned(), all[i].querySeq.getAligned(), all[i].parentB.getAligned(), all[i].winLStart, all[i].winLEnd);
- vector<snps> snpsRight = getSNPS(all[i].parentA.getAligned(), all[i].querySeq.getAligned(), all[i].parentB.getAligned(), all[i].winRStart, all[i].winREnd);
-
- if (m->control_pressed) { return "no"; }
-
- int numSNPSLeft = snpsLeft.size();
- int numSNPSRight = snpsRight.size();
-
- //require at least 4 SNPs on each side of the break
- if ((numSNPSLeft >= 4) && (numSNPSRight >= 4)) {
- float BS_A, BS_B;
- bootstrapSNPS(snpsLeft, snpsRight, BS_A, BS_B, 1000);
-
- if (m->control_pressed) { return "no"; }
- cout << i << '\t' << BS_A << '\t' << BS_B << endl;
- all[i].bsa = BS_A;
- all[i].bsb = BS_B;
- all[i].bsMax = max(BS_A, BS_B);
- all[i].chimeraMax = max(all[i].qla_qrb, all[i].qlb_qra);