-
Notifications
You must be signed in to change notification settings - Fork 37
/
merge.cpp
364 lines (297 loc) · 12.2 KB
/
merge.cpp
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
/* The MIT License
Copyright (c) 2014 Adrian Tan <atks@umich.edu>
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 "merge.h"
namespace
{
class Igor : Program
{
public:
std::string version;
///////////
//options//
///////////
std::vector<std::string> input_vcf_files;
std::string input_vcf_file_list;
std::string output_vcf_file;
std::vector<GenomeInterval> intervals;
std::string interval_list;
bool print;
///////
//i/o//
///////
BCFSyncedReader *sr;
BCFOrderedWriter *odw;
bcf1_t *v;
///////////////
//general use//
///////////////
kstring_t variant;
/////////
//stats//
/////////
uint32_t no_samples;
uint32_t no_candidate_snps;
uint32_t no_candidate_indels;
uint32_t no_candidate_snpindels;
uint32_t no_other_variant_types;
/////////
//tools//
/////////
LogTool *lt;
VariantManip * vm;
Igor(int argc, char ** argv)
{
//////////////////////////
//options initialization//
//////////////////////////
try
{
std::string desc = "Merges VCF files. If duplicate variants are observed for a sample, they are dropped. \n\
Assumes that genotype fields are the same for all individuals for each record\n";
version = "0.5";
TCLAP::CmdLine cmd(desc, ' ', version);
VTOutput my; cmd.setOutput(&my);
TCLAP::ValueArg<std::string> arg_intervals("i", "i", "intervals", false, "", "str", cmd);
TCLAP::ValueArg<std::string> arg_interval_list("I", "I", "file containing list of intervals []", false, "", "str", cmd);
TCLAP::SwitchArg arg_print("p", "p", "print options and summary []", cmd, false);
TCLAP::ValueArg<std::string> arg_output_vcf_file("o", "o", "output VCF file [-]", false, "-", "", cmd);
TCLAP::ValueArg<std::string> arg_input_vcf_file_list("L", "L", "file containing list of input VCF files", false, "", "str", cmd);
TCLAP::UnlabeledMultiArg<std::string> arg_input_vcf_files("<in1.vcf>...", "Multiple VCF files",false, "files", cmd);
cmd.parse(argc, argv);
input_vcf_file_list = arg_input_vcf_file_list.getValue();
output_vcf_file = arg_output_vcf_file.getValue();
parse_files(input_vcf_files, arg_input_vcf_files.getValue(), arg_input_vcf_file_list.getValue());
const std::vector<std::string>& v = arg_input_vcf_files.getValue();
parse_intervals(intervals, arg_interval_list.getValue(), arg_intervals.getValue());
print = arg_print.getValue();
if (input_vcf_files.size()==0)
{
fprintf(stderr, "[E:%s:%d %s] no input vcf files.\n", __FILE__, __LINE__, __FUNCTION__);
exit(1);
}
}
catch (TCLAP::ArgException &e)
{
std::cerr << "error: " << e.error() << " for arg " << e.argId() << "\n";
abort();
}
};
void initialize()
{
//////////////////////
//i/o initialization//
//////////////////////
sr = new BCFSyncedReader(input_vcf_files, intervals, false);
odw = new BCFOrderedWriter(output_vcf_file, 0);
bcf_hdr_append(odw->hdr, "##fileformat=VCFv4.1");
bcf_hdr_transfer_contigs(sr->hdrs[0], odw->hdr);
///////////////
//general use//
///////////////
variant = {0,0,0};
no_samples = sr->nfiles;
////////////////////////
//stats initialization//
////////////////////////
no_candidate_snps = 0;
no_candidate_indels = 0;
no_candidate_snpindels = 0;
no_other_variant_types = 0;
/////////
//tools//
/////////
lt = new LogTool();
vm = new VariantManip();
}
void merge()
{
int32_t nfiles = sr->get_nfiles();
//add all sample names to output vcf header and yell if there are more than one occurence of a sample
int32_t no_samples = 0;
for (int32_t i=0; i<nfiles; ++i)
{
for (int32_t j=0; j<bcf_hdr_nsamples(sr->hdrs[i]); ++j)
{
if (bcf_hdr_id2int(odw->hdr, BCF_DT_SAMPLE, bcf_hdr_get_sample_name(sr->hdrs[i], j))==-1)
{
std::cerr << "adding " << bcf_hdr_get_sample_name(sr->hdrs[i], j) << "\n";
bcf_hdr_add_sample(odw->hdr, bcf_hdr_get_sample_name(sr->hdrs[i], j));
++no_samples;
}
else
{
fprintf(stderr, "[E:%s:%d %s] %s is present more than once.\n", __FILE__, __LINE__, __FUNCTION__, bcf_hdr_get_sample_name(sr->hdrs[i], j));
exit(1);
}
}
}
bcf_hdr_append(odw->hdr, "##FORMAT=<ID=GT,Number=1,Type=String,Description=\"Genotype\">");
bcf_hdr_append(odw->hdr, "##FORMAT=<ID=PL,Number=G,Type=Integer,Description=\"Normalized, Phred-scaled likelihoods for genotypes\">");
odw->write_hdr();
// if ( v->n_fmt)
// {
// int gt_i = -1;
// bcf_fmt_t *fmt = v->d.fmt;
// int first = 1;
// for (i = 0; i < (int)v->n_fmt; ++i) {
// if ( !fmt[i].p ) continue;
// kputc(!first ? ':' : '\t', s); first = 0;
// if ( fmt[i].id<0 ) //!bcf_hdr_idinfo_exists(h,BCF_HL_FMT,fmt[i].id) )
// {
// fprintf(stderr, "[E::%s] invalid BCF, the FORMAT tag id=%d not present in the header.\n", __func__, fmt[i].id);
// abort();
// }
// kputs(h->id[BCF_DT_ID][fmt[i].id].key, s);
// if (strcmp(h->id[BCF_DT_ID][fmt[i].id].key, "GT") == 0) gt_i = i;
// }
// if ( first ) kputs("\t.", s);
// for (j = 0; j < v->n_sample; ++j) {
// kputc('\t', s);
// first = 1;
// for (i = 0; i < (int)v->n_fmt; ++i) {
// bcf_fmt_t *f = &fmt[i];
// if ( !f->p ) continue;
// if (!first) kputc(':', s); first = 0;
// if (gt_i == i)
// bcf_format_gt(f,j,s);
// else
// bcf_fmt_array(s, f->n, f->type, f->p + j * f->size);
// }
// if ( first ) kputc('.', s);
// }
// }
// else
// for (j=0; j<=v->n_sample; j++)
// kputs("\t.", s);
//prepare arrays for individual information
// if (v->)
// for ()
// {
//
//
//
//
//
// }
std::vector<bcfptr*> current_recs;
int32_t *cgt = (int32_t*) malloc(no_samples*2*sizeof(int32_t));
int32_t *pls = (int32_t*) malloc(no_samples*3*sizeof(int32_t));
int ncount =0;
std::vector<bcfptr*> sample2record(no_samples, NULL);
std::vector<int32_t> sample2index(no_samples, -1);
while(sr->read_next_position(current_recs))
{
//update alleles
bcf1_t *v = current_recs[0]->v;
bcf_hdr_t *h = current_recs[0]->h;
bcf1_t *nv = odw->get_bcf1_from_pool();
bcf_set_chrom(odw->hdr, nv, bcf_get_chrom(h, v));
bcf_set_pos1(nv, bcf_get_pos1(v));
bcf_update_alleles(odw->hdr, nv, const_cast<const char**>(bcf_get_allele(v)), bcf_get_n_allele(v));
bcf_set_n_sample(nv, no_samples);
//
// for (uint32_t i=0; i<current_recs.size(); ++i)
// {
// int32_t file_index = current_recs[i]->file_index;
// for (int32_t j=0; j<bcf_hdr_nsamples(h); ++j)
// {
// bcf_hdr_id2int(odw->hdr, BCF_DT_SAMPLE, bcf_hdr_get_sample_name(sr->hdrs[file_index], j))
// }
// }
//get possible format values here based on first file you see.
//assign sample
int32_t ngt = 0;
for (uint32_t i=0; i<current_recs.size(); ++i)
{
int32_t file_index = current_recs[i]->file_index;
bcf1_t *v = current_recs[i]->v;
bcf_hdr_t *h = current_recs[i]->h;
int32_t *gt = NULL;
int32_t n = 0;
int32_t ploidy = bcf_get_genotypes(h, v, >, &n); //as a string
ploidy /= bcf_hdr_nsamples(h);
//bcf_print(h,v);
int32_t *pl = NULL;
n=0;
bcf_get_format_int(h, v, "PL",&pl, &n);
for (int32_t j=0; j<bcf_hdr_nsamples(h); ++j)
{
int32_t k = bcf_hdr_id2int(odw->hdr, BCF_DT_SAMPLE, bcf_hdr_get_sample_name(sr->hdrs[file_index], j));
cgt[k*2] = gt[j*2];
cgt[k*2+1] = gt[j*2+1];
pls[k*3] = pl[j*2];
pls[k*3+1] = pl[j*2+1];
pls[k*3+2] = pl[j*2+2];
++ngt;
}
free(gt);
free(pl);
}
//update info
// for (i = 0; i < v->n_info; ++i) {
// bcf_info_t *z = &v->d.info[i];
// if ( !z->vptr ) continue;
// if ( !first ) kputc(';', s); first = 0;
// kputs(h->id[BCF_DT_ID][z->key].key, s);
// if (z->len <= 0) continue;
// kputc('=', s);
// if (z->len == 1) {
// if (z->type == BCF_BT_FLOAT) ksprintf(s, "%g", z->v1.f);
// else if (z->type != BCF_BT_CHAR) kputw(z->v1.i, s);
// else kputc(z->v1.i, s);
// } else bcf_fmt_array(s, z->len, z->type, z->vptr);
// }
//update individual information
bcf_update_genotypes(odw->hdr,nv,cgt,ngt*2);
bcf_update_format_int32(odw->hdr,nv,"PL",pls,ngt*3);
odw->write(nv);
}
free(cgt);
sr->close();
odw->close();
};
void print_options()
{
if (!print) return;
std::clog << "merge v" << version << "\n\n";
print_ifiles("options: input VCF file ", input_vcf_files);
std::clog << " [o] output VCF file " << output_vcf_file << "\n";
print_int_op(" [i] intervals ", intervals);
std::clog << "\n";
}
void print_stats()
{
if (!print) return;
std::clog << "\n";
std::cerr << "stats: Total Number of Candidate SNPs " << no_candidate_snps << "\n";
std::clog << "\n";
};
~Igor() {};
private:
};
}
bool merge(int argc, char ** argv)
{
Igor igor(argc, argv);
igor.print_options();
igor.initialize();
igor.merge();
igor.print_stats();
return igor.print;
}