-
Notifications
You must be signed in to change notification settings - Fork 27
/
gen_reads.py
executable file
·901 lines (805 loc) · 47.4 KB
/
gen_reads.py
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
#!/usr/bin/env source
# encoding: utf-8
""" ////////////////////////////////////////////////////////////////////////////////
/// ///
/// gen_reads.py ///
/// VERSION 3.0: HARDER, BETTER, FASTER, STRONGER! ///
/////// //////
/// Variant and read simulator for benchmarking NGS workflows ///
/// ///
/// Written by: Zach Stephens ///
/////// For: DEPEND Research Group, UIUC ///////
/// Date: May 29, 2015 ///
/// Contact: [email protected] ///
/// ///
/////////////////////////////////////////////////////////////////////////////// """
import sys
import copy
import random
import re
import time
import bisect
import pickle
import numpy as np
import argparse
import pathlib
from source.input_checking import check_file_open, is_in_range
from source.ref_func import index_ref, read_ref
from source.vcf_func import parse_vcf
from source.output_file_writer import OutputFileWriter, reverse_complement, sam_flag
from source.probability import DiscreteDistribution, mean_ind_of_weighted_list
from source.SequenceContainer import SequenceContainer, ReadContainer, parse_input_mutation_model
"""
Some constants needed for analysis
"""
# target window size for read sampling. How many times bigger than read/frag length
WINDOW_TARGET_SCALE = 100
# allowed nucleotides
ALLOWED_NUCL = ['A', 'C', 'G', 'T']
def main(raw_args=None):
"""//////////////////////////////////////////////////
//////////// PARSE INPUT ARGUMENTS ////////////
//////////////////////////////////////////////////"""
parser = argparse.ArgumentParser(description='NEAT-genReads V3.0',
formatter_class=argparse.ArgumentDefaultsHelpFormatter,)
parser.add_argument('-r', type=str, required=True, metavar='reference', help="Path to reference fasta")
parser.add_argument('-R', type=int, required=True, metavar='read length', help="The desired read length")
parser.add_argument('-o', type=str, required=True, metavar='output_prefix',
help="Prefix for the output files (can be a path)")
parser.add_argument('-c', type=float, required=False, metavar='coverage', default=10.0,
help="Average coverage, default is 10.0")
parser.add_argument('-e', type=str, required=False, metavar='error_model', default=None,
help="Location of the file for the sequencing error model (omit to use the default)")
parser.add_argument('-E', type=float, required=False, metavar='Error rate', default=-1,
help="Rescale avg sequencing error rate to this, must be between 0.0 and 0.3")
parser.add_argument('-p', type=int, required=False, metavar='ploidy', default=2,
help="Desired ploidy, default = 2")
parser.add_argument('-tr', type=str, required=False, metavar='target.bed', default=None,
help="Bed file containing targeted regions")
parser.add_argument('-dr', type=str, required=False, metavar='discard_regions.bed', default=None,
help="Bed file with regions to discard")
parser.add_argument('-to', type=float, required=False, metavar='off-target coverage scalar', default=0.00,
help="off-target coverage scalar")
parser.add_argument('-m', type=str, required=False, metavar='model.p', default=None,
help="Mutation model pickle file")
parser.add_argument('-M', type=float, required=False, metavar='avg mut rate', default=-1,
help="Rescale avg mutation rate to this (1/bp), must be between 0 and 0.3")
parser.add_argument('-Mb', type=str, required=False, metavar='mut_rates.bed', default=None,
help="Bed file containing positional mut rates")
parser.add_argument('-N', type=int, required=False, metavar='min qual score', default=-1,
help="below this quality score, replace base-calls with N's")
parser.add_argument('-v', type=str, required=False, metavar='vcf.file', default=None,
help="Input VCF file of variants to include")
parser.add_argument('--pe', nargs=2, type=int, required=False, metavar=('<int>', '<int>'), default=(None, None),
help='Paired-end fragment length mean and std')
parser.add_argument('--pe-model', type=str, required=False, metavar='<str>', default=None,
help='empirical fragment length distribution')
parser.add_argument('--gc-model', type=str, required=False, metavar='<str>', default=None,
help='empirical GC coverage bias distribution')
parser.add_argument('--bam', required=False, action='store_true', default=False, help='output golden BAM file')
parser.add_argument('--vcf', required=False, action='store_true', default=False, help='output golden VCF file')
parser.add_argument('--fa', required=False, action='store_true', default=False,
help='output FASTA instead of FASTQ')
parser.add_argument('--rng', type=int, required=False, metavar='<int>', default=-1,
help='rng seed value; identical RNG value should produce identical runs of the program, so '
'things like read locations, variant positions, error positions, etc, '
'should all be the same.')
parser.add_argument('--no-fastq', required=False, action='store_true', default=False,
help='bypass fastq generation')
parser.add_argument('--discard-offtarget', required=False, action='store_true', default=False,
help='discard reads outside of targeted regions')
parser.add_argument('--force-coverage', required=False, action='store_true', default=False,
help='[debug] ignore fancy models, force coverage to be constant')
parser.add_argument('--rescale-qual', required=False, action='store_true', default=False,
help='Rescale quality scores to match -E input')
# TODO implement a broader debugging scheme for subclasses.
parser.add_argument('-d', required=False, action='store_true', default=False, help='Activate Debug Mode')
args = parser.parse_args(raw_args)
"""
Set variables for processing
"""
# absolute path to this script
sim_path = pathlib.Path(__file__).resolve().parent
# if coverage val for a given window/position is below this value, consider it effectively zero.
low_cov_thresh = 50
# required args
(reference, read_len, out_prefix) = (args.r, args.R, args.o)
# various dataset parameters
(coverage, ploids, input_bed, discard_bed, se_model, se_rate, mut_model, mut_rate, mut_bed, input_vcf) = \
(args.c, args.p, args.tr, args.dr, args.e, args.E, args.m, args.M, args.Mb, args.v)
# cancer params (disabled currently)
# (cancer, cancer_model, cancer_purity) = (args.cancer, args.cm, args.cp)
(cancer, cancer_model, cancer_purity) = (False, None, 0.8)
(off_target_scalar, off_target_discard, force_coverage, rescale_qual) = (args.to,
args.discard_offtarget,
args.force_coverage, args.rescale_qual)
# important flags
(save_bam, save_vcf, fasta_instead, no_fastq) = \
(args.bam, args.vcf, args.fa, args.no_fastq)
# sequencing model parameters
(fragment_size, fragment_std) = args.pe
(fraglen_model, gc_bias_model) = args.pe_model, args.gc_model
n_max_qual = args.N
rng_seed = args.rng
debug = args.d
"""
INPUT ERROR CHECKING
"""
# Check that files are real, if provided
check_file_open(reference, 'ERROR: could not open reference, {}'.format(reference), required=True)
check_file_open(input_vcf, 'ERROR: could not open input VCF, {}'.format(input_vcf), required=False)
check_file_open(input_bed, 'ERROR: could not open input BED, {}'.format(input_bed), required=False)
# if user specified no fastq, not fasta only, and no bam and no vcf, then print error and exit.
if no_fastq and not fasta_instead and not save_bam and not save_vcf:
print('\nERROR: No files would be written.\n')
sys.exit(1)
if no_fastq:
print('Bypassing FASTQ generation...')
only_vcf = no_fastq and save_vcf and not save_bam and not fasta_instead
if only_vcf:
print('Only producing VCF output...')
if (fragment_size is None and fragment_std is not None) or (fragment_size is not None and fragment_std is None):
print('\nERROR: --pe argument takes 2 space-separated arguments.\n')
sys.exit(1)
# If user specified mean/std, or specified an empirical model, then the reads will be paired_ended
# If not, then we're doing single-end reads.
if (fragment_size is not None and fragment_std is not None) or (fraglen_model is not None) and not fasta_instead:
paired_end = True
else:
paired_end = False
if rng_seed == -1:
rng_seed = random.randint(1, 99999999)
random.seed(rng_seed)
is_in_range(read_len, 10, 1000000, 'Error: -R must be between 10 and 1,000,000')
is_in_range(coverage, 0, 1000000, 'Error: -c must be between 0 and 1,000,000')
is_in_range(ploids, 1, 100, 'Error: -p must be between 1 and 100')
is_in_range(off_target_scalar, 0, 1, 'Error: -to must be between 0 and 1')
if se_rate != -1:
is_in_range(se_rate, 0, 0.3, 'Error: -E must be between 0 and 0.3')
else:
se_rate = None
if n_max_qual != -1:
is_in_range(n_max_qual, 1, 40, 'Error: -N must be between 1 and 40')
"""
LOAD INPUT MODELS
"""
# mutation models
mut_model = parse_input_mutation_model(mut_model, 1)
if cancer:
cancer_model = parse_input_mutation_model(cancer_model, 2)
if mut_rate < 0.:
mut_rate = None
if mut_rate != -1 and mut_rate is not None:
is_in_range(mut_rate, 0.0, 1.0, 'Error: -M must be between 0 and 0.3')
# sequencing error model
if se_model is None:
print('Using default sequencing error model.')
se_model = sim_path / 'models/errorModel_toy.p'
se_class = ReadContainer(read_len, se_model, se_rate, rescale_qual)
else:
# probably need to do some sanity checking
se_class = ReadContainer(read_len, se_model, se_rate, rescale_qual)
# GC-bias model
if gc_bias_model is None:
print('Using default gc-bias model.')
gc_bias_model = sim_path / 'models/gcBias_toy.p'
try:
[gc_scale_count, gc_scale_val] = pickle.load(open(gc_bias_model, 'rb'))
except IOError:
print("\nProblem reading the default gc-bias model.\n")
sys.exit(1)
gc_window_size = gc_scale_count[-1]
else:
try:
[gc_scale_count, gc_scale_val] = pickle.load(open(gc_bias_model, 'rb'))
except IOError:
print("\nProblem reading the gc-bias model.\n")
sys.exit(1)
gc_window_size = gc_scale_count[-1]
# Assign appropriate values to the needed variables if we're dealing with paired-ended data
if paired_end:
# Empirical fragment length distribution, if input model is specified
if fraglen_model is not None:
print('Using empirical fragment length distribution.')
try:
[potential_values, potential_prob] = pickle.load(open(fraglen_model, 'rb'))
except IOError:
print('\nProblem loading the empirical fragment length model.\n')
sys.exit(1)
fraglen_values = []
fraglen_probability = []
for i in range(len(potential_values)):
if potential_values[i] > read_len:
fraglen_values.append(potential_values[i])
fraglen_probability.append(potential_prob[i])
# TODO add some validation and sanity-checking code here...
fraglen_distribution = DiscreteDistribution(fraglen_probability, fraglen_values)
fragment_size = fraglen_values[mean_ind_of_weighted_list(fraglen_probability)]
# Using artificial fragment length distribution, if the parameters were specified
# fragment length distribution: normal distribution that goes out to +- 6 standard deviations
elif fragment_size is not None and fragment_std is not None:
print(
'Using artificial fragment length distribution. mean=' + str(fragment_size) + ', std=' + str(
fragment_std))
if fragment_std == 0:
fraglen_distribution = DiscreteDistribution([1], [fragment_size], degenerate_val=fragment_size)
else:
potential_values = range(fragment_size - 6 * fragment_std, fragment_size + 6 * fragment_std + 1)
fraglen_values = []
for i in range(len(potential_values)):
if potential_values[i] > read_len:
fraglen_values.append(potential_values[i])
fraglen_probability = [np.exp(-(((n - float(fragment_size)) ** 2) / (2 * (fragment_std ** 2)))) for n in
fraglen_values]
fraglen_distribution = DiscreteDistribution(fraglen_probability, fraglen_values)
"""
Process Inputs
"""
# index reference: [(0: chromosome name, 1: byte index where the contig seq begins,
# 2: byte index where the next contig begins, 3: contig seq length),
# (repeat for every chrom)]
# TODO check to see if this might work better as a dataframe or biopython object
ref_index = index_ref(reference)
# TODO check if this index can work, maybe it's faster
# ref_index2 = SeqIO.index(reference, 'fasta')
if paired_end:
n_handling = ('random', fragment_size)
else:
n_handling = ('ignore', read_len)
indices_by_ref_name = {ref_index[n][0]: n for n in range(len(ref_index))}
ref_list = [n[0] for n in ref_index]
# parse input variants, if present
# TODO read this in as a pandas dataframe
input_variants = []
if input_vcf is not None:
if cancer:
(sample_names, input_variants) = parse_vcf(input_vcf, tumor_normal=True, ploidy=ploids)
# TODO figure out what these were going to be used for
tumor_ind = sample_names.index('TUMOR')
normal_ind = sample_names.index('NORMAL')
else:
(sample_names, input_variants) = parse_vcf(input_vcf, ploidy=ploids)
for k in sorted(input_variants.keys()):
input_variants[k].sort()
# parse input targeted regions, if present
# TODO convert bed to pandas dataframe
input_regions = {}
if input_bed is not None:
try:
with open(input_bed, 'r') as f:
for line in f:
[my_chr, pos1, pos2] = line.strip().split('\t')[:3]
if my_chr not in input_regions:
input_regions[my_chr] = [-1]
input_regions[my_chr].extend([int(pos1), int(pos2)])
except IOError:
print("\nProblem reading input target BED file.\n")
sys.exit(1)
# some validation
n_in_bed_only = 0
n_in_ref_only = 0
for k in ref_list:
if k not in input_regions:
n_in_ref_only += 1
for k in input_regions.keys():
if k not in ref_list:
n_in_bed_only += 1
del input_regions[k]
if n_in_ref_only > 0:
print('Warning: Reference contains sequences not found in targeted regions BED file.')
if n_in_bed_only > 0:
print(
'Warning: Targeted regions BED file contains sequence names not found in reference (regions ignored).')
# parse discard bed similarly
# TODO convert to pandas dataframe
discard_regions = {}
if discard_bed is not None:
try:
with open(discard_bed, 'r') as f:
for line in f:
[my_chr, pos1, pos2] = line.strip().split('\t')[:3]
if my_chr not in discard_regions:
discard_regions[my_chr] = [-1]
discard_regions[my_chr].extend([int(pos1), int(pos2)])
except IOError:
print("\nProblem reading discard BED file.\n")
sys.exit(1)
# parse input mutation rate rescaling regions, if present
# TODO convert to pandas dataframe
mut_rate_regions = {}
mut_rate_values = {}
if mut_bed is not None:
try:
with open(mut_bed, 'r') as f:
for line in f:
[my_chr, pos1, pos2, meta_data] = line.strip().split('\t')[:4]
mut_str = re.findall(r"mut_rate=.*?(?=;)", meta_data + ';')
(pos1, pos2) = (int(pos1), int(pos2))
if len(mut_str) and (pos2 - pos1) > 1:
# mut_rate = #_mutations / length_of_region, let's bound it by a reasonable amount
mut_rate = max([0.0, min([float(mut_str[0][9:]), 0.3])])
if my_chr not in mut_rate_regions:
mut_rate_regions[my_chr] = [-1]
mut_rate_values[my_chr] = [0.0]
mut_rate_regions[my_chr].extend([pos1, pos2])
# TODO figure out what the next line is supposed to do and fix
mut_rate_values.extend([mut_rate * (pos2 - pos1)] * 2)
except IOError:
print("\nProblem reading mutational BED file.\n")
sys.exit(1)
# initialize output files (part I)
bam_header = None
if save_bam:
# TODO wondering if this is actually needed in the bam_header
bam_header = [copy.deepcopy(ref_index)]
vcf_header = None
if save_vcf:
vcf_header = [reference]
# initialize output files (part II)
# TODO figure out how to do this more efficiently. Write the files at the end.
if cancer:
output_file_writer = OutputFileWriter(out_prefix + '_normal', paired=paired_end, bam_header=bam_header,
vcf_header=vcf_header,
no_fastq=no_fastq, fasta_instead=fasta_instead)
output_file_writer_cancer = OutputFileWriter(out_prefix + '_tumor', paired=paired_end, bam_header=bam_header,
vcf_header=vcf_header,
no_fastq=no_fastq, fasta_instead=fasta_instead)
else:
output_file_writer = OutputFileWriter(out_prefix, paired=paired_end, bam_header=bam_header,
vcf_header=vcf_header,
no_fastq=no_fastq,
fasta_instead=fasta_instead)
# Using pathlib to make this more machine agnostic
out_prefix_name = pathlib.Path(out_prefix).name
"""
LET'S GET THIS PARTY STARTED...
"""
# keep track of the number of reads we've sampled, for read-names
read_name_count = 1
unmapped_records = []
for chrom in range(len(ref_index)):
# read in reference sequence and notate blocks of Ns
(ref_sequence, n_regions) = read_ref(reference, ref_index[chrom], n_handling)
# count total bp we'll be spanning so we can get an idea of how far along we are
# (for printing progress indicators)
total_bp_span = sum([n[1] - n[0] for n in n_regions['non_N']])
current_progress = 0
current_percent = 0
have_printed100 = False
"""Prune invalid input variants, e.g variants that:
- try to delete or alter any N characters
- don't match the reference base at their specified position
- any alt allele contains anything other than allowed characters"""
valid_variants_from_vcf = []
n_skipped = [0, 0, 0]
if ref_index[chrom][0] in input_variants:
for n in input_variants[ref_index[chrom][0]]:
span = (n[0], n[0] + len(n[1]))
r_seq = str(ref_sequence[span[0] - 1:span[1] - 1]) # -1 because going from VCF coords to array coords
# Checks if there are any invalid nucleotides in the vcf items
any_bad_nucl = any((nn not in ALLOWED_NUCL) for nn in [item for sublist in n[2] for item in sublist])
# Ensure reference sequence matches the nucleotide in the vcf
if r_seq != n[1]:
n_skipped[0] += 1
continue
# Ensure that we aren't trying to insert into an N region
elif 'N' in r_seq:
n_skipped[1] += 1
continue
# Ensure that we don't insert any disallowed characters
elif any_bad_nucl:
n_skipped[2] += 1
continue
# If it passes the above tests, append to valid variants list
valid_variants_from_vcf.append(n)
print('found', len(valid_variants_from_vcf), 'valid variants for ' +
ref_index[chrom][0] + ' in input VCF...')
if any(n_skipped):
print(sum(n_skipped), 'variants skipped...')
print(' - [' + str(n_skipped[0]) + '] ref allele does not match reference')
print(' - [' + str(n_skipped[1]) + '] attempting to insert into N-region')
print(' - [' + str(n_skipped[2]) + '] alt allele contains non-ACGT characters')
# TODO add large random structural variants
# determine sampling windows based on read length, large N regions, and structural mutations.
# in order to obtain uniform coverage, windows should overlap by:
# - read_len, if single-end reads
# - fragment_size (mean), if paired-end reads
# ploidy is fixed per large sampling window,
# coverage distributions due to GC% and targeted regions are specified within these windows
all_variants_out = {}
sequences = None
if paired_end:
target_size = WINDOW_TARGET_SCALE * fragment_size
overlap = fragment_size
overlap_min_window_size = max(fraglen_distribution.values) + 10
else:
target_size = WINDOW_TARGET_SCALE * read_len
overlap = read_len
overlap_min_window_size = read_len + 10
print('--------------------------------')
if only_vcf:
print('generating vcf...')
elif fasta_instead:
print('generating mutated fasta...')
else:
print('sampling reads...')
tt = time.time()
# start the progress bar
print("[", end='', flush=True)
# Applying variants to non-N regions
for i in range(len(n_regions['non_N'])):
(initial_position, final_position) = n_regions['non_N'][i]
number_target_windows = max([1, (final_position - initial_position) // target_size])
base_pair_distance = int((final_position - initial_position) / float(number_target_windows))
# if for some reason our region is too small to process, skip it! (sorry)
if number_target_windows == 1 and (final_position - initial_position) < overlap_min_window_size:
continue
start = initial_position
end = min([start + base_pair_distance, final_position])
vars_from_prev_overlap = []
vars_cancer_from_prev_overlap = []
v_index_from_prev = 0
is_last_time = False
while True:
# which inserted variants are in this window?
vars_in_window = []
updated = False
for j in range(v_index_from_prev, len(valid_variants_from_vcf)):
variants_position = valid_variants_from_vcf[j][0]
# update: changed <= to <, so variant cannot be inserted in first position
if start < variants_position < end:
# vcf --> array coords
vars_in_window.append(tuple([variants_position - 1] + list(valid_variants_from_vcf[j][1:])))
if variants_position >= end - overlap - 1 and updated is False:
updated = True
v_index_from_prev = j
if variants_position >= end:
break
# determine which structural variants will affect our sampling window positions
structural_vars = []
for n in vars_in_window:
# change: added abs() so that insertions are also buffered.
buffer_needed = max([max([abs(len(n[1]) - len(alt_allele)), 1]) for alt_allele in n[2]])
# -1 because going from VCF coords to array coords
structural_vars.append((n[0] - 1, buffer_needed))
# adjust end-position of window based on inserted structural mutations
keep_going = True
while keep_going:
keep_going = False
for n in structural_vars:
# adding "overlap" here to prevent SVs from being introduced in overlap regions
# (which can cause problems if random mutations from the previous window land on top of them)
delta = (end - 1) - (n[0] + n[1]) - 2 - overlap
if delta < 0:
buffer_added = -delta
end += buffer_added
keep_going = True
break
next_start = end - overlap
next_end = min([next_start + base_pair_distance, final_position])
if next_end - next_start < base_pair_distance:
end = next_end
is_last_time = True
# print progress indicator
if debug:
print(f'PROCESSING WINDOW: {(start, end), [buffer_added]}, '
f'next: {(next_start, next_end)}, isLastTime: {is_last_time}')
current_progress += end - start
new_percent = int((current_progress * 100) / float(total_bp_span))
if new_percent > current_percent:
if new_percent <= 99 or (new_percent == 100 and not have_printed100):
if new_percent % 10 == 1:
print('-', end='', flush=True)
current_percent = new_percent
if current_percent == 100:
have_printed100 = True
skip_this_window = False
# compute coverage modifiers
coverage_avg = None
coverage_dat = [gc_window_size, gc_scale_val, []]
target_hits = 0
if input_bed is None:
coverage_dat[2] = [1.0] * (end - start)
else:
if ref_index[chrom][0] not in input_regions:
coverage_dat[2] = [off_target_scalar] * (end - start)
else:
for j in range(start, end):
if not (bisect.bisect(input_regions[ref_index[chrom][0]], j) % 2):
coverage_dat[2].append(1.0)
target_hits += 1
else:
coverage_dat[2].append(off_target_scalar)
# off-target and we're not interested?
if off_target_discard and target_hits <= read_len:
coverage_avg = 0.0
skip_this_window = True
# print len(coverage_dat[2]), sum(coverage_dat[2])
if sum(coverage_dat[2]) < low_cov_thresh:
coverage_avg = 0.0
skip_this_window = True
# check for small window sizes
if (end - start) < overlap_min_window_size:
skip_this_window = True
if skip_this_window:
# skip window, save cpu time
start = next_start
end = next_end
if is_last_time:
break
if end >= final_position:
is_last_time = True
vars_from_prev_overlap = []
continue
# construct sequence data that we will sample reads from
if sequences is None:
sequences = SequenceContainer(start, ref_sequence[start:end], ploids, overlap, read_len,
[mut_model] * ploids, mut_rate, only_vcf=only_vcf)
if [cigar for cigar in sequences.all_cigar[0] if len(cigar) != 100] or \
[cig for cig in sequences.all_cigar[1] if len(cig) != 100]:
print("There's a cigar that's off.")
# pdb.set_trace()
sys.exit(1)
else:
sequences.update(start, ref_sequence[start:end], ploids, overlap, read_len, [mut_model] * ploids,
mut_rate)
if [cigar for cigar in sequences.all_cigar[0] if len(cigar) != 100] or \
[cig for cig in sequences.all_cigar[1] if len(cig) != 100]:
print("There's a cigar that's off.")
# pdb.set_trace()
sys.exit(1)
# insert variants
sequences.insert_mutations(vars_from_prev_overlap + vars_in_window)
all_inserted_variants = sequences.random_mutations()
# print all_inserted_variants
# init coverage
if sum(coverage_dat[2]) >= low_cov_thresh:
if paired_end:
coverage_avg = sequences.init_coverage(tuple(coverage_dat), frag_dist=fraglen_distribution)
else:
coverage_avg = sequences.init_coverage(tuple(coverage_dat))
# unused cancer stuff
if cancer:
tumor_sequences = SequenceContainer(start, ref_sequence[start:end], ploids, overlap, read_len,
[cancer_model] * ploids, mut_rate, coverage_dat)
tumor_sequences.insert_mutations(vars_cancer_from_prev_overlap + all_inserted_variants)
all_cancer_variants = tumor_sequences.random_mutations()
# which variants do we need to keep for next time (because of window overlap)?
vars_from_prev_overlap = []
vars_cancer_from_prev_overlap = []
for n in all_inserted_variants:
if n[0] >= end - overlap - 1:
vars_from_prev_overlap.append(n)
if cancer:
for n in all_cancer_variants:
if n[0] >= end - overlap - 1:
vars_cancer_from_prev_overlap.append(n)
# if we're only producing VCF, no need to go through the hassle of generating reads
if only_vcf:
pass
else:
window_span = end - start
if paired_end:
if force_coverage:
reads_to_sample = int((window_span * float(coverage)) / (2 * read_len)) + 1
else:
reads_to_sample = int((window_span * float(coverage) * coverage_avg) / (2 * read_len)) + 1
else:
if force_coverage:
reads_to_sample = int((window_span * float(coverage)) / read_len) + 1
else:
reads_to_sample = int((window_span * float(coverage) * coverage_avg) / read_len) + 1
# if coverage is so low such that no reads are to be sampled, skip region
# (i.e., remove buffer of +1 reads we add to every window)
if reads_to_sample == 1 and sum(coverage_dat[2]) < low_cov_thresh:
reads_to_sample = 0
# sample reads
for k in range(reads_to_sample):
is_unmapped = []
if paired_end:
my_fraglen = fraglen_distribution.sample()
my_read_data = sequences.sample_read(se_class, my_fraglen)
# skip if we failed to find a valid position to sample read
if my_read_data is None:
continue
if my_read_data[0][0] is None:
is_unmapped.append(True)
else:
is_unmapped.append(False)
# adjust mapping position based on window start
my_read_data[0][0] += start
if my_read_data[1][0] is None:
is_unmapped.append(True)
else:
is_unmapped.append(False)
my_read_data[1][0] += start
else:
my_read_data = sequences.sample_read(se_class)
# skip if we failed to find a valid position to sample read
if my_read_data is None:
continue
# unmapped read (lives in large insertion)
if my_read_data[0][0] is None:
is_unmapped = [True]
else:
is_unmapped = [False]
# adjust mapping position based on window start
my_read_data[0][0] += start
# are we discarding offtargets?
outside_boundaries = []
if off_target_discard and input_bed is not None:
outside_boundaries += [bisect.bisect(input_regions[ref_index[chrom][0]], n[0]) % 2 for n
in my_read_data]
outside_boundaries += [
bisect.bisect(input_regions[ref_index[chrom][0]], n[0] + len(n[2])) % 2 for n in
my_read_data]
if discard_bed is not None:
outside_boundaries += [bisect.bisect(discard_regions[ref_index[chrom][0]], n[0]) % 2 for
n in my_read_data]
outside_boundaries += [
bisect.bisect(discard_regions[ref_index[chrom][0]], n[0] + len(n[2])) % 2 for n in
my_read_data]
if len(outside_boundaries) and any(outside_boundaries):
continue
my_read_name = out_prefix_name + '-' + ref_index[chrom][0] + '-' + str(read_name_count)
read_name_count += len(my_read_data)
# if desired, replace all low-quality bases with Ns
if n_max_qual > -1:
for j in range(len(my_read_data)):
my_read_string = [n for n in my_read_data[j][2]]
for m in range(len(my_read_data[j][3])):
adjusted_qual = ord(my_read_data[j][3][m]) - se_class.off_q
if adjusted_qual <= n_max_qual:
my_read_string[m] = 'N'
my_read_data[j][2] = ''.join(my_read_string)
# flip a coin, are we forward or reverse strand?
is_forward = (random.random() < 0.5)
# if read (or read + mate for PE) are unmapped, put them at end of bam file
if all(is_unmapped):
if paired_end:
if is_forward:
flag1 = sam_flag(['paired', 'unmapped', 'mate_unmapped', 'first', 'mate_reverse'])
flag2 = sam_flag(['paired', 'unmapped', 'mate_unmapped', 'second', 'reverse'])
else:
flag1 = sam_flag(['paired', 'unmapped', 'mate_unmapped', 'second', 'mate_reverse'])
flag2 = sam_flag(['paired', 'unmapped', 'mate_unmapped', 'first', 'reverse'])
unmapped_records.append((my_read_name + '/1', my_read_data[0], flag1))
unmapped_records.append((my_read_name + '/2', my_read_data[1], flag2))
else:
flag1 = sam_flag(['unmapped'])
unmapped_records.append((my_read_name + '/1', my_read_data[0], flag1))
my_ref_index = indices_by_ref_name[ref_index[chrom][0]]
# write SE output
if len(my_read_data) == 1:
if not no_fastq:
if is_forward:
output_file_writer.write_fastq_record(my_read_name, my_read_data[0][2],
my_read_data[0][3])
else:
output_file_writer.write_fastq_record(my_read_name,
reverse_complement(my_read_data[0][2]),
my_read_data[0][3][::-1])
if save_bam:
if is_unmapped[0] is False:
if is_forward:
flag1 = 0
output_file_writer.write_bam_record(my_ref_index, my_read_name,
my_read_data[0][0],
my_read_data[0][1], my_read_data[0][2],
my_read_data[0][3],
output_sam_flag=flag1)
else:
flag1 = sam_flag(['reverse'])
output_file_writer.write_bam_record(my_ref_index, my_read_name,
my_read_data[0][0],
my_read_data[0][1], my_read_data[0][2],
my_read_data[0][3],
output_sam_flag=flag1)
# write PE output
elif len(my_read_data) == 2:
if no_fastq is not True:
output_file_writer.write_fastq_record(my_read_name, my_read_data[0][2],
my_read_data[0][3],
read2=my_read_data[1][2],
qual2=my_read_data[1][3],
orientation=is_forward)
if save_bam:
if is_unmapped[0] is False and is_unmapped[1] is False:
if is_forward:
flag1 = sam_flag(['paired', 'proper', 'first', 'mate_reverse'])
flag2 = sam_flag(['paired', 'proper', 'second', 'reverse'])
else:
flag1 = sam_flag(['paired', 'proper', 'second', 'mate_reverse'])
flag2 = sam_flag(['paired', 'proper', 'first', 'reverse'])
output_file_writer.write_bam_record(my_ref_index, my_read_name, my_read_data[0][0],
my_read_data[0][1], my_read_data[0][2],
my_read_data[0][3],
output_sam_flag=flag1,
mate_pos=my_read_data[1][0])
output_file_writer.write_bam_record(my_ref_index, my_read_name, my_read_data[1][0],
my_read_data[1][1], my_read_data[1][2],
my_read_data[1][3],
output_sam_flag=flag2, mate_pos=my_read_data[0][0])
elif is_unmapped[0] is False and is_unmapped[1] is True:
if is_forward:
flag1 = sam_flag(['paired', 'first', 'mate_unmapped', 'mate_reverse'])
flag2 = sam_flag(['paired', 'second', 'unmapped', 'reverse'])
else:
flag1 = sam_flag(['paired', 'second', 'mate_unmapped', 'mate_reverse'])
flag2 = sam_flag(['paired', 'first', 'unmapped', 'reverse'])
output_file_writer.write_bam_record(my_ref_index, my_read_name, my_read_data[0][0],
my_read_data[0][1], my_read_data[0][2],
my_read_data[0][3],
output_sam_flag=flag1, mate_pos=my_read_data[0][0])
output_file_writer.write_bam_record(my_ref_index, my_read_name, my_read_data[0][0],
my_read_data[1][1], my_read_data[1][2],
my_read_data[1][3],
output_sam_flag=flag2, mate_pos=my_read_data[0][0],
aln_map_quality=0)
elif is_unmapped[0] is True and is_unmapped[1] is False:
if is_forward:
flag1 = sam_flag(['paired', 'first', 'unmapped', 'mate_reverse'])
flag2 = sam_flag(['paired', 'second', 'mate_unmapped', 'reverse'])
else:
flag1 = sam_flag(['paired', 'second', 'unmapped', 'mate_reverse'])
flag2 = sam_flag(['paired', 'first', 'mate_unmapped', 'reverse'])
output_file_writer.write_bam_record(my_ref_index, my_read_name, my_read_data[1][0],
my_read_data[0][1], my_read_data[0][2],
my_read_data[0][3],
output_sam_flag=flag1, mate_pos=my_read_data[1][0],
aln_map_quality=0)
output_file_writer.write_bam_record(my_ref_index, my_read_name, my_read_data[1][0],
my_read_data[1][1], my_read_data[1][2],
my_read_data[1][3],
output_sam_flag=flag2, mate_pos=my_read_data[1][0])
else:
print('\nError: Unexpected number of reads generated...\n')
sys.exit(1)
if not is_last_time:
output_file_writer.flush_buffers(bam_max=next_start)
else:
output_file_writer.flush_buffers(bam_max=end + 1)
# tally up all the variants that got successfully introduced
for n in all_inserted_variants:
all_variants_out[n] = True
# prepare indices of next window
start = next_start
end = next_end
if is_last_time:
break
if end >= final_position:
is_last_time = True
print(']', flush=True)
if only_vcf:
print('VCF generation completed in ', end='')
else:
print('Read sampling completed in ', end='')
print(int(time.time() - tt), '(sec)')
# write all output variants for this reference
if save_vcf:
print('Writing output VCF...')
for k in sorted(all_variants_out.keys()):
current_ref = ref_index[chrom][0]
my_id = '.'
my_quality = '.'
my_filter = 'PASS'
# k[0] + 1 because we're going back to 1-based vcf coords
output_file_writer.write_vcf_record(current_ref, str(int(k[0]) + 1), my_id, k[1], k[2], my_quality,
my_filter, k[4])
# write unmapped reads to bam file
if save_bam and len(unmapped_records):
print('writing unmapped reads to bam file...')
for umr in unmapped_records:
if paired_end:
output_file_writer.write_bam_record(-1, umr[0], 0, umr[1][1], umr[1][2], umr[1][3], output_sam_flag=umr[2],
mate_pos=0,
aln_map_quality=0)
else:
output_file_writer.write_bam_record(-1, umr[0], 0, umr[1][1], umr[1][2], umr[1][3], output_sam_flag=umr[2],
aln_map_quality=0)
# close output files
output_file_writer.close_files()
if cancer:
output_file_writer_cancer.close_files()
if __name__ == '__main__':
main()