X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=bam2bcf_indel.c;h=87736c398415ed6b4916ea767186283e43f1d6cb;hb=700d451b57c06a5fc842b24be0d69d4a251c91df;hp=11cd371978e6e654987d35c35dd6465539a22523;hpb=8c15f916dabce475febdf508a9cc0c708c5a7747;p=samtools.git

diff --git a/bam2bcf_indel.c b/bam2bcf_indel.c
index 11cd371..87736c3 100644
--- a/bam2bcf_indel.c
+++ b/bam2bcf_indel.c
@@ -142,35 +142,43 @@ int bcf_call_gap_prep(int n, int *n_plp, bam_pileup1_t **plp, int pos, bcf_calla
 	if (s == n) return -1; // there is no indel at this position.
 	for (s = N = 0; s < n; ++s) N += n_plp[s]; // N is the total number of reads
 	{ // find out how many types of indels are present
-		int m, n_alt = 0, n_tot = 0;
+		int m, n_alt = 0, n_tot = 0, indel_support_ok = 0;
 		uint32_t *aux;
 		aux = calloc(N + 1, 4);
 		m = max_rd_len = 0;
 		aux[m++] = MINUS_CONST; // zero indel is always a type
 		for (s = 0; s < n; ++s) {
+            int na = 0, nt = 0; 
 			for (i = 0; i < n_plp[s]; ++i) {
 				const bam_pileup1_t *p = plp[s] + i;
 				if (rghash == 0 || p->aux == 0) {
-					++n_tot;
+					++nt;
 					if (p->indel != 0) {
-						++n_alt;
+						++na;
 						aux[m++] = MINUS_CONST + p->indel;
 					}
 				}
 				j = bam_cigar2qlen(&p->b->core, bam1_cigar(p->b));
 				if (j > max_rd_len) max_rd_len = j;
 			}
+            if ( !indel_support_ok && na >= bca->min_support && (double)na/nt >= bca->min_frac )
+                indel_support_ok = 1;
+            n_alt += na; 
+            n_tot += nt;
 		}
         // To prevent long stretches of N's to be mistaken for indels (sometimes thousands of bases),
-        //  check the number of N's in the sequence. TODO: this may not be the best place and the best way of doing it
-        int nN=0; for (i=0; i<max_rd_len && ref[i]; i++) if ( ref[i]=='N' ) nN++;
-        if ( nN*2>i ) return -1;
+        //  check the number of N's in the sequence and skip places where half or more reference bases are Ns.
+        int nN=0; for (i=pos; i-pos<max_rd_len && ref[i]; i++) if ( ref[i]=='N' ) nN++;
+        if ( nN*2>i ) { free(aux); return -1; }
 
 		ks_introsort(uint32_t, m, aux);
 		// squeeze out identical types
 		for (i = 1, n_types = 1; i < m; ++i)
 			if (aux[i] != aux[i-1]) ++n_types;
-		if (n_types == 1 || (double)n_alt / n_tot < bca->min_frac || n_alt < bca->min_support) { // then skip
+        // Taking totals makes hard to call rare indels
+        if ( !bca->per_sample_flt ) 
+            indel_support_ok = ( (double)n_alt / n_tot < bca->min_frac || n_alt < bca->min_support ) ? 0 : 1;
+		if ( n_types == 1 || !indel_support_ok ) { // then skip
 			free(aux); return -1;
 		}
 		if (n_types >= 64) {