7 #include "bcftools/bcf.h"
9 extern void ks_introsort_uint32_t(size_t n, uint32_t a[]);
11 #define CALL_ETA 0.03f
13 #define CALL_DEFTHETA 0.83f
17 bcf_callaux_t *bcf_call_init(double theta, int min_baseQ)
20 if (theta <= 0.) theta = CALL_DEFTHETA;
21 bca = calloc(1, sizeof(bcf_callaux_t));
23 bca->openQ = 40; bca->extQ = 20; bca->tandemQ = 70;
24 bca->min_baseQ = min_baseQ;
25 bca->e = errmod_init(1. - theta);
29 void bcf_call_destroy(bcf_callaux_t *bca)
32 errmod_destroy(bca->e);
33 free(bca->bases); free(bca);
36 int bcf_call_glfgen(int _n, const bam_pileup1_t *pl, int ref_base /*4-bit*/, bcf_callaux_t *bca, bcf_callret1_t *r)
39 memset(r, 0, sizeof(bcf_callret1_t));
40 ref4 = bam_nt16_nt4_table[ref_base];
41 if (_n == 0) return -1;
43 // enlarge the bases array if necessary
44 if (bca->max_bases < _n) {
46 kroundup32(bca->max_bases);
47 bca->bases = (uint16_t*)realloc(bca->bases, 2 * bca->max_bases);
49 // fill the bases array
50 memset(r, 0, sizeof(bcf_callret1_t));
51 for (i = n = 0; i < _n; ++i) {
52 const bam_pileup1_t *p = pl + i;
53 int q, b, mapQ, baseQ, is_diff, min_dist;
55 if (p->is_del || (p->b->core.flag&BAM_FUNMAP)) continue; // skip unmapped reads and deleted bases
56 baseQ = q = (int)bam1_qual(p->b)[p->qpos]; // base quality
57 if (q < bca->min_baseQ) continue;
58 mapQ = p->b->core.qual < bca->capQ? p->b->core.qual : bca->capQ;
59 if (q > mapQ) q = mapQ;
62 b = bam1_seqi(bam1_seq(p->b), p->qpos); // base
63 b = bam_nt16_nt4_table[b? b : ref_base]; // b is the 2-bit base
64 bca->bases[n++] = q<<5 | (int)bam1_strand(p->b)<<4 | b;
65 // collect annotations
67 is_diff = (ref4 < 4 && b == ref4)? 0 : 1;
68 ++r->anno[0<<2|is_diff<<1|bam1_strand(p->b)];
69 min_dist = p->b->core.l_qseq - 1 - p->qpos;
70 if (min_dist > p->qpos) min_dist = p->qpos;
71 if (min_dist > CAP_DIST) min_dist = CAP_DIST;
72 r->anno[1<<2|is_diff<<1|0] += baseQ;
73 r->anno[1<<2|is_diff<<1|1] += baseQ * baseQ;
74 r->anno[2<<2|is_diff<<1|0] += mapQ;
75 r->anno[2<<2|is_diff<<1|1] += mapQ * mapQ;
76 r->anno[3<<2|is_diff<<1|0] += min_dist;
77 r->anno[3<<2|is_diff<<1|1] += min_dist * min_dist;
81 errmod_cal(bca->e, n, 5, bca->bases, r->p);
85 int bcf_call_combine(int n, const bcf_callret1_t *calls, int ref_base /*4-bit*/, bcf_call_t *call)
87 int ref4, i, j, qsum[4];
89 call->ori_ref = ref4 = bam_nt16_nt4_table[ref_base];
90 if (ref4 > 4) ref4 = 4;
92 memset(qsum, 0, 4 * sizeof(int));
93 for (i = 0; i < n; ++i)
94 for (j = 0; j < 4; ++j)
95 qsum[j] += calls[i].qsum[j];
96 for (j = 0; j < 4; ++j) qsum[j] = qsum[j] << 2 | j;
97 // find the top 2 alleles
98 for (i = 1; i < 4; ++i) // insertion sort
99 for (j = i; j > 0 && qsum[j] < qsum[j-1]; --j)
100 tmp = qsum[j], qsum[j] = qsum[j-1], qsum[j-1] = tmp;
101 // set the reference allele and alternative allele(s)
102 for (i = 0; i < 5; ++i) call->a[i] = -1;
105 for (i = 3, j = 1; i >= 0; --i) {
106 if ((qsum[i]&3) != ref4) {
107 if (qsum[i]>>2 != 0) call->a[j++] = qsum[i]&3;
111 if (((ref4 < 4 && j < 4) || (ref4 == 4 && j < 5)) && i >= 0)
112 call->unseen = j, call->a[j++] = qsum[i]&3;
117 call->PL = realloc(call->PL, 15 * n);
122 x = call->n_alleles * (call->n_alleles + 1) / 2;
123 // get the possible genotypes
124 for (i = z = 0; i < call->n_alleles; ++i)
125 for (j = i; j < call->n_alleles; ++j)
126 g[z++] = call->a[i] * 5 + call->a[j];
127 for (i = 0; i < n; ++i) {
128 uint8_t *PL = call->PL + x * i;
129 const bcf_callret1_t *r = calls + i;
131 for (j = 0; j < x; ++j)
132 if (min > r->p[g[j]]) min = r->p[g[j]];
134 for (j = 0; j < x; ++j) {
136 y = (int)(r->p[g[j]] - min + .499);
137 if (y > 255) y = 255;
141 call->shift = (int)(sum_min + .499);
143 // combine annotations
144 memset(call->anno, 0, 16 * sizeof(int));
145 for (i = call->depth = 0, tmp = 0; i < n; ++i) {
146 call->depth += calls[i].depth;
147 for (j = 0; j < 16; ++j) call->anno[j] += calls[i].anno[j];
152 int bcf_call2bcf(int tid, int pos, bcf_call_t *bc, bcf1_t *b, bcf_callret1_t *bcr, int is_SP)
154 extern double kt_fisher_exact(int n11, int n12, int n21, int n22, double *_left, double *_right, double *two);
158 b->tid = tid; b->pos = pos; b->qual = 0;
159 s.s = b->str; s.m = b->m_str; s.l = 0;
161 kputc("ACGTN"[bc->ori_ref], &s); kputc('\0', &s);
162 for (i = 1; i < 5; ++i) {
163 if (bc->a[i] < 0) break;
164 if (i > 1) kputc(',', &s);
165 kputc(bc->unseen == i? 'X' : "ACGT"[bc->a[i]], &s);
171 for (i = 0; i < 16; ++i) {
172 if (i) kputc(',', &s);
173 kputw(bc->anno[i], &s);
180 if (is_SP) kputs(":SP", &s);
183 b->m_str = s.m; b->str = s.s; b->l_str = s.l;
185 memcpy(b->gi[0].data, bc->PL, b->gi[0].len * bc->n);
187 uint16_t *dp = (uint16_t*)b->gi[1].data;
188 uint8_t *sp = is_SP? b->gi[2].data : 0;
189 for (i = 0; i < bc->n; ++i) {
190 bcf_callret1_t *p = bcr + i;
191 dp[i] = p->depth < 0xffff? p->depth : 0xffff;
193 if (p->anno[0] + p->anno[1] < 2 || p->anno[2] + p->anno[3] < 2
194 || p->anno[0] + p->anno[2] < 2 || p->anno[1] + p->anno[3] < 2)
198 double left, right, two;
200 kt_fisher_exact(p->anno[0], p->anno[1], p->anno[2], p->anno[3], &left, &right, &two);
201 x = (int)(-4.343 * log(two) + .499);
202 if (x > 255) x = 255;