forked from Maggi-Chen/DeBreak
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdebreak_resdup_selfalignment.py
More file actions
145 lines (118 loc) · 4.21 KB
/
debreak_resdup_selfalignment.py
File metadata and controls
145 lines (118 loc) · 4.21 KB
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
import os
import time
def check_dup(insinfo,writepath):
allinfo=open(writepath+'debreak_resdup_map_space/'+insinfo+'.paf','r').read().split('\n')[:-1]
if len(allinfo)==0:
return (0,0)
numsupp=0.0
suppread=[]
leftmost=[]
pos=int(insinfo.split('__')[2])+2000
for align in allinfo:
readname=align.split('\t')[0]
if readname in suppread or int(align.split('\t')[10])<0.7*int(align.split('\t')[1]) or align.split('\t')[4]!='+':
continue
start=int(align.split('\t')[7])
end=int(align.split('\t')[8])
if start<=pos<=end:
numsupp+=1
suppread+=[readname]
leftmost+=[int(align.split('\t')[7])]
leftmost.sort()
leftmost=leftmost[max(3,len(leftmost)//4)]
bpshift=max(0,pos-leftmost)
return (numsupp/int(insinfo.split('__')[3]),bpshift)
def sortdup(a):
return [a.split('\t')[0],int(a.split('\t')[1])]
def identify_duplication(vcflist,writepath,refpath):
ins=open(writepath+'insertion-merged','r').read().split('\n')[:-1]
reffile=open(refpath,'r').read().split('>')[1:]
refseq={}
for chrom in reffile:
chromname=chrom.split('\n')[0].split(' ')[0]
chromseq=''.join(chrom.split('\n')[1:])
refseq[chromname]=chromseq
os.system("mkdir "+writepath+"debreak_resdup_insertseq/")
os.system("mkdir "+writepath+"debreak_resdup_refseq/")
os.system("mkdir "+writepath+"debreak_resdup_map_space/")
insread={}
for sv in ins:
insinfo=sv.split('\t')[0]+'__'+sv.split('\t')[1]+'__'+sv.split('\t')[2]+'__'+sv.split('\t')[3]
readnames=sv.split('\t')[6].split(';')
for d in readnames:
insread[d]=insinfo
f=open(writepath+"debreak_resdup_refseq/"+insinfo+'.fa','w')
f.write('>'+insinfo+'\n')
f.write(refseq[sv.split('\t')[0]][int(sv.split('\t')[1])-2000-int(sv.split('\t')[2]):int(sv.split('\t')[1])+2000+int(sv.split('\t')[2])]+'\n')
f.close()
for vcffile in vcflist:
f=open(writepath+'sv_raw_calls/'+vcffile,'r')
a=f.readline()
while a!='':
if 'I-cigar' not in a or a.split('\t')[4] not in insread:
a=f.readline(); continue
readname=a.split('\t')[0]+'_'+a.split('\t')[1]+'_'+a.split('\t')[2]+'_'+a.split('\t')[4]
insinfo=insread[a.split('\t')[4]]
g=open(writepath+'debreak_resdup_insertseq/'+insinfo+'.fa','a')
insseq=a.split('\t')[8]
g.write('>'+readname+'\n'+insseq+'\n')
g.close()
a=f.readline()
f.close()
rescueddup=[]
trueins=[]
ff=open(writepath+'debreak_resdup_map_space/maprateinfo','w')
for sv in ins:
insinfo=sv.split('\t')[0]+'__'+sv.split('\t')[1]+'__'+sv.split('\t')[2]+'__'+sv.split('\t')[3]
try:
os.system('minimap2 -k 9 '+writepath+'debreak_resdup_refseq/'+insinfo+'.fa '+writepath+'debreak_resdup_insertseq/'+insinfo+'.fa -N 100 > '+writepath+'debreak_resdup_map_space/'+insinfo+'.paf')
(maprate,bpcorrection)=check_dup(insinfo,writepath)
except:
(maprate,bpcorrection)=(0.0,0)
ff.write(insinfo+'\t'+str(maprate)+'\n')
if maprate>=0.5:
sv=sv.split('\t')
sv[1]=str(int(sv[1])-bpcorrection)
sv='\t'.join(sv)
rescueddup+=[sv]
else:
trueins+=[sv]
ff.close()
f=open(writepath+'insertion-merged','w')
for sv in trueins:
f.write(sv+'\n')
f.close()
dup=open(writepath+'duplication-merged','r').read().split('\n')[:-1]
rescueddup=[cc.replace('Insertion','Duplication') for cc in rescueddup]
dup+=rescueddup
dup.sort(key=sortdup)
f=open(writepath+'duplication-merged','w')
for sv in dup:
f.write(sv+'\n')
f.close()
return 0
def clean_ins_dup(writepath):
alldup=open(writepath+'duplication-merged','r').read().split('\n')[:-1]
allins=open(writepath+'insertion-merged','r').read().split('\n')[:-1]
toremove=[]
for ins in allins:
for dup in alldup:
if ins.split('\t')[0]==dup.split('\t')[0] and 0.8<=int(ins.split('\t')[2])/float(dup.split('\t')[2])<=1/0.8 and abs(int(ins.split('\t')[1])-int(dup.split('\t')[1]))<=max(500,int(ins.split('\t')[2]),int(dup.split('\t')[2])):
toremove+=[ins]
alldup.remove(dup)
dup=dup.split('\t')
dup[3]=str(int(dup[3])+int(ins.split('\t')[3]))
dup[4]=str(int(dup[4])+int(ins.split('\t')[4]))
dup='\t'.join(dup)
alldup+=[dup]
break
allins=[c for c in allins if c not in toremove]
f=open(writepath+'insertion-merged','w')
for c in allins:
f.write(c+'\n')
f.close()
f=open(writepath+'duplication-merged','w')
for c in alldup:
f.write(c+'\n')
f.close()
return 0