7 #define MC_AVG_ERR 0.007
8 #define MC_MAX_EM_ITER 16
11 unsigned char seq_nt4_table[256] = {
12 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
13 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
14 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 /*'-'*/, 4, 4,
15 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
16 4, 0, 4, 1, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4,
17 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
18 4, 0, 4, 1, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 4, 4,
19 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
20 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
21 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
22 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
23 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
24 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
25 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
26 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
27 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
30 struct __bcf_p1aux_t {
32 double *q2p, *pdg; // pdg -> P(D|g)
33 double *phi, *CMk; // CMk=\binom{M}{k}
34 double *z, *zswap; // aux for afs
35 double *afs, *afs1; // afs: accumulative AFS; afs1: site posterior distribution
36 const uint8_t *PL; // point to PL
40 void bcf_p1_init_prior(bcf_p1aux_t *ma, int type, double theta)
43 if (type == MC_PTYPE_COND2) {
44 for (i = 0; i <= ma->M; ++i)
45 ma->phi[i] = 2. * (i + 1) / (ma->M + 1) / (ma->M + 2);
46 } else if (type == MC_PTYPE_FLAT) {
47 for (i = 0; i <= ma->M; ++i)
48 ma->phi[i] = 1. / (ma->M + 1);
51 for (i = 0, sum = 0.; i < ma->M; ++i)
52 sum += (ma->phi[i] = theta / (ma->M - i));
53 ma->phi[ma->M] = 1. - sum;
57 bcf_p1aux_t *bcf_p1_init(int n) // FIXME: assuming diploid
61 ma = calloc(1, sizeof(bcf_p1aux_t));
62 ma->n = n; ma->M = 2 * n;
63 ma->q2p = calloc(256, sizeof(double));
64 ma->pdg = calloc(3 * ma->n, sizeof(double));
65 ma->phi = calloc(ma->M + 1, sizeof(double));
66 ma->CMk = calloc(ma->M + 1, sizeof(double));
67 ma->z = calloc(2 * ma->n + 1, sizeof(double));
68 ma->zswap = calloc(2 * ma->n + 1, sizeof(double));
69 ma->afs = calloc(2 * ma->n + 1, sizeof(double));
70 ma->afs1 = calloc(2 * ma->n + 1, sizeof(double));
71 for (i = 0; i < 256; ++i)
72 ma->q2p[i] = pow(10., -i / 10.);
73 for (i = 0; i <= ma->M; ++i)
74 ma->CMk[i] = exp(lgamma(ma->M + 1) - lgamma(i + 1) - lgamma(ma->M - i + 1));
75 bcf_p1_init_prior(ma, MC_PTYPE_FULL, 1e-3); // the simplest prior
79 void bcf_p1_destroy(bcf_p1aux_t *ma)
82 free(ma->q2p); free(ma->pdg);
83 free(ma->phi); free(ma->CMk);
84 free(ma->z); free(ma->zswap);
85 free(ma->afs); free(ma->afs1);
90 #define char2int(s) (((int)s[0])<<8|s[1])
92 static int cal_pdg(const bcf1_t *b, bcf_p1aux_t *ma)
96 p = alloca(b->n_alleles * sizeof(long));
97 memset(p, 0, sizeof(long) * b->n_alleles);
98 for (j = 0; j < ma->n; ++j) {
99 const uint8_t *pi = ma->PL + j * ma->PL_len;
100 double *pdg = ma->pdg + j * 3;
101 pdg[0] = ma->q2p[pi[b->n_alleles]]; pdg[1] = ma->q2p[pi[1]]; pdg[2] = ma->q2p[pi[0]];
102 for (i = k = 0; i < b->n_alleles; ++i) {
104 k += b->n_alleles - i;
107 for (i = 0; i < b->n_alleles; ++i) p[i] = p[i]<<4 | i;
108 for (i = 1; i < b->n_alleles; ++i) // insertion sort
109 for (j = i; j > 0 && p[j] < p[j-1]; --j)
110 tmp = p[j], p[j] = p[j-1], p[j-1] = tmp;
111 for (i = b->n_alleles - 1; i >= 0; --i)
112 if ((p[i]&0xf) == 0) break;
115 // f0 is the reference allele frequency
116 static double mc_freq_iter(double f0, const bcf_p1aux_t *ma)
120 f3[0] = (1.-f0)*(1.-f0); f3[1] = 2.*f0*(1.-f0); f3[2] = f0*f0;
121 for (i = 0, f = 0.; i < ma->n; ++i) {
123 pdg = ma->pdg + i * 3;
124 f += (pdg[1] * f3[1] + 2. * pdg[2] * f3[2])
125 / (pdg[0] * f3[0] + pdg[1] * f3[1] + pdg[2] * f3[2]);
131 int bcf_p1_call_gt(const bcf_p1aux_t *ma, double f0, int k)
134 double max, f3[3], *pdg = ma->pdg + k * 3;
136 f3[0] = (1.-f0)*(1.-f0); f3[1] = 2.*f0*(1.-f0); f3[2] = f0*f0;
137 for (i = 0, sum = 0.; i < 3; ++i)
138 sum += (g[i] = pdg[i] * f3[i]);
139 for (i = 0, max = -1., max_i = 0; i < 3; ++i) {
141 if (g[i] > max) max = g[i], max_i = i;
144 if (max < 1e-308) max = 1e-308;
145 q = (int)(-3.434 * log(max) + .499);
150 static void mc_cal_z(bcf_p1aux_t *ma)
152 double *z[2], *tmp, *pdg;
157 z[0][0] = 1.; z[0][1] = z[0][2] = 0.;
158 for (j = 0; j < ma->n; ++j) {
159 int max = (j + 1) * 2;
161 pdg = ma->pdg + j * 3;
162 p[0] = pdg[0]; p[1] = 2. * pdg[1]; p[2] = pdg[2];
163 z[1][0] = p[0] * z[0][0];
164 z[1][1] = p[0] * z[0][1] + p[1] * z[0][0];
165 for (i = 2; i <= max; ++i)
166 z[1][i] = p[0] * z[0][i] + p[1] * z[0][i-1] + p[2] * z[0][i-2];
167 if (j < ma->n - 1) z[1][max+1] = z[1][max+2] = 0.;
168 tmp = z[0]; z[0] = z[1]; z[1] = tmp;
170 if (z[0] != ma->z) memcpy(ma->z, z[0], sizeof(double) * (ma->M + 1));
173 static double mc_cal_afs(bcf_p1aux_t *ma)
176 long double sum = 0.;
177 memset(ma->afs1, 0, sizeof(double) * (ma->M + 1));
179 for (k = 0, sum = 0.; k <= ma->M; ++k)
180 sum += (long double)ma->phi[k] * ma->z[k] / ma->CMk[k];
181 for (k = 0; k <= ma->M; ++k) {
182 ma->afs1[k] = ma->phi[k] * ma->z[k] / ma->CMk[k] / sum;
183 if (isnan(ma->afs1[k]) || isinf(ma->afs1[k])) return -1.;
185 for (k = 0, sum = 0.; k <= ma->M; ++k) {
186 ma->afs[k] += ma->afs1[k];
187 sum += k * ma->afs1[k];
192 static long double p1_cal_g3(bcf_p1aux_t *p1a, double g[3])
194 long double pd = 0., g2[3];
196 memset(g2, 0, sizeof(long double) * 3);
197 for (k = 0; k < p1a->M; ++k) {
198 double f = (double)k / p1a->M, f3[3], g1[3];
200 g1[0] = g1[1] = g1[2] = 0.;
201 f3[0] = (1. - f) * (1. - f); f3[1] = 2. * f * (1. - f); f3[2] = f * f;
202 for (i = 0; i < p1a->n; ++i) {
203 double *pdg = p1a->pdg + i * 3;
204 double x = pdg[0] * f3[0] + pdg[1] * f3[1] + pdg[2] * f3[2];
206 g1[0] += pdg[0] * f3[0] / x;
207 g1[1] += pdg[1] * f3[1] / x;
208 g1[2] += pdg[2] * f3[2] / x;
210 pd += p1a->phi[k] * z;
211 for (i = 0; i < 3; ++i)
212 g2[i] += p1a->phi[k] * z * g1[i];
214 for (i = 0; i < 3; ++i) g[i] = g2[i] / pd;
218 int bcf_p1_cal(bcf1_t *b, bcf_p1aux_t *ma, bcf_p1rst_t *rst)
221 long double sum = 0.;
223 for (i = 0; i < b->n_gi; ++i) {
224 if (b->gi[i].fmt == char2int("PL")) {
225 ma->PL = (uint8_t*)b->gi[i].data;
226 ma->PL_len = b->gi[i].len;
230 if (b->n_alleles < 2) return -1; // FIXME: find a better solution
232 rst->rank0 = cal_pdg(b, ma);
233 rst->f_exp = mc_cal_afs(ma);
234 rst->p_ref = ma->afs1[ma->M];
235 // calculate f_flat and f_em
236 for (k = 0, sum = 0.; k <= ma->M; ++k)
237 sum += (long double)ma->z[k] / ma->CMk[k];
239 for (k = 0; k <= ma->M; ++k) {
240 double p = ma->z[k] / ma->CMk[k] / sum;
241 rst->f_flat += k * p;
243 rst->f_flat /= ma->M;
245 double flast = rst->f_flat;
246 for (i = 0; i < MC_MAX_EM_ITER; ++i) {
247 rst->f_em = mc_freq_iter(flast, ma);
248 if (fabs(rst->f_em - flast) < MC_EM_EPS) break;
252 p1_cal_g3(ma, rst->g);
256 void bcf_p1_dump_afs(bcf_p1aux_t *ma)
259 fprintf(stderr, "[afs]");
260 for (k = 0; k <= ma->M; ++k)
261 fprintf(stderr, " %d:%.3lf", k, ma->afs[ma->M - k]);
262 fprintf(stderr, "\n");
263 memset(ma->afs, 0, sizeof(double) * (ma->M + 1));