forked from samtools/bcftools
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathvcfgtcheck.c
1284 lines (1215 loc) · 52.7 KB
/
vcfgtcheck.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* vcfgtcheck.c -- Check sample identity.
Copyright (C) 2013-2023 Genome Research Ltd.
Author: Petr Danecek <[email protected]>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE. */
#include <stdio.h>
#include <stdarg.h>
#include <unistd.h>
#include <getopt.h>
#include <assert.h>
#include <ctype.h>
#include <string.h>
#include <strings.h>
#include <errno.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <math.h>
#include <htslib/vcf.h>
#include <htslib/synced_bcf_reader.h>
#include <htslib/vcfutils.h>
#include <htslib/kbitset.h>
#include <htslib/hts_os.h>
#include <inttypes.h>
#include <sys/time.h>
#include "bcftools.h"
#include "extsort.h"
//#include "hclust.h"
typedef struct
{
int iqry, igt;
}
pair_t;
typedef struct
{
bcf_srs_t *files; // first reader is the query VCF - single sample normally or multi-sample for cross-check
bcf_hdr_t *gt_hdr, *qry_hdr; // VCF with genotypes to compare against and the query VCF
char *cwd, **argv, *gt_samples, *qry_samples, *regions, *targets, *qry_fname, *gt_fname, *pair_samples;
int argc, gt_samples_is_file, qry_samples_is_file, regions_is_file, targets_is_file, pair_samples_is_file;
int regions_overlap, targets_overlap;
int qry_use_GT,gt_use_GT, nqry_smpl,ngt_smpl, *qry_smpl,*gt_smpl;
int nused[2][2];
double *pdiff, *qry_prob, *gt_prob;
uint32_t *ndiff,*ncnt,ncmp, npairs;
int32_t *qry_arr,*gt_arr, nqry_arr,ngt_arr;
uint8_t *qry_dsg, *gt_dsg;
pair_t *pairs;
double *hwe_prob, dsg2prob[8][3], pl2prob[256];
double min_inter_err, max_intra_err;
int all_sites, hom_only, ntop, cross_check, calc_hwe_prob, sort_by_hwe, dry_run, use_PLs;
FILE *fp;
unsigned int nskip_no_match, nskip_not_ba, nskip_mono, nskip_no_data, nskip_dip_GT, nskip_dip_PL;
// for --distinctive-sites
double distinctive_sites;
kbitset_t *kbs_diff;
size_t diff_sites_size;
extsort_t *es;
char *es_tmp_prefix, *es_max_mem;
}
args_t;
static void set_cwd(args_t *args)
{
int i;
char *buf;
size_t nbuf = 500;
args->cwd = (char*) malloc(sizeof(char)*nbuf);
for (i=0; i<5; i++)
{
if ( (buf = getcwd(args->cwd, nbuf)) ) break;
nbuf *= 2;
args->cwd = (char*) realloc(args->cwd, sizeof(char)*nbuf);
}
assert(buf);
}
static void print_header(args_t *args, FILE *fp)
{
fprintf(fp, "# This file was produced by bcftools (%s+htslib-%s), the command line was:\n", bcftools_version(), hts_version());
fprintf(fp, "# \t bcftools %s ", args->argv[0]);
int i;
for (i=1; i<args->argc; i++)
fprintf(fp, " %s",args->argv[i]);
fprintf(fp, "\n# and the working directory was:\n");
fprintf(fp, "# \t %s\n#\n", args->cwd);
}
static int cmp_int(const void *_a, const void *_b)
{
int a = *((int*)_a);
int b = *((int*)_b);
if ( a < b ) return -1;
if ( a > b ) return 1;
return 0;
}
static int cmp_pair(const void *_a, const void *_b)
{
pair_t *a = (pair_t*)_a;
pair_t *b = (pair_t*)_b;
if ( a->iqry < b->iqry ) return -1;
if ( a->iqry > b->iqry ) return 1;
if ( a->igt < b->igt ) return -1;
if ( a->igt > b->igt ) return 1;
return 0;
}
typedef struct
{
uint32_t ndiff,rid,pos,rand; // rand is to shuffle sites with the same ndiff from across all chromosoms
unsigned long kbs_dat[1];
}
diff_sites_t;
#if DBG
static void diff_sites_debug_print(args_t *args, diff_sites_t *ds)
{
int i;
memcpy(args->kbs_diff->b,ds->kbs_dat,args->kbs_diff->n*sizeof(unsigned long));
fprintf(stderr,"%s:%d\t%d\t",bcf_hdr_id2name(args->qry_hdr,ds->rid),ds->pos+1,ds->ndiff);
for (i=0; i<args->npairs; i++) fprintf(stderr,"%d",kbs_exists(args->kbs_diff,i)?1:0);
fprintf(stderr,"\n");
}
#endif
static int diff_sites_cmp(const void *aptr, const void *bptr)
{
diff_sites_t *a = *((diff_sites_t**)aptr);
diff_sites_t *b = *((diff_sites_t**)bptr);
if ( a->ndiff < b->ndiff ) return 1; // descending order
if ( a->ndiff > b->ndiff ) return -1;
if ( a->rand < b->rand ) return -1;
if ( a->rand > b->rand ) return 1;
return 0;
}
static void diff_sites_init(args_t *args)
{
int nsites = args->distinctive_sites<=1 ? args->npairs*args->distinctive_sites : args->distinctive_sites;
if ( nsites<=0 ) error("The value for --distinctive-sites was set too low: %d\n",nsites);
if ( nsites > args->npairs )
{
fprintf(stderr,"Warning: The value for --distinctive-sites is bigger than is the number of pairs, all discordant sites be printed.\n");
nsites = args->npairs;
args->distinctive_sites = args->npairs + 1;
}
else
args->distinctive_sites = nsites;
args->kbs_diff = kbs_init(args->npairs);
size_t n = (args->npairs + KBS_ELTBITS-1) / KBS_ELTBITS;
assert( n==args->kbs_diff->n );
args->diff_sites_size = sizeof(diff_sites_t) + (n-1)*sizeof(unsigned long);
args->es = extsort_alloc();
extsort_set_opt(args->es,size_t,DAT_SIZE,args->diff_sites_size);
extsort_set_opt(args->es,const char*,TMP_PREFIX,args->es_tmp_prefix);
extsort_set_opt(args->es,const char*,MAX_MEM,args->es_max_mem);
extsort_set_opt(args->es,extsort_cmp_f,FUNC_CMP,diff_sites_cmp);
extsort_init(args->es);
}
static void diff_sites_destroy(args_t *args)
{
kbs_destroy(args->kbs_diff);
extsort_destroy(args->es);
}
static inline void diff_sites_reset(args_t *args)
{
kbs_clear(args->kbs_diff);
}
static inline void diff_sites_push(args_t *args, int ndiff, int rid, int pos)
{
diff_sites_t *dat = (diff_sites_t*) malloc(args->diff_sites_size);
memset(dat,0,sizeof(*dat)); // for debugging: prevent warnings about uninitialized memory coming from struct padding (not needed after rand added)
dat->ndiff = ndiff;
dat->rid = rid;
dat->pos = pos;
dat->rand = hts_lrand48();
memcpy(dat->kbs_dat,args->kbs_diff->b,args->kbs_diff->n*sizeof(unsigned long));
extsort_push(args->es,dat);
}
static inline int diff_sites_shift(args_t *args, int *ndiff, int *rid, int *pos)
{
diff_sites_t *dat = (diff_sites_t*) extsort_shift(args->es);
if ( !dat ) return 0;
*ndiff = dat->ndiff;
*rid = dat->rid;
*pos = dat->pos;
memcpy(args->kbs_diff->b,dat->kbs_dat,args->kbs_diff->n*sizeof(unsigned long));
return 1;
}
static void init_samples(char *list, int list_is_file, int **smpl, int *nsmpl, bcf_hdr_t *hdr, char *vcf_fname)
{
int i;
if ( !strcmp(list,"-") )
{
*nsmpl = bcf_hdr_nsamples(hdr);
*smpl = (int*) malloc(sizeof(**smpl)*(*nsmpl));
for (i=0; i<*nsmpl; i++) (*smpl)[i] = i;
return;
}
char **tmp = hts_readlist(list, list_is_file, nsmpl);
if ( !tmp || !*nsmpl ) error("Failed to parse %s\n", list);
*smpl = (int*) malloc(sizeof(**smpl)*(*nsmpl));
for (i=0; i<*nsmpl; i++)
{
int idx = bcf_hdr_id2int(hdr, BCF_DT_SAMPLE, tmp[i]);
if ( idx<0 ) error("No such sample in %s: [%s]\n",vcf_fname,tmp[i]);
(*smpl)[i] = idx;
free(tmp[i]);
}
free(tmp);
qsort(*smpl,*nsmpl,sizeof(**smpl),cmp_int);
// check for duplicates
for (i=1; i<*nsmpl; i++)
if ( (*smpl)[i-1]==(*smpl)[i] )
error("Error: the sample \"%s\" is listed twice in %s\n", hdr->samples[(*smpl)[i]],list);
}
static void init_data(args_t *args)
{
hts_srand48(0);
args->files = bcf_sr_init();
if ( args->regions )
{
bcf_sr_set_opt(args->files,BCF_SR_REGIONS_OVERLAP,args->regions_overlap);
if ( bcf_sr_set_regions(args->files, args->regions, args->regions_is_file)<0 ) error("Failed to read the regions: %s\n", args->regions);
}
if ( args->targets )
{
bcf_sr_set_opt(args->files,BCF_SR_TARGETS_OVERLAP,args->targets_overlap);
if ( bcf_sr_set_targets(args->files, args->targets, args->targets_is_file, 0)<0 ) error("Failed to read the targets: %s\n", args->targets);
}
if ( args->gt_fname ) bcf_sr_set_opt(args->files, BCF_SR_REQUIRE_IDX);
if ( !bcf_sr_add_reader(args->files,args->qry_fname) ) error("Failed to open %s: %s\n", args->qry_fname,bcf_sr_strerror(args->files->errnum));
if ( args->gt_fname && !bcf_sr_add_reader(args->files, args->gt_fname) )
error("Failed to read from %s: %s\n", !strcmp("-",args->gt_fname)?"standard input":args->gt_fname,bcf_sr_strerror(args->files->errnum));
args->qry_hdr = bcf_sr_get_header(args->files,0);
if ( !bcf_hdr_nsamples(args->qry_hdr) ) error("No samples in %s?\n", args->qry_fname);
if ( args->gt_fname )
{
args->gt_hdr = bcf_sr_get_header(args->files,1);
if ( !bcf_hdr_nsamples(args->gt_hdr) ) error("No samples in %s?\n", args->gt_fname);
}
// Determine whether GT or PL will be used
if ( args->qry_use_GT==-1 ) // not set by -u, qry uses PL by default
{
if ( bcf_hdr_id2int(args->qry_hdr,BCF_DT_ID,"PL")>=0 )
args->qry_use_GT = 0;
else if ( bcf_hdr_id2int(args->qry_hdr,BCF_DT_ID,"GT")>=0 )
args->qry_use_GT = 1;
else
error("[E::%s] Neither PL nor GT tag is present in the header of %s\n", __func__, args->qry_fname);
}
else if ( args->qry_use_GT==1 )
{
if ( bcf_hdr_id2int(args->qry_hdr,BCF_DT_ID,"GT")<0 )
error("[E::%s] The GT tag is not present in the header of %s\n", __func__, args->qry_fname);
}
else if ( bcf_hdr_id2int(args->qry_hdr,BCF_DT_ID,"PL")<0 )
error("[E::%s] The PL tag is not present in the header of %s\n", __func__, args->qry_fname);
if ( args->gt_hdr )
{
if ( args->gt_use_GT==-1 ) // not set by -u, gt uses GT by default
{
if ( bcf_hdr_id2int(args->gt_hdr,BCF_DT_ID,"GT")>=0 )
args->gt_use_GT = 1;
else if ( bcf_hdr_id2int(args->gt_hdr,BCF_DT_ID,"PL")>=0 )
args->gt_use_GT = 0;
else
error("[E::%s] Neither PL nor GT tag is present in the header of %s\n", __func__, args->gt_fname);
}
else if ( args->gt_use_GT==1 )
{
if ( bcf_hdr_id2int(args->gt_hdr,BCF_DT_ID,"GT")<0 )
error("[E::%s] The GT tag is not present in the header of %s\n", __func__, args->gt_fname);
}
else if ( bcf_hdr_id2int(args->gt_hdr,BCF_DT_ID,"PL")<0 )
error("[E::%s] The PL tag is not present in the header of %s\n", __func__, args->gt_fname);
}
else
args->gt_use_GT = args->qry_use_GT;
// Prepare samples
int i,j;
args->nqry_smpl = bcf_hdr_nsamples(args->qry_hdr);
if ( args->qry_samples )
{
init_samples(args->qry_samples, args->qry_samples_is_file, &args->qry_smpl, &args->nqry_smpl, args->qry_hdr, args->qry_fname);
}
if ( args->gt_samples )
{
init_samples(args->gt_samples, args->gt_samples_is_file, &args->gt_smpl, &args->ngt_smpl,
args->gt_hdr ? args->gt_hdr : args->qry_hdr,
args->gt_fname ? args->gt_fname : args->qry_fname);
}
else if ( args->pair_samples )
{
int npairs;
char **tmp = hts_readlist(args->pair_samples, args->pair_samples_is_file, &npairs);
if ( !tmp || !npairs ) error("Failed to parse %s\n", args->pair_samples);
if ( !args->pair_samples_is_file && npairs%2 ) error("Expected even number of comma-delimited samples with -p\n");
args->npairs = args->pair_samples_is_file ? npairs : npairs/2;
args->pairs = (pair_t*) calloc(args->npairs,sizeof(*args->pairs));
if ( !args->pair_samples_is_file )
{
for (i=0; i<args->npairs; i++)
{
args->pairs[i].iqry = bcf_hdr_id2int(args->qry_hdr, BCF_DT_SAMPLE, tmp[2*i]);
args->pairs[i].igt = bcf_hdr_id2int(args->gt_hdr?args->gt_hdr:args->qry_hdr, BCF_DT_SAMPLE, tmp[2*i+1]);
if ( args->pairs[i].iqry < 0 ) error("No such sample in %s: [%s]\n",args->qry_fname,tmp[2*i]);
if ( args->pairs[i].igt < 0 ) error("No such sample in %s: [%s]\n",args->gt_fname?args->gt_fname:args->qry_fname,tmp[2*i+1]);
free(tmp[2*i]);
free(tmp[2*i+1]);
}
}
else
{
for (i=0; i<args->npairs; i++)
{
char *ptr = tmp[i];
while ( *ptr && !isspace(*ptr) ) ptr++;
if ( !*ptr ) error("Could not parse %s: %s\n",args->pair_samples,tmp[i]);
*ptr = 0;
args->pairs[i].iqry = bcf_hdr_id2int(args->qry_hdr, BCF_DT_SAMPLE, tmp[i]);
if ( args->pairs[i].iqry < 0 ) error("No such sample in %s: [%s]\n",args->qry_fname,tmp[i]);
ptr++;
while ( *ptr && isspace(*ptr) ) ptr++;
args->pairs[i].igt = bcf_hdr_id2int(args->gt_hdr?args->gt_hdr:args->qry_hdr, BCF_DT_SAMPLE, ptr);
if ( args->pairs[i].igt < 0 ) error("No such sample in %s: [%s]\n",args->gt_fname?args->gt_fname:args->qry_fname,ptr);
free(tmp[i]);
}
}
free(tmp);
qsort(args->pairs,args->npairs,sizeof(*args->pairs),cmp_pair);
}
else if ( args->gt_hdr )
args->ngt_smpl = bcf_hdr_nsamples(args->gt_hdr);
if ( !args->ngt_smpl )
{
args->ngt_smpl = args->nqry_smpl;
args->gt_smpl = args->qry_smpl;
args->cross_check = 1;
}
// The data arrays
if ( !args->npairs ) args->npairs = args->cross_check ? args->nqry_smpl*(args->nqry_smpl+1)/2 : args->ngt_smpl*args->nqry_smpl;
if ( !args->pair_samples )
{
args->qry_dsg = (uint8_t*) malloc(args->nqry_smpl);
args->gt_dsg = args->cross_check ? args->qry_dsg : (uint8_t*) malloc(args->ngt_smpl);
}
if ( args->use_PLs )
{
args->pdiff = (double*) calloc(args->npairs,sizeof(*args->pdiff)); // log probability of pair samples being the same
args->qry_prob = (double*) malloc(3*args->nqry_smpl*sizeof(*args->qry_prob));
args->gt_prob = args->cross_check ? args->qry_prob : (double*) malloc(3*args->ngt_smpl*sizeof(*args->gt_prob));
// dsg2prob: the first index is bitmask of 8 possible dsg combinations (only 1<<0,1<<2,1<<3 are set, accessing
// anything else indicated an error, this is just to reuse gt_to_dsg()); the second index are the corresponding
// probabilities of 0/0, 0/1, and 1/1 genotypes
for (i=0; i<8; i++)
for (j=0; j<3; j++)
args->dsg2prob[i][j] = HUGE_VAL;
args->dsg2prob[1][0] = -log(1-pow(10,-0.1*args->use_PLs));
args->dsg2prob[1][1] = -log(0.5*pow(10,-0.1*args->use_PLs));
args->dsg2prob[1][2] = -log(0.5*pow(10,-0.1*args->use_PLs));
args->dsg2prob[2][0] = -log(0.5*pow(10,-0.1*args->use_PLs));
args->dsg2prob[2][1] = -log(1-pow(10,-0.1*args->use_PLs));
args->dsg2prob[2][2] = -log(0.5*pow(10,-0.1*args->use_PLs));
args->dsg2prob[4][0] = -log(0.5*pow(10,-0.1*args->use_PLs));
args->dsg2prob[4][1] = -log(0.5*pow(10,-0.1*args->use_PLs));
args->dsg2prob[4][2] = -log(1-pow(10,-0.1*args->use_PLs));
// lookup table to avoid exponentiation
for (i=0; i<256; i++) args->pl2prob[i] = pow(10,-0.1*i);
}
else
args->ndiff = (uint32_t*) calloc(args->npairs,sizeof(*args->ndiff)); // number of differing genotypes for each pair of samples
args->ncnt = (uint32_t*) calloc(args->npairs,sizeof(*args->ncnt)); // number of comparisons performed (non-missing data)
if ( !args->ncnt ) error("Error: failed to allocate %.1f Mb\n", args->npairs*sizeof(*args->ncnt)/1e6);
if ( args->calc_hwe_prob )
{
// prob of the observed sequence of matches given site AFs and HWE
args->hwe_prob = (double*) calloc(args->npairs,sizeof(*args->hwe_prob));
if ( !args->hwe_prob ) error("Error: failed to allocate %.1f Mb. Run with --no-HWE-prob to save some memory.\n", args->npairs*sizeof(*args->hwe_prob)/1e6);
}
if ( args->distinctive_sites ) diff_sites_init(args);
args->fp = stdout;
print_header(args, args->fp);
}
static void destroy_data(args_t *args)
{
if ( args->gt_dsg!=args->qry_dsg ) free(args->gt_dsg);
free(args->qry_dsg);
if ( args->gt_prob!=args->qry_prob ) free(args->gt_prob);
free(args->qry_prob);
free(args->es_max_mem);
fclose(args->fp);
if ( args->distinctive_sites ) diff_sites_destroy(args);
free(args->hwe_prob);
free(args->cwd);
free(args->qry_arr);
if ( args->gt_hdr ) free(args->gt_arr);
free(args->pdiff);
free(args->ndiff);
free(args->ncnt);
free(args->qry_smpl);
if ( args->gt_smpl!=args->qry_smpl ) free(args->gt_smpl);
free(args->pairs);
bcf_sr_destroy(args->files);
}
static inline uint8_t gt_to_dsg(int32_t *ptr)
{
if ( bcf_gt_is_missing(ptr[0]) || bcf_gt_is_missing(ptr[1]) || ptr[1]==bcf_int32_vector_end ) return 0;
uint8_t dsg = (bcf_gt_allele(ptr[0])?1:0) + (bcf_gt_allele(ptr[1])?1:0);
return 1<<dsg;
}
static inline uint8_t pl_to_dsg(int32_t *ptr)
{
if ( ptr[0]==bcf_int32_missing || ptr[1]==bcf_int32_missing || ptr[2]==bcf_int32_missing ) return 0;
if ( ptr[1]==bcf_int32_vector_end || ptr[2]==bcf_int32_vector_end ) return 0;
int min_pl = ptr[0]<ptr[1] ? (ptr[0]<ptr[2]?ptr[0]:ptr[2]) : (ptr[1]<ptr[2]?ptr[1]:ptr[2]);
uint8_t dsg = 0;
if ( ptr[0]==min_pl ) dsg |= 1;
if ( ptr[1]==min_pl ) dsg |= 2;
if ( ptr[2]==min_pl ) dsg |= 4;
return dsg;
}
static inline uint8_t gt_to_prob(args_t *args, int32_t *ptr, double *prob)
{
uint8_t dsg = gt_to_dsg(ptr);
if ( dsg )
{
prob[0] = args->dsg2prob[dsg][0];
prob[1] = args->dsg2prob[dsg][1];
prob[2] = args->dsg2prob[dsg][2];
}
return dsg;
}
static inline uint8_t pl_to_prob(args_t *args, int32_t *ptr, double *prob)
{
uint8_t dsg = pl_to_dsg(ptr);
if ( dsg )
{
prob[0] = (ptr[0]>=0 && ptr[0]<255) ? args->pl2prob[ptr[0]] : args->pl2prob[255];
prob[1] = (ptr[1]>=0 && ptr[1]<255) ? args->pl2prob[ptr[1]] : args->pl2prob[255];
prob[2] = (ptr[2]>=0 && ptr[2]<255) ? args->pl2prob[ptr[2]] : args->pl2prob[255];
double sum = prob[0] + prob[1] + prob[2];
prob[0] /= sum;
prob[1] /= sum;
prob[2] /= sum;
prob[0] = -log(prob[0]);
prob[1] = -log(prob[1]);
prob[2] = -log(prob[2]);
}
return dsg;
}
static int set_data(args_t *args, bcf_hdr_t *hdr, bcf1_t *rec, int32_t **arr, int32_t *narr, int *narr1, int *use_GT)
{
static int warn_dip_GT = 1;
static int warn_dip_PL = 1;
int i;
for (i=0; i<2; i++)
{
if ( *use_GT )
{
int ret = bcf_get_genotypes(hdr,rec,arr,narr);
if ( ret < 0 )
{
if ( !i ) { *use_GT = 0; continue; }
args->nskip_no_data++;
return -1;
}
if ( ret != 2*bcf_hdr_nsamples(hdr) )
{
if ( warn_dip_GT )
{
fprintf(stderr,"INFO: skipping %s:%"PRIhts_pos", only diploid FORMAT/GT fields supported. (This is printed only once.)\n", bcf_seqname(hdr,rec),rec->pos+1);
warn_dip_GT = 0;
}
args->nskip_dip_GT++;
return -1;
}
*narr1 = 2;
return 0;
}
int ret = bcf_get_format_int32(hdr,rec,"PL",arr,narr);
if ( ret < 0 )
{
if ( !i ) { *use_GT = 1; continue; }
args->nskip_no_data++;
return -1;
}
if ( ret != 3*bcf_hdr_nsamples(hdr) )
{
if ( warn_dip_PL )
{
fprintf(stderr,"INFO: skipping %s:%"PRIhts_pos", only diploid FORMAT/PL fields supported. (This is printed only once.)\n", bcf_seqname(hdr,rec),rec->pos+1);
warn_dip_PL = 0;
}
args->nskip_dip_PL++;
return -1;
}
*narr1 = 3;
return 0;
}
return -1; // should never reach
}
static void process_line(args_t *args)
{
int i,j,k, nqry1, ngt1, ret;
bcf1_t *gt_rec = NULL, *qry_rec = bcf_sr_get_line(args->files,0); // the query file
int qry_use_GT = args->qry_use_GT;
int gt_use_GT = args->gt_use_GT;
ret = set_data(args, args->qry_hdr, qry_rec, &args->qry_arr, &args->nqry_arr, &nqry1, &qry_use_GT);
if ( ret<0 ) return;
if ( args->gt_hdr )
{
gt_rec = bcf_sr_get_line(args->files,1);
ret = set_data(args, args->gt_hdr, gt_rec, &args->gt_arr, &args->ngt_arr, &ngt1, >_use_GT);
if ( ret<0 ) return;
}
else
{
ngt1 = nqry1;
args->gt_arr = args->qry_arr;
}
// stats: number of compared sites, and used tags
args->ncmp++;
args->nused[qry_use_GT][gt_use_GT]++;
double af,hwe_dsg[8];
if ( args->calc_hwe_prob )
{
int ac[2];
if ( args->gt_hdr )
{
if ( bcf_calc_ac(args->gt_hdr, gt_rec, ac, BCF_UN_INFO|BCF_UN_FMT)!=1 ) error("todo: bcf_calc_ac() failed\n");
}
else if ( bcf_calc_ac(args->qry_hdr, qry_rec, ac, BCF_UN_INFO|BCF_UN_FMT)!=1 ) error("todo: bcf_calc_ac() failed\n");
// hwe indexes correspond to the bitmask of eight dsg combinations to account for PL uncertainty
// for in the extreme case we can have uninformative PL=0,0,0. So the values are the minima of e.g.
// hwe[1,2,4] .. dsg=0,1,2
// hwe[3] .. dsg=0 or 1
// hwe[6] .. dsg=1 or 2
double hwe[3];
const double min_af = 1e-5; // cap the AF in case we get unrealistic values
af = (double)ac[1]/(ac[0]+ac[1]);
hwe[0] = af>min_af ? -log(af*af) : -log(min_af*min_af);
hwe[1] = af>min_af && af<1-min_af ? -log(2*af*(1-af)) : -log(2*min_af*(1-min_af));
hwe[2] = af<(1-min_af) ? -log((1-af)*(1-af)) : -log(min_af*min_af);
hwe_dsg[0] = 0;
for (i=1; i<8; i++)
{
hwe_dsg[i] = HUGE_VAL;
for (k=0; k<3; k++)
{
if ( ((1<<k)&i) && hwe_dsg[i] > hwe[k] ) hwe_dsg[i] = hwe[k];
}
}
}
// The sample pairs were given explicitly via -p/-P options
if ( args->pairs )
{
if ( !args->use_PLs )
{
int ndiff = 0;
if ( args->kbs_diff ) diff_sites_reset(args);
for (i=0; i<args->npairs; i++)
{
int32_t *ptr;
uint8_t qry_dsg, gt_dsg;
ptr = args->gt_arr + args->pairs[i].igt*ngt1;
gt_dsg = gt_use_GT ? gt_to_dsg(ptr) : pl_to_dsg(ptr);
if ( !gt_dsg ) continue; // missing value
if ( args->hom_only && !(gt_dsg&5) ) continue; // not a hom
ptr = args->qry_arr + args->pairs[i].iqry*nqry1;
qry_dsg = qry_use_GT ? gt_to_dsg(ptr) : pl_to_dsg(ptr);
if ( !qry_dsg ) continue; // missing value
int match = qry_dsg & gt_dsg;
if ( !match )
{
args->ndiff[i]++;
if ( args->kbs_diff ) { ndiff++; kbs_insert(args->kbs_diff, i); }
}
else if ( args->calc_hwe_prob ) args->hwe_prob[i] += hwe_dsg[match];
args->ncnt[i]++;
}
if ( ndiff ) diff_sites_push(args, ndiff, qry_rec->rid, qry_rec->pos);
}
else // use_PLs set
{
for (i=0; i<args->npairs; i++)
{
int32_t *ptr;
double qry_prob[3], gt_prob[3];
uint8_t qry_dsg, gt_dsg;
ptr = args->gt_arr + args->pairs[i].igt*ngt1;
gt_dsg = gt_use_GT ? gt_to_prob(args,ptr,gt_prob) : pl_to_prob(args,ptr,gt_prob);
if ( !gt_dsg ) continue; // missing value
if ( args->hom_only && !(gt_dsg&5) ) continue; // not a hom
ptr = args->qry_arr + args->pairs[i].iqry*nqry1;
qry_dsg = qry_use_GT ? gt_to_prob(args,ptr,qry_prob) : pl_to_prob(args,ptr,qry_prob);
if ( !qry_dsg ) continue; // missing value
double min = qry_prob[0] + gt_prob[0];
qry_prob[1] += gt_prob[1];
if ( min > qry_prob[1] ) min = qry_prob[1];
qry_prob[2] += gt_prob[2];
if ( min > qry_prob[2] ) min = qry_prob[2];
args->pdiff[i] += min;
if ( args->calc_hwe_prob )
{
int match = qry_dsg & gt_dsg;
args->hwe_prob[i] += hwe_dsg[match];
}
args->ncnt[i]++;
}
}
return;
}
int idx=0;
if ( !args->use_PLs )
{
for (i=0; i<args->nqry_smpl; i++)
{
int iqry = args->qry_smpl ? args->qry_smpl[i] : i;
int32_t *ptr = args->qry_arr + nqry1*iqry;
args->qry_dsg[i] = qry_use_GT ? gt_to_dsg(ptr) : pl_to_dsg(ptr);
}
if ( !args->cross_check ) // in this case gt_dsg points to qry_dsg
{
for (i=0; i<args->ngt_smpl; i++)
{
int igt = args->gt_smpl ? args->gt_smpl[i] : i;
int32_t *ptr = args->gt_arr + ngt1*igt;
args->gt_dsg[i] = gt_use_GT ? gt_to_dsg(ptr) : pl_to_dsg(ptr);
if ( args->hom_only && !(args->gt_dsg[i]&5) ) args->gt_dsg[i] = 0; // not a hom, set to a missing value
}
}
for (i=0; i<args->nqry_smpl; i++)
{
int ngt = args->cross_check ? i : args->ngt_smpl; // two files or a sub-diagonal cross-check mode?
if ( !args->qry_dsg[i] ) { idx += ngt; continue; } // missing value
for (j=0; j<ngt; j++)
{
if ( !args->gt_dsg[j] ) { idx++; continue; } // missing value
int match = args->qry_dsg[i] & args->gt_dsg[j];
if ( !match ) args->ndiff[idx]++;
else if ( args->calc_hwe_prob ) args->hwe_prob[idx] += hwe_dsg[match];
args->ncnt[idx]++;
idx++;
}
}
}
else // use_PLs set
{
for (i=0; i<args->nqry_smpl; i++)
{
int iqry = args->qry_smpl ? args->qry_smpl[i] : i;
int32_t *ptr = args->qry_arr + nqry1*iqry;
args->qry_dsg[i] = qry_use_GT ? gt_to_prob(args,ptr,args->qry_prob+i*3) : pl_to_prob(args,ptr,args->qry_prob+i*3);
}
if ( !args->cross_check ) // in this case gt_dsg points to qry_dsg
{
for (i=0; i<args->ngt_smpl; i++)
{
int igt = args->gt_smpl ? args->gt_smpl[i] : i;
int32_t *ptr = args->gt_arr + ngt1*igt;
args->gt_dsg[i] = gt_use_GT ? gt_to_prob(args,ptr,args->gt_prob+i*3) : pl_to_prob(args,ptr,args->gt_prob+i*3);
if ( args->hom_only && !(args->gt_dsg[i]&5) ) args->gt_dsg[i] = 0; // not a hom, set to a missing value
}
}
for (i=0; i<args->nqry_smpl; i++)
{
int ngt = args->cross_check ? i : args->ngt_smpl; // two files or a sub-diagonal cross-check mode?
if ( !args->qry_dsg[i] ) { idx += ngt; continue; } // missing value
for (j=0; j<ngt; j++)
{
if ( !args->gt_dsg[j] ) { idx++; continue; } // missing value
double min = args->qry_prob[i*3] + args->gt_prob[j*3];
if ( min > args->qry_prob[i*3+1] + args->gt_prob[j*3+1] ) min = args->qry_prob[i*3+1] + args->gt_prob[j*3+1];
if ( min > args->qry_prob[i*3+2] + args->gt_prob[j*3+2] ) min = args->qry_prob[i*3+2] + args->gt_prob[j*3+2];
args->pdiff[idx] += min;
if ( args->calc_hwe_prob )
{
int match = args->qry_dsg[i] & args->gt_dsg[j];
args->hwe_prob[idx] += hwe_dsg[match];
}
args->ncnt[idx]++;
idx++;
}
}
}
}
typedef struct
{
int ism, idx;
double val;
}
idbl_t;
static int cmp_idbl(const void *_a, const void *_b)
{
idbl_t *a = (idbl_t*)_a;
idbl_t *b = (idbl_t*)_b;
if ( a->val < b->val ) return -1;
if ( a->val > b->val ) return 1;
return 0;
}
static void report_distinctive_sites(args_t *args)
{
extsort_sort(args->es);
fprintf(args->fp,"# DS, distinctive sites:\n");
fprintf(args->fp,"# - chromosome\n");
fprintf(args->fp,"# - position\n");
fprintf(args->fp,"# - cumulative number of pairs distinguished by this block\n");
fprintf(args->fp,"# - block id\n");
fprintf(args->fp,"#DS\t[2]Chromosome\t[3]Position\t[4]Cumulative number of distinct pairs\t[5]Block id\n");
kbitset_t *kbs_blk = kbs_init(args->npairs);
kbitset_iter_t itr;
int i,ndiff,rid,pos,ndiff_tot = 0, iblock = 0;
int ndiff_min = args->distinctive_sites <= args->npairs ? args->distinctive_sites : args->npairs;
while ( diff_sites_shift(args,&ndiff,&rid,&pos) )
{
int ndiff_new = 0, ndiff_dbg = 0;
kbs_start(&itr);
while ( (i=kbs_next(args->kbs_diff, &itr))>=0 )
{
ndiff_dbg++;
if ( kbs_exists(kbs_blk,i) ) continue; // already set
kbs_insert(kbs_blk,i);
ndiff_new++;
}
if ( ndiff_dbg!=ndiff ) error("Corrupted data, fixme: %d vs %d\n",ndiff_dbg,ndiff);
if ( !ndiff_new ) continue; // no new pair distinguished by this site
ndiff_tot += ndiff_new;
fprintf(args->fp,"DS\t%s\t%d\t%d\t%d\n",bcf_hdr_id2name(args->qry_hdr,rid),pos+1,ndiff_tot,iblock);
if ( ndiff_tot < ndiff_min ) continue; // fewer than the requested number of pairs can be distinguished at this point
iblock++;
ndiff_tot = 0;
kbs_clear(kbs_blk);
}
kbs_destroy(kbs_blk);
}
static void report(args_t *args)
{
fprintf(args->fp,"INFO\tsites-compared\t%u\n",args->ncmp);
fprintf(args->fp,"INFO\tsites-skipped-no-match\t%u\n",args->nskip_no_match);
fprintf(args->fp,"INFO\tsites-skipped-multiallelic\t%u\n",args->nskip_not_ba);
fprintf(args->fp,"INFO\tsites-skipped-monoallelic\t%u\n",args->nskip_mono);
fprintf(args->fp,"INFO\tsites-skipped-no-data\t%u\n",args->nskip_no_data);
fprintf(args->fp,"INFO\tsites-skipped-GT-not-diploid\t%u\n",args->nskip_dip_GT);
fprintf(args->fp,"INFO\tsites-skipped-PL-not-diploid\t%u\n",args->nskip_dip_PL);
fprintf(args->fp,"INFO\tsites-used-PL-vs-PL\t%u\n",args->nused[0][0]);
fprintf(args->fp,"INFO\tsites-used-PL-vs-GT\t%u\n",args->nused[0][1]);
fprintf(args->fp,"INFO\tsites-used-GT-vs-PL\t%u\n",args->nused[1][0]);
fprintf(args->fp,"INFO\tsites-used-GT-vs-GT\t%u\n",args->nused[1][1]);
fprintf(args->fp,"# DC, discordance:\n");
fprintf(args->fp,"# - query sample\n");
fprintf(args->fp,"# - genotyped sample\n");
fprintf(args->fp,"# - discordance (either an abstract score or number of mismatches, see -e/-u in the man page for details; smaller is better)\n");
fprintf(args->fp,"# - negative log of HWE probability at matching sites (rare genotypes matches are more informative, bigger is better)\n");
fprintf(args->fp,"# - number of sites compared (bigger is better)\n");
fprintf(args->fp,"#DC\t[2]Query Sample\t[3]Genotyped Sample\t[4]Discordance\t[5]-log P(HWE)\t[6]Number of sites compared\n");
int trim = args->ntop;
if ( !args->pairs )
{
if ( !args->ngt_smpl && args->nqry_smpl <= args->ntop ) trim = 0;
if ( args->ngt_smpl && args->ngt_smpl <= args->ntop ) trim = 0;
}
if ( args->pairs )
{
int i;
for (i=0; i<args->npairs; i++)
{
int iqry = args->pairs[i].iqry;
int igt = args->pairs[i].igt;
if ( args->ndiff )
{
fprintf(args->fp,"DC\t%s\t%s\t%u\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->gt_hdr?args->gt_hdr->samples[igt]:args->qry_hdr->samples[igt],
args->ndiff[i],
args->calc_hwe_prob ? args->hwe_prob[i] : 0,
args->ncnt[i]);
}
else
{
fprintf(args->fp,"DC\t%s\t%s\t%e\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->gt_hdr?args->gt_hdr->samples[igt]:args->qry_hdr->samples[igt],
args->pdiff[i],
args->calc_hwe_prob ? args->hwe_prob[i] : 0,
args->ncnt[i]);
}
}
}
else if ( !trim )
{
int i,j,idx=0;
for (i=0; i<args->nqry_smpl; i++)
{
int iqry = args->qry_smpl ? args->qry_smpl[i] : i;
int ngt = args->cross_check ? i : args->ngt_smpl;
for (j=0; j<ngt; j++)
{
int igt = args->gt_smpl ? args->gt_smpl[j] : j;
if ( args->ndiff )
{
fprintf(args->fp,"DC\t%s\t%s\t%u\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->gt_hdr?args->gt_hdr->samples[igt]:args->qry_hdr->samples[igt],
args->ndiff[idx],
args->calc_hwe_prob ? args->hwe_prob[idx] : 0,
args->ncnt[idx]);
}
else
{
fprintf(args->fp,"DC\t%s\t%s\t%e\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->gt_hdr?args->gt_hdr->samples[igt]:args->qry_hdr->samples[igt],
args->pdiff[idx],
args->calc_hwe_prob ? args->hwe_prob[idx] : 0,
args->ncnt[idx]);
}
idx++;
}
}
}
else if ( !args->cross_check )
{
idbl_t *arr = (idbl_t*)malloc(sizeof(*arr)*args->ngt_smpl);
int i,j;
for (i=0; i<args->nqry_smpl; i++)
{
int idx = i*args->ngt_smpl;
for (j=0; j<args->ngt_smpl; j++)
{
if ( args->sort_by_hwe )
arr[j].val = -args->hwe_prob[idx];
else if ( args->ndiff )
arr[j].val = args->ncnt[idx] ? (double)args->ndiff[idx]/args->ncnt[idx] : 0;
else
arr[j].val = args->ncnt[idx] ? args->pdiff[idx]/args->ncnt[idx] : 0;
arr[j].ism = j;
arr[j].idx = idx;
idx++;
}
qsort(arr, args->ngt_smpl, sizeof(*arr), cmp_idbl);
int iqry = args->qry_smpl ? args->qry_smpl[i] : i;
for (j=0; j<args->ntop; j++)
{
int idx = arr[j].idx;
int igt = args->gt_smpl ? args->gt_smpl[arr[j].ism] : arr[j].ism;
if ( args->ndiff )
{
fprintf(args->fp,"DC\t%s\t%s\t%u\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->gt_hdr?args->gt_hdr->samples[igt]:args->qry_hdr->samples[igt],
args->ndiff[idx],
args->calc_hwe_prob ? args->hwe_prob[idx] : 0,
args->ncnt[idx]);
}
else
{
fprintf(args->fp,"DC\t%s\t%s\t%e\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->gt_hdr?args->gt_hdr->samples[igt]:args->qry_hdr->samples[igt],
args->pdiff[idx],
args->calc_hwe_prob ? args->hwe_prob[idx] : 0,
args->ncnt[idx]);
}
}
}
free(arr);
}
else
{
int narr = args->nqry_smpl-1;
idbl_t *arr = (idbl_t*)malloc(sizeof(*arr)*narr);
int i,j,k,idx;
for (i=0; i<args->nqry_smpl; i++)
{
k = 0, idx = i*(i-1)/2;
for (j=0; j<i; j++)
{
if ( args->sort_by_hwe )
arr[k].val = -args->hwe_prob[idx];
else if ( args->ndiff )
arr[k].val = args->ncnt[idx] ? (double)args->ndiff[idx]/args->ncnt[idx] : 0;
else
arr[k].val = args->ncnt[idx] ? args->pdiff[idx]/args->ncnt[idx] : 0;
arr[k].ism = j;
arr[k].idx = idx;
idx++;
k++;
}
for (; j<narr; j++)
{
idx = j*(j+1)/2 + i;
if ( args->sort_by_hwe )
arr[k].val = -args->hwe_prob[idx];
else if ( args->ndiff )
arr[k].val = args->ncnt[idx] ? (double)args->ndiff[idx]/args->ncnt[idx] : 0;
else
arr[k].val = args->ncnt[idx] ? args->pdiff[idx]/args->ncnt[idx] : 0;
arr[k].ism = j + 1;
arr[k].idx = idx;
k++;
}
qsort(arr, narr, sizeof(*arr), cmp_idbl);
int iqry = args->qry_smpl ? args->qry_smpl[i] : i;
for (j=0; j<args->ntop; j++)
{
if ( i <= arr[j].ism ) continue;
int idx = arr[j].idx;
int igt = args->qry_smpl ? args->qry_smpl[arr[j].ism] : arr[j].ism;
if ( args->ndiff )
{
fprintf(args->fp,"DC\t%s\t%s\t%u\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->qry_hdr->samples[igt],
args->ndiff[idx],
args->calc_hwe_prob ? args->hwe_prob[idx] : 0,
args->ncnt[idx]);
}
else
{
fprintf(args->fp,"DC\t%s\t%s\t%e\t%e\t%u\n",
args->qry_hdr->samples[iqry],
args->qry_hdr->samples[igt],
args->pdiff[idx],
args->calc_hwe_prob ? args->hwe_prob[idx] : 0,
args->ncnt[idx]);
}
}
}
free(arr);
}
}
static int is_input_okay(args_t *args, int nmatch)
{
int i;
const char *msg;
bcf_hdr_t *hdr;
bcf1_t *rec;
if ( args->gt_hdr && nmatch!=2 )
{