-
Notifications
You must be signed in to change notification settings - Fork 0
/
benchlib.py
420 lines (395 loc) · 15.2 KB
/
benchlib.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
#Written by CRE. 20201013.
import sys
def calcOverlap(B1,E1,B2,E2):
if B1<=E2 and B1>=B2:
Overlap=min(E2-B1,E1-B1)
elif E1>=B2 and E1<=E2:
Overlap=E1-B2
elif B2>=B1 and B2<=E1:#1 covers 2
Overlap=E2-B2
else:
Overlap=-1
return Overlap
def inclusion(In1,In2):#return 0: not overlapped, 1: overlapped, 2: In1 include In2, 3: In2 inlcude In1, 4: identical
if In1==In2:
return 4
elif In1[0]>=In2[0] and In1[1]<=In2[1]:
return 3
elif In1[0]<=In2[0] and In1[1]>=In2[1]:
return 2
elif In1[0]>=In2[0] and In1[0]<=In2[1] or In1[1]>=In2[0] and In1[1]<=In2[1]:
return 1
return 0
class Variant:
def __init__(self,Sample="",Type="",Chrom="",Start=0,End=0,SC=None,CS=None):
self.Type=Type
self.Chrom=Chrom
self.Start=Start
self.End=End
self.Sample=Sample
self.Length=self.End-self.Start
self.CS=CS
self.SC=SC
self.MatchTo=None
def __str__(self):
Scores=""
if self.SC!=None:
Scores+=",SC:%s"%self.SC
if self.CS!=None:
Scores+=",CS:%s"%self.CS
return "[%s]%s:%s-%s,%s,%s%s"%(self.Sample,self.Chrom,self.Start,self.End,self.End-self.Start,self.Type,Scores)
def match(self,Other,Mode=0.8):#if Mode="inclusion" use inclusion, else use Mode percentage overlap
if self.Type!=Other.Type or self.Chrom!=Other.Chrom:
return False
if Mode=="inclusion":
if inclusion((self.Start,self.End),(Other.Start,Other.End))>1:
return True
return False
else:
Overlap=calcOverlap(self.Start,self.End,Other.Start,Other.End)
if Overlap/self.Length>=Mode and Overlap/Other.Length>=Mode:
return True
return False
def __lt__(self,other):
if self.Chrom<other.Chrom:
return True
if self.Chrom>other.Chrom:
return False
if self.Start<other.Start:
return True
if self.Start>other.Start:
return False
if self.End<other.End:
return True
return False
def __gt__(self,other):
if self<other:
return False
if self.Chrom==other.Chrom and self.Start==other.Start and self.End==other.End:
return False
return True
def __eq__(self,other):
if other==None:
return False
if self<other:
return False
if self>other:
return False
return self.Sample==other.Sample
class Sample:
def __init__(self,Name):
self.Name=Name
self.Variants=[]
self.IndexParameter=10000
#self.IndexedLength=0#list length last time indexing taken place
self.Index={}#by chrom
self.Chroms=[]
self.ChromIndex=None
def addVariant(self,NewVariant):
self.Variants.append(NewVariant)
AddChrom=True
for c in self.Chroms:
if c==NewVariant.Chrom:
AddChrom=False
break
if AddChrom:
self.Chroms.append(NewVariant.Chrom)
self.Chroms.sort()
self.Variants.sort()
def addVariantRaw(self,NewVariant):#without sorting, need call force sort afterwards
self.Variants.append(NewVariant)
AddChrom=True
for c in self.Chroms:
if c==NewVariant.Chrom:
AddChrom=False
break
if AddChrom:
self.Chroms.append(NewVariant.Chrom)
def forceSort(self):
self.Variants.sort()
self.Chroms.sort()
def forceIndex(self):#must call after sorted
self.ChromIndex=set()
for c in self.Chroms:
self.ChromIndex.add(c)
if len(self.Variants)==0:
self.Index={}
else:
self.Index={}
IndexLength=int(self.Variants[-1].Start/self.IndexParameter)
FirstStartOccurredAt=0
if len(self.Chroms)!=0:
Chrom=self.Chroms[0]
self.Index[Chrom]=[0]
i=0
while FirstStartOccurredAt<len(self.Variants):
if self.Variants[FirstStartOccurredAt].Start>=i*self.IndexParameter:
self.Index[Chrom].append(FirstStartOccurredAt)
i+=1
if self.Variants[FirstStartOccurredAt].Chrom!=Chrom:
Chrom=self.Variants[FirstStartOccurredAt].Chrom
self.Index[Chrom]=[0]
i=0
FirstStartOccurredAt+=1
def getStartIndex(self,Chrom,Start):
if self.ChromIndex!=None:
if Chrom not in self.ChromIndex:
return len(self.Variants)
else:
NoChrom=True
for c in self.Chroms:
if c==Chrom:
NoChrom=False
break
if NoChrom:
return len(self.Variants)
i=0
if len(self.Index)!=0:
if Chrom in self.Index.keys():
try:
i=self.Index[Chrom][int(Start/self.IndexParameter)]
except:#beyond index
i=self.Index[Chrom][-1]
while i<len(self.Variants) and self.Variants[i].Start<Start:
i+=1
return i
def match(self,other,Mode=0.8):# returns ([All matched self variants],per other matched variant)
Result=[]
if Mode!="inclusion":
ratio=Mode
for v in other.Variants:
start=0 if v.Start-v.Length/ratio-1<0 else int(v.Start-v.Length/ratio-1)
end=v.End+1
#SI=self.getStartIndex(v.Chrom,start)
#EI=self.getStartIndex(v.Chrom,end)
SI=0
EI=len(self.Variants)
TempPair=([],v)
for i in range(SI,EI):
if self.Variants[i].match(v,Mode):
TempPair[0].append(self.Variants[i])
self.Variants[i].MatchTo=v
if len(TempPair[0])!=0:
Result.append(TempPair)
return Result
class Record:
def __init__(self,Chrom="",Start=0,End=0):
self.Chrom=Chrom
self.Start=Start
self.End=End
self.Length=self.End-self.Start
self.Variants=[]
self.Samples={}
def addVariant(self,NewVariant):
self.Variants.append(NewVariant)
if NewVariant.Sample in self.Samples.keys():
self.Samples[NewVariant.Sample].append(NewVariant)
else:
self.Samples[NewVariant.Sample]=[NewVariant]
import pysam
class VariantRecords:
def __init__(self,Name=""):
self.Variants=[]
self.Name=Name
self.Records=[]
self.Samples={}
def getSample(self, SampleName):
if SampleName not in self.Samples.keys():
self.Samples[SampleName]=Sample(SampleName)
return self.Samples[SampleName]
def matchSample(self,Other,SampleName,Mode=0.8):#other as standard
try:
return self.Samples[SampleName].match(Other.Samples[SampleName],Mode)
except Exception:
return None
def printSample(self,SampleName):
for v in self.Samples[SampleName].Variants:
print(v)
def matchAll(self,Other,Mode=0.8):#other as standard
Result={}
Result["Samples"]={}
RSamples=Result["Samples"]
Result["Self"]=self
Result["Other"]=Other
for SN in Other.Samples.keys():
if SN in self.Samples.keys():
RSamples[SN]=self.Samples[SN].match(Other.Samples[SN],Mode)
else:
RSamples[SN]=None
return Result
def interpret(self,maresult,PR=False,Merged=(0,0,0,0)):
OtherN=0
SelfN=0
Matched=0
SelfMatched=0
OtherDupN=0
OtherDelN=0
MatchedDup=0
MatchedDel=0
SelfDupN=0
SelfDelN=0
SelfMatchedDup=0
SelfMatchedDel=0
RSamples=maresult["Samples"]
Other=maresult["Other"]
SelfN=len(self.Variants)
OtherN=len(Other.Variants)
for v in self.Variants:
if v.Type.upper()=="DEL":
SelfDelN+=1
elif v.Type.upper()=="DUP":
SelfDupN+=1
for v in Other.Variants:
if v.Type.upper()=="DEL":
OtherDelN+=1
elif v.Type.upper()=="DUP":
OtherDupN+=1
for SN in Other.Samples.keys():
if RSamples[SN]!=None:
Matched+=len(RSamples[SN])
for i in range(len(RSamples[SN])):
SelfMatched+=len(RSamples[SN][i][0])
if RSamples[SN][i][1].Type.upper()=="DEL":
MatchedDel+=1
SelfMatchedDel+=len(RSamples[SN][i][0])
elif RSamples[SN][i][1].Type.upper()=="DUP":
MatchedDup+=1
SelfMatchedDup+=len(RSamples[SN][i][0])
SelfDelN-=Merged[0]
SelfDupN-=Merged[1]
SelfN-=Merged[1]+Merged[0]
SelfMatchedDel-=Merged[2]
SelfMatchedDup-=Merged[3]
SelfMatched-=Merged[2]+Merged[3]
AS=Matched/OtherN if OtherN!=0 else 0
AP=SelfMatched/SelfN if SelfN!=0 else 0
AF1=2*(AS*AP)/(AS+AP) if (AS+AP)!= 0 else 0
DS=MatchedDel/OtherDelN if OtherDelN!=0 else 0
DP=SelfMatchedDel/SelfDelN if SelfDelN!=0 else 0
DF1=2*(DS*DP)/(DS+DP) if (DS+DP)!= 0 else 0
DuS=MatchedDup/OtherDupN if OtherDupN!=0 else 0
DuP=SelfMatchedDup/SelfDupN if SelfDupN!=0 else 0
DuF1=2*(DuS*DuP)/(DuS+DuP) if (DuS+DuP)!= 0 else 0
Out= "All: Sensitivity: %s (%s/%s), PPV: %s (%s/%s), F1: %s\nDel: Sensitivity: %s (%s/%s), PPV: %s (%s/%s), F1: %s\nDup: Sensitivity: %s (%s/%s), PPV: %s (%s/%s), F1: %s"%(\
AS,Matched,OtherN,AP,SelfMatched,SelfN,AF1\
,DS,MatchedDel,OtherDelN,DP,SelfMatchedDel,SelfDelN,DF1\
,DuS,MatchedDup,OtherDupN,DuP,SelfMatchedDup,SelfDupN,DuF1
)#PPV:positive predictive value,1-FDR
if PR:
for SN in Other.Samples.keys():
if RSamples[SN]!=None:
for i in range(len(RSamples[SN])):
Out+="\nGS:%s..."%RSamples[SN][i][1]
for j in range(len(RSamples[SN][i][0])):
if j!=0:
Out+=","
Out+="%s"%RSamples[SN][i][0][j]
Out+="\n%s\t%s\t%s\t%s\n%s\t%s\t%s\t%s"%(OtherDelN,MatchedDel,SelfDelN,SelfMatchedDel,OtherDupN,MatchedDup,SelfDupN,SelfMatchedDup)
return Out
def parseVcfCNV(self,filename,contigs=None,samples=None,MinLength=0,MaxAF=1,MinScore=0):
vcf=pysam.VariantFile(filename,"r")
result=[]
included={}
includedSamples={}
NoAFInfoWarn=False
if contigs!=None:
for c in contigs:
included[c]=True
if samples!=None:
for s in samples:
includedSamples[s.upper()]=True
for record in vcf.fetch():
End=record.pos
try:
End=record.pos+abs(record.info["SVLEN"])
except:
try:
End=record.pos+abs(record.info["SVLEN"][0])
except:
try:
End=record.info["END"]
except:
try:
End=record.stop
except:
pass
try:
Length=End-record.pos
if Length<MinLength:
continue
chrom=record.chrom
#if len(record.chrom)<3 and (int(record.chrom[:2])<23 or record.chrom.upper()=="X" or record.chrom.upper()=="Y"):
# chrom="chr"+record.chrom
if contigs!=None:
if not chrom in included.keys():
continue
CNAlts=[1]
tempRecord=Record(chrom,record.pos,End)
SC=None
try:
SC=float(record.info["SC"])
except:
pass
if MinScore!=0 and SC!=None:
if SC<MinScore:
continue
AFs=[1]
Ai=0
CNVAlt=False
for a in record.alts:
if "<CNV>" in a:
CNVAlt=True
elif "<CN" in a:
CNAlts.append(int(a[a.find("<CN")+3:-1]))
elif "DEL" in a.upper():
CNAlts.append(0)
elif "DUP" in a.upper():
CNAlts.append(2)
else:
CNAlts.append(1)
AF=1
try:
AF=record.info["AF"][Ai]
except:
NoAFInfoWarn=True
AFs.append(AF)
Ai+=1
try:
for s in record.samples:
SampleName=record.samples[s].name
if samples==None or SampleName in includedSamples.keys():
if record.samples[s].allele_indices!=(0,0):
CN=2
CS=None
try:
CS=record.samples[s]["CS"]
except:
pass
if CNVAlt==True:
CN=record.samples[s]["CN"]
elif record.info["SVTYPE"]=="DEL" or record.info["SVTYPE"]=="DUP" or record.info["SVTYPE"]=="CNV":
CN=CNAlts[record.samples[s].allele_indices[0]]+CNAlts[record.samples[s].allele_indices[1]]
if CN==2:
continue
if not CNVAlt and AFs[record.samples[s].allele_indices[0]]>MaxAF and AFs[record.samples[s].allele_indices[1]]>MaxAF:
continue
else:
if CN<2:
SVType="DEL"
else:
SVType="DUP"
self.Variants.append(Variant(SampleName,SVType,chrom,record.pos,End,SC,CS))
self.getSample(SampleName).addVariantRaw(self.Variants[-1])
tempRecord.addVariant(self.Variants[-1])
except Exception as e:
continue
self.Records.append(tempRecord)
except:
continue
for SN in self.Samples.keys():
self.Samples[SN].forceSort()
self.Samples[SN].forceIndex()
vcf.close()
if MaxAF!=1 and NoAFInfoWarn:
print("[WARN] There are alleles don't have AF info!",file=sys.stderr)
return self.Records