forked from hyunminkang/vt-topmed
-
Notifications
You must be signed in to change notification settings - Fork 0
/
decompose_blocksub.cpp
340 lines (284 loc) · 11.4 KB
/
decompose_blocksub.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
/* 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 "decompose_blocksub.h"
#include "needle.h"
namespace
{
struct Triple
{
int pos_ref;
int pos_alt;
int len_ref;
int len_alt;
Triple() : pos_ref(0), pos_alt(0), len_ref(0), len_alt(0)
{}
Triple(int pos_ref, int pos_alt, int len_ref, int len_alt) : pos_ref(pos_ref), pos_alt(pos_alt), len_ref(len_ref), len_alt(len_alt)
{}
};
class Igor : Program
{
public:
///////////
//options//
///////////
bool aggressive_mode;
std::string input_vcf_file;
std::string output_vcf_file;
std::vector<GenomeInterval> intervals;
std::string ref_fasta_file;
///////
//i/o//
///////
BCFOrderedReader *odr;
BCFOrderedWriter *odw;
bcf1_t *v;
kstring_t s;
kstring_t new_alleles;
kstring_t old_alleles;
/////////
//stats//
/////////
uint32_t no_additional_snps;
uint32_t no_biallelic_blocksub;
uint32_t new_no_variants;
uint32_t no_variants;
/////////
//tools//
/////////
VariantManip *vm;
Igor(int argc, char **argv)
{
version = "0.5";
//////////////////////////
//options initialization//
//////////////////////////
try
{
std::string desc = "decomposes biallelic block substitutions into its constituent SNPs.";
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, "", "file", cmd);
TCLAP::ValueArg<std::string> arg_output_vcf_file("o", "o", "output VCF file [-]", false, "-", "str", cmd);
TCLAP::SwitchArg arg_aggressive("a", "a", "enable aggressive/alignment mode [false]", cmd, false);
TCLAP::UnlabeledValueArg<std::string> arg_input_vcf_file("<in.vcf>", "input VCF file", true, "","file", cmd);
cmd.parse(argc, argv);
input_vcf_file = arg_input_vcf_file.getValue();
output_vcf_file = arg_output_vcf_file.getValue();
aggressive_mode = arg_aggressive.getValue();
parse_intervals(intervals, arg_interval_list.getValue(), arg_intervals.getValue());
}
catch (TCLAP::ArgException &e)
{
std::cerr << "error: " << e.error() << " for arg " << e.argId() << "\n";
abort();
}
};
void initialize()
{
//////////////////////
//i/o initialization//
//////////////////////
odr = new BCFOrderedReader(input_vcf_file, intervals);
odw = new BCFOrderedWriter(output_vcf_file, 1000);
odw->link_hdr(odr->hdr);
bcf_hdr_append(odw->hdr, "##INFO=<ID=OLD_CLUMPED,Number=1,Type=String,Description=\"Original chr:pos:ref:alt encoding\">\n");
odw->write_hdr();
s = {0,0,0};
old_alleles = {0,0,0};
new_alleles = {0,0,0};
////////////////////////
//stats initialization//
////////////////////////
no_additional_snps = 0;
no_biallelic_blocksub = 0;
new_no_variants = 0;
no_variants = 0;
////////////////////////
//tools initialization//
////////////////////////
}
void decompose_blocksub()
{
v = odw->get_bcf1_from_pool();
Variant variant;
while (odr->read(v))
{
bcf_unpack(v, BCF_UN_ALL);
int32_t n_allele = bcf_get_n_allele(v);
char** allele = bcf_get_allele(v);
size_t ref_len = strlen(allele[0]);
size_t alt_len = strlen(allele[1]);
if (aggressive_mode && (ref_len!=alt_len) && (ref_len!=1) && (alt_len!=1))
{
// Use alignment for decomposition of substitutions where REF
// and ALT have different lengths and the variant is not an
// insertion or deletion.
// Perform alignment of REF[1:] and ALT[1:]
NeedlemanWunsch nw(true);
nw.align(allele[0] + 1, allele[1] + 1);
nw.trace_path();
// Force-align first characters
if (allele[0][0] == allele[1][0])
nw.trace.insert(nw.trace.begin(), NeedlemanWunsch::CIGAR_M);
else
nw.trace.insert(nw.trace.begin(), NeedlemanWunsch::CIGAR_X);
nw.read--;
nw.ref--;
// Break apart alignment
std::vector<Triple> chunks;
bool hasError = false;
int pos_ref = 0, pos_alt = 0, k = 0;
Triple nextChunk(pos_ref, pos_alt, 0, 0);
while (pos_ref <= nw.len_ref || pos_alt <= nw.len_read)
{
switch ((int32_t)nw.trace.at(k++))
{
case NeedlemanWunsch::CIGAR_M:
if (hasError)
chunks.push_back(nextChunk);
nextChunk = Triple(pos_ref++, pos_alt++, 1, 1);
hasError = false;
break;
case NeedlemanWunsch::CIGAR_X:
if (hasError)
chunks.push_back(nextChunk);
nextChunk = Triple(pos_ref++, pos_alt++, 1, 1);
hasError = true;
break;
case NeedlemanWunsch::CIGAR_D:
nextChunk.len_ref++;
pos_ref++;
hasError = true;
break;
case NeedlemanWunsch::CIGAR_I:
nextChunk.len_alt++;
pos_alt++;
hasError = true;
break;
}
}
if (hasError)
chunks.push_back(nextChunk);
// Build new BCF records.
int32_t rid = bcf_get_rid(v);
int32_t pos1 = bcf_get_pos1(v);
char** allele = bcf_get_allele(v);
char* ref = strdup(allele[0]);
char* alt = strdup(allele[1]);
old_alleles.l = 0;
bcf_variant2string(odw->hdr, v, &old_alleles);
for (size_t i=0; i<chunks.size(); ++i)
{
bcf1_t *nv = odw->get_bcf1_from_pool();
bcf_copy(nv, v);
bcf_unpack(nv, BCF_UN_ALL);
bcf_set_pos1(nv, pos1+chunks[i].pos_ref);
new_alleles.l=0;
for (int j=chunks[i].pos_ref; j<chunks[i].pos_ref+chunks[i].len_ref; ++j)
kputc(ref[j], &new_alleles);
kputc(',', &new_alleles);
for (int j=chunks[i].pos_alt; j<chunks[i].pos_alt+chunks[i].len_alt; ++j)
kputc(alt[j], &new_alleles);
bcf_update_alleles_str(odw->hdr, nv, new_alleles.s);
bcf_update_info_string(odw->hdr, nv, "OLD_CLUMPED", old_alleles.s);
odw->write(nv);
kputc('\0', &new_alleles);
++new_no_variants;
++no_additional_snps;
}
free(ref);
free(alt);
++no_biallelic_blocksub;
}
else if (n_allele==2 && (ref_len!=1) && (ref_len==strlen(allele[1])))
{
int32_t rid = bcf_get_rid(v);
int32_t pos1 = bcf_get_pos1(v);
char** allele = bcf_get_allele(v);
char* ref = strdup(allele[0]);
char* alt = strdup(allele[1]);
old_alleles.l = 0;
bcf_variant2string(odw->hdr, v, &old_alleles);
for (size_t i=0; i<ref_len; ++i)
{
if (ref[i]!=alt[i])
{
bcf1_t *nv = odw->get_bcf1_from_pool();
bcf_copy(nv, v);
bcf_unpack(nv, BCF_UN_ALL);
bcf_set_pos1(nv, pos1+i);
new_alleles.l=0;
kputc(ref[i], &new_alleles);
kputc(',', &new_alleles);
kputc(alt[i], &new_alleles);
bcf_update_alleles_str(odw->hdr, nv, new_alleles.s);
bcf_update_info_string(odw->hdr, nv, "OLD_CLUMPED", old_alleles.s);
odw->write(nv);
++new_no_variants;
++no_additional_snps;
}
}
free(ref);
free(alt);
++no_biallelic_blocksub;
}
else
{
odw->write(v);
v = odw->get_bcf1_from_pool();
++new_no_variants;
}
++no_variants;
}
odw->close();
odr->close();
};
void print_options()
{
std::clog << "decompose_blocksub v" << version << "\n";
std::clog << "\n";
std::clog << "options: input VCF file " << input_vcf_file << "\n";
std::clog << " [o] output VCF file " << output_vcf_file << "\n";
print_int_op(" [i] intervals ", intervals);
print_boo_op(" [a] align/aggressive mode ", aggressive_mode);
std::clog << "\n";
}
void print_stats()
{
std::clog << "\n";
std::clog << "stats: no. variants : " << no_variants << "\n";
std::clog << " no. biallelic block substitutions : " << no_biallelic_blocksub << "\n";
std::clog << "\n";
std::clog << " no. additional SNPs : " << no_additional_snps << "\n";
std::clog << " no. variants after decomposition : " << new_no_variants << "\n";
std::clog << "\n";
};
~Igor() {};
private:
};
}
void decompose_blocksub(int argc, char ** argv)
{
Igor igor(argc, argv);
igor.print_options();
igor.initialize();
igor.decompose_blocksub();
igor.print_stats();
};