11 KHASH_SET_INIT_INT64(set64)
14 KSTREAM_INIT(gzFile, gzread, 16384)
24 #define VC_KEEPALT 256
25 #define VC_ACGT_ONLY 512
29 int flag, prior_type, n1;
30 char *fn_list, *prior_file;
34 khash_t(set64) *bcf_load_pos(const char *fn, bcf_hdr_t *_h)
39 int ret, dret, lineno = 1;
41 khash_t(set64) *hash = 0;
43 hash = kh_init(set64);
44 str2id = bcf_build_refhash(_h);
45 str = calloc(1, sizeof(kstring_t));
46 fp = strcmp(fn, "-")? gzopen(fn, "r") : gzdopen(fileno(stdin), "r");
48 while (ks_getuntil(ks, 0, str, &dret) >= 0) {
49 int tid = bcf_str2id(str2id, str->s);
50 if (tid >= 0 && dret != '\n') {
51 if (ks_getuntil(ks, 0, str, &dret) >= 0) {
52 uint64_t x = (uint64_t)tid<<32 | (atoi(str->s) - 1);
53 kh_put(set64, hash, x, &ret);
55 } else fprintf(stderr, "[%s] %s is not a reference name (line %d).\n", __func__, str->s, lineno);
56 if (dret != '\n') while ((dret = ks_getc(ks)) > 0 && dret != '\n');
60 bcf_str2id_destroy(str2id);
63 free(str->s); free(str);
67 static double test_hwe(const double g[3])
69 extern double kf_gammaq(double p, double x);
70 double fexp, chi2, f[3], n;
72 n = g[0] + g[1] + g[2];
73 fexp = (2. * g[2] + g[1]) / (2. * n);
74 if (fexp > 1. - 1e-10) fexp = 1. - 1e-10;
75 if (fexp < 1e-10) fexp = 1e-10;
76 f[0] = n * (1. - fexp) * (1. - fexp);
77 f[1] = n * 2. * fexp * (1. - fexp);
78 f[2] = n * fexp * fexp;
79 for (i = 0, chi2 = 0.; i < 3; ++i)
80 chi2 += (g[i] - f[i]) * (g[i] - f[i]) / f[i];
81 return kf_gammaq(.5, chi2 / 2.);
86 int mq, depth, is_tested, d[4];
89 static double ttest(int n1, int n2, int a[4])
91 extern double kf_betai(double a, double b, double x);
93 if (n1 == 0 || n2 == 0 || n1 + n2 < 3) return 1.0;
94 u1 = (double)a[0] / n1; u2 = (double)a[2] / n2;
95 if (u1 <= u2) return 1.;
96 t = (u1 - u2) / sqrt(((a[1] - n1 * u1 * u1) + (a[3] - n2 * u2 * u2)) / (n1 + n2 - 2) * (1./n1 + 1./n2));
98 // printf("%d,%d,%d,%d,%lf,%lf,%lf\n", a[0], a[1], a[2], a[3], t, u1, u2);
99 return t < 0.? 1. : .5 * kf_betai(.5*v, .5, v/(v+t*t));
102 static int test16_core(int anno[16], anno16_t *a)
104 extern double kt_fisher_exact(int n11, int n12, int n21, int n22, double *_left, double *_right, double *two);
107 a->p[0] = a->p[1] = a->p[2] = a->p[3] = 1.;
108 memcpy(a->d, anno, 4 * sizeof(int));
109 a->depth = anno[0] + anno[1] + anno[2] + anno[3];
110 a->is_tested = (anno[0] + anno[1] > 0 && anno[2] + anno[3] > 0);
111 if (a->depth == 0) return -1;
112 a->mq = (int)(sqrt((anno[9] + anno[11]) / a->depth) + .499);
113 kt_fisher_exact(anno[0], anno[1], anno[2], anno[3], &left, &right, &a->p[0]);
114 for (i = 1; i < 4; ++i)
115 a->p[i] = ttest(anno[0] + anno[1], anno[2] + anno[3], anno+4*i);
119 static int test16(bcf1_t *b, anno16_t *a)
123 a->p[0] = a->p[1] = a->p[2] = a->p[3] = 1.;
124 a->d[0] = a->d[1] = a->d[2] = a->d[3] = 0.;
125 a->mq = a->depth = a->is_tested = 0;
126 if ((p = strstr(b->info, "I16=")) == 0) return -1;
128 for (i = 0; i < 16; ++i) {
129 anno[i] = strtol(p, &p, 10);
130 if (anno[i] == 0 && (errno == EINVAL || errno == ERANGE)) return -2;
133 return test16_core(anno, a);
136 static void rm_info(bcf1_t *b, const char *key)
139 if ((p = strstr(b->info, key)) == 0) return;
140 for (q = p; *q && *q != ';'; ++q);
141 if (p > b->info && *(p-1) == ';') --p;
142 memmove(p, q, b->l_str - (q - b->str));
147 static int update_bcf1(int n_smpl, bcf1_t *b, const bcf_p1aux_t *pa, const bcf_p1rst_t *pr, double pref, int flag)
150 int is_var = (pr->p_ref < pref);
151 double p_hwe, r = is_var? pr->p_ref : 1. - pr->p_ref;
154 p_hwe = pr->g[0] >= 0.? test_hwe(pr->g) : 1.0; // only do HWE g[] is calculated
158 memset(&s, 0, sizeof(kstring_t));
159 kputc('\0', &s); kputs(b->ref, &s); kputc('\0', &s);
160 kputs(b->alt, &s); kputc('\0', &s); kputc('\0', &s);
162 if (b->info[0]) kputc(';', &s);
163 ksprintf(&s, "AF1=%.3lf;AFE=%.3lf", 1.-pr->f_em, 1.-pr->f_exp);
164 ksprintf(&s, ";DP4=%d,%d,%d,%d;MQ=%d", a.d[0], a.d[1], a.d[2], a.d[3], a.mq);
166 if (pr->pc[0] >= 0.) ksprintf(&s, ";PC4=%lg,%lg,%lg,%lg", pr->pc[0], pr->pc[1], pr->pc[2], pr->pc[3]);
167 ksprintf(&s, ";PV4=%.2lg,%.2lg,%.2lg,%.2lg", a.p[0], a.p[1], a.p[2], a.p[3]);
169 if (pr->g[0] >= 0. && p_hwe <= .2)
170 ksprintf(&s, ";GC=%.2lf,%.2lf,%.2lf;HWE=%.3lf", pr->g[2], pr->g[1], pr->g[0], p_hwe);
172 kputs(b->fmt, &s); kputc('\0', &s);
174 b->m_str = s.m; b->l_str = s.l; b->str = s.s;
175 b->qual = r < 1e-100? 99 : -4.343 * log(r);
176 if (b->qual > 99) b->qual = 99;
178 if (!is_var) bcf_shrink_alt(b, 1);
179 else if (!(flag&VC_KEEPALT))
180 bcf_shrink_alt(b, pr->rank0 < 2? 2 : pr->rank0+1);
184 int bcfview(int argc, char *argv[])
186 extern int bcf_2qcall(bcf_hdr_t *h, bcf1_t *b);
187 bcf_t *bp, *bout = 0;
190 uint64_t n_processed = 0;
195 char moder[4], modew[4];
196 khash_t(set64) *hash = 0;
198 tid = begin = end = -1;
199 memset(&vc, 0, sizeof(viewconf_t));
200 vc.prior_type = vc.n1 = -1; vc.theta = 1e-3; vc.pref = 0.5;
201 while ((c = getopt(argc, argv, "N1:l:cHAGvLbSuP:t:p:Q")) >= 0) {
203 case '1': vc.n1 = atoi(optarg); break;
204 case 'l': vc.fn_list = strdup(optarg); break;
205 case 'N': vc.flag |= VC_ACGT_ONLY; break;
206 case 'G': vc.flag |= VC_NO_GENO; break;
207 case 'L': vc.flag |= VC_NO_PL; break;
208 case 'A': vc.flag |= VC_KEEPALT; break;
209 case 'b': vc.flag |= VC_BCFOUT; break;
210 case 'S': vc.flag |= VC_VCFIN; break;
211 case 'c': vc.flag |= VC_CALL; break;
212 case 'v': vc.flag |= VC_VARONLY; break;
213 case 'u': vc.flag |= VC_UNCOMP | VC_BCFOUT; break;
214 case 'H': vc.flag |= VC_HWE; break;
215 case 't': vc.theta = atof(optarg); break;
216 case 'p': vc.pref = atof(optarg); break;
217 case 'Q': vc.flag |= VC_QCALL; break;
219 if (strcmp(optarg, "full") == 0) vc.prior_type = MC_PTYPE_FULL;
220 else if (strcmp(optarg, "cond2") == 0) vc.prior_type = MC_PTYPE_COND2;
221 else if (strcmp(optarg, "flat") == 0) vc.prior_type = MC_PTYPE_FLAT;
222 else vc.prior_file = strdup(optarg);
226 if (argc == optind) {
227 fprintf(stderr, "\n");
228 fprintf(stderr, "Usage: bcftools view [options] <in.bcf> [reg]\n\n");
229 fprintf(stderr, "Options: -c SNP calling\n");
230 fprintf(stderr, " -b output BCF instead of VCF\n");
231 fprintf(stderr, " -u uncompressed BCF output\n");
232 fprintf(stderr, " -S input is VCF\n");
233 fprintf(stderr, " -A keep all possible alternate alleles at variant sites\n");
234 fprintf(stderr, " -G suppress all individual genotype information\n");
235 fprintf(stderr, " -L discard the PL genotype field\n");
236 fprintf(stderr, " -H perform Hardy-Weinberg test (slower)\n");
237 fprintf(stderr, " -v output potential variant sites only\n");
238 fprintf(stderr, " -N skip sites where REF is not A/C/G/T\n");
239 fprintf(stderr, " -Q output the QCALL likelihood format\n");
240 fprintf(stderr, " -1 INT number of group-1 samples [0]\n");
241 fprintf(stderr, " -l FILE list of sites to output [all sites]\n");
242 fprintf(stderr, " -t FLOAT scaled mutation rate [%.4lg]\n", vc.theta);
243 fprintf(stderr, " -p FLOAT variant if P(ref|D)<FLOAT [%.3lg]\n", vc.pref);
244 fprintf(stderr, " -P STR type of prior: full, cond2, flat [full]\n");
245 fprintf(stderr, "\n");
249 b = calloc(1, sizeof(bcf1_t));
251 if (!(vc.flag & VC_VCFIN)) strcat(moder, "b");
253 if (vc.flag & VC_BCFOUT) strcat(modew, "b");
254 if (vc.flag & VC_UNCOMP) strcat(modew, "u");
255 bp = vcf_open(argv[optind], moder);
256 h = vcf_hdr_read(bp);
257 bout = vcf_open("-", modew);
258 if (!(vc.flag & VC_QCALL)) vcf_hdr_write(bout, h);
259 if (vc.flag & VC_CALL) {
260 p1 = bcf_p1_init(h->n_smpl);
262 if (bcf_p1_read_prior(p1, vc.prior_file) < 0) {
263 fprintf(stderr, "[%s] fail to read the prior AFS.\n", __func__);
266 } else bcf_p1_init_prior(p1, vc.prior_type, vc.theta);
268 bcf_p1_set_n1(p1, vc.n1);
269 bcf_p1_init_subprior(p1, vc.prior_type, vc.theta);
272 if (vc.fn_list) hash = bcf_load_pos(vc.fn_list, h);
273 if (optind + 1 < argc && !(vc.flag&VC_VCFIN)) {
274 void *str2id = bcf_build_refhash(h);
275 if (bcf_parse_region(str2id, argv[optind+1], &tid, &begin, &end) >= 0) {
277 idx = bcf_idx_load(argv[optind]);
280 off = bcf_idx_query(idx, tid, begin);
282 fprintf(stderr, "[%s] no records in the query region.\n", __func__);
283 return 1; // FIXME: a lot of memory leaks...
285 bgzf_seek(bp->fp, off, SEEK_SET);
286 bcf_idx_destroy(idx);
290 while (vcf_read(bp, h, b) > 0) {
291 if (vc.flag & VC_ACGT_ONLY) {
293 if (b->ref[0] == 0 || b->ref[1] != 0) continue;
294 x = toupper(b->ref[0]);
295 if (x != 'A' && x != 'C' && x != 'G' && x != 'T') continue;
298 uint64_t x = (uint64_t)b->tid<<32 | b->pos;
299 khint_t k = kh_get(set64, hash, x);
300 if (kh_size(hash) == 0) break;
301 if (k == kh_end(hash)) continue;
302 kh_del(set64, hash, k);
305 int l = strlen(b->ref);
306 l = b->pos + (l > 0? l : 1);
307 if (b->tid != tid || b->pos >= end) break;
308 if (!(l > begin && end > b->pos)) continue;
311 if (vc.flag & VC_QCALL) { // output QCALL format; STOP here
315 if (vc.flag & VC_CALL) { // call variants
318 bcf_p1_cal(b, p1, &pr); // pr.g[3] is not calculated here
319 if (vc.flag&VC_HWE) bcf_p1_cal_g3(p1, pr.g);
320 if (n_processed % 100000 == 0) {
321 fprintf(stderr, "[%s] %ld sites processed.\n", __func__, (long)n_processed);
324 if (pr.p_ref >= vc.pref && (vc.flag & VC_VARONLY)) continue;
325 update_bcf1(h->n_smpl, b, p1, &pr, vc.pref, vc.flag);
327 if (vc.flag & VC_NO_GENO) { // do not output GENO fields
331 vcf_write(bout, h, b);
333 if (vc.prior_file) free(vc.prior_file);
334 if (vc.flag & VC_CALL) bcf_p1_dump_afs(p1);
337 vcf_close(bp); vcf_close(bout);
338 if (hash) kh_destroy(set64, hash);
339 if (vc.fn_list) free(vc.fn_list);
340 if (p1) bcf_p1_destroy(p1);