forked from vorobieva/beta_solenoids
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgenerate_backbones.py
More file actions
executable file
·379 lines (293 loc) · 15.8 KB
/
Copy pathgenerate_backbones.py
File metadata and controls
executable file
·379 lines (293 loc) · 15.8 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
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
#! /usr/bin/env python
InfoString = '''
TO GENERATE BACKBONES AROUND STARTING STRUCTURE
WHICH MAY BE MODIFIED
BY STRECHING REPEAT REGION DESIGNATED BY NUMBER
'''
#'''
# libraries
from multiprocessing import Pool
from scipy import spatial
import itertools
import numpy as np
import subprocess
import argparse
import glob
import sys
import os
import re
if '-h' not in sys.argv:
import rosetta
# rosetta.init()
rosetta.init(extra_options = "-mute basic -mute core -mute protocols")
from rosetta.protocols import grafting
# from repo
import solenoid_tools
# '''
def dump_many_poses(IterablePoses, Tag):
for i, Pose in enumerate(IterablePoses):
rosetta.dump_pdb( Pose, '%s_n%d.pdb'%(Tag, (1+i)) )
def fuse(Pose1, Pose2, SubsetSize=2):
# Should continue to fiddle with the hardcoded var below,
# Originally 0.5, only good for indentical copies,
# then 1.5, works for close copy
# trying 2.0
MatchingResidueHash = solenoid_tools.match_superimposed_pose_residues(Pose1, Pose2, 1.5)
# checks there is a one to one correspondance for all residue matches
for MatchRes in MatchingResidueHash:
assert len(MatchingResidueHash[MatchRes]) <= 1
# list comprehension through matches, add one for each position with match
NofMatchRes = sum([ 1 for Match in MatchingResidueHash if len(MatchingResidueHash[Match]) ])
try:
assert SubsetSize <= NofMatchRes
except AssertionError:
dump_many_poses([Pose1, Pose2], 'FusedFusion')
# print 'MatchingResidueHash:', MatchingResidueHash
# print ' Designated subset length should not exceed that of the overlap between poses. Poses dumped for inspection '
assert SubsetSize <= NofMatchRes, ' Designated subset length should not exceed that of the overlap between poses. Poses dumped for inspection '
# contains positions like [ (MatchRes1InPose1, MatchRes1InPose2), (MatchRes2InPose1, MatchRes2InPose2) .. ]
CorrespondingResidues = []
# iterates through positions in pose1
for P1 in range( 1, Pose1.n_residue()+1 ):
if len(MatchingResidueHash[P1]) == 1:
P2 = MatchingResidueHash[P1][0]
CorrespondingResidues.append((P1, P2))
LengthIncenative = 1.2
BestRMSD = 999
BestSubset = []
BestTransformation = ()
for i in range( len(CorrespondingResidues) - SubsetSize + 1):
Pose1Coords = []
Pose2Coords = []
IterationsSubset = CorrespondingResidues[i:i+SubsetSize]
for ResidueMatch in IterationsSubset:
P1 = ResidueMatch[0]
P2 = ResidueMatch[1]
for AtomName in ['N','C','O','CA']:
Pose1Coords.append( list(Pose1.residue(P1).xyz(AtomName)) )
Pose2Coords.append( list(Pose2.residue(P2).xyz(AtomName)) )
# makes (subset length)by3 array out of list of lists
Pose1Array = np.array(Pose1Coords)
Pose2Array = np.array(Pose2Coords)
RMSD, Rotation, Translation = solenoid_tools.rmsd_2_np_arrays_rosetta(Pose1Array, Pose2Array)
if RMSD < BestRMSD:
BestRMSD = RMSD
BestSubset = IterationsSubset
BestTransformation = ( Rotation, Translation )
# Unpack within overlap subset and corresponding transformation vectors
Rotation, Translation = BestTransformation
rosetta.Pose.apply_transform_Rx_plus_v(Pose2, Rotation, Translation)
# print 'BestSubset', BestSubset
# make a lot of sense for even overlaps, makes less sense for odd overlaps
Cutpoint = SubsetSize / 2
EndOfPose1 = BestSubset[Cutpoint-1][0]
StartOfPose2 = BestSubset[Cutpoint][1]
# print 'EndOfPose1', EndOfPose1
# print 'StartOfPose2', StartOfPose2
FusionPose = grafting.return_region(Pose1, 1, EndOfPose1)
# rosetta.dump_pdb(FusionPose, 'FusionPose1.pdb')
for Pose2Position in range( StartOfPose2, Pose2.n_residue()+1 ):
Pose2Residue = Pose2.residue(Pose2Position)
FusionPose.append_residue_by_bond(Pose2Residue)
return FusionPose, BestRMSD, CorrespondingResidues
def get_residue_array(Pose, Residues):
CoordList = []
for Residue in Residues:
for AtomName in ['N','C','O','CA']:
CoordList.append( list(Pose.residue(Residue).xyz(AtomName)) )
return np.array(CoordList)
def extrapolate_repeat_pose(Repeat1Pose, Repeat2Pose, Duplications):
''' MUST give two overlapping, equal length, one-repeat-unit long poses !!! '''
assert Repeat1Pose.n_residue() == Repeat2Pose.n_residue(), ' Repeat poses must be same length '
RepeatLength = Repeat1Pose.n_residue()
Residues = [P for P in range(1, RepeatLength+1)]
# First fusion is easy since the input poses contain duplicate residues
FusionPose, RMSD, CorrespondingResidues = fuse(Repeat1Pose, Repeat2Pose)
#
# Copy and store first subunit as base unit for subsequent transformations/fusions
FusionBasePose = rosetta.Pose()
FusionBasePose.assign(FusionPose)
# rosetta.dump_pdb(FusionBasePose, 'FusionBasePose.pdb')
# Umatched region should be N terminal region of repeat pose 1 without matching pose 2 residues
# Used repeated during loop below to superimpose on to end of growing fusion pose
UnmatchedPose1Residues = [ Number for Number in range(1, CorrespondingResidues[0][0]) ]
# N-terminal end of repeat unit pose 1 that extends past repeat unit pose 2
NterminalUnmatchedArray = get_residue_array(Repeat1Pose, UnmatchedPose1Residues)
# one iteration is run for each duplication event,
# each time add a fusion pose to end of growing
for Duplication in range(Duplications):
# Grabs residue from back of RepeatPose2 for each unmatched residue at begining of Pose1
EndMatch = []
# also start making array of coord
for UnmatchResidue in UnmatchedPose1Residues:
EndMatch.append(Residues[-1*UnmatchResidue])
EndMatch.reverse()
EndMatchArray = get_residue_array(Repeat2Pose, EndMatch)
# print 'EndMatch', EndMatch
RMSD, rMtx, tVec = solenoid_tools.rmsd_2_np_arrays_rosetta( EndMatchArray, NterminalUnmatchedArray )
# print 'Corse RMSD: ', RMSD
# print 'rMtx: ', rMtx
# print 'tVec: ', tVec
DuplicatePose = rosetta.Pose()
DuplicatePose.assign(FusionBasePose)
rosetta.Pose.apply_transform_Rx_plus_v(DuplicatePose, rMtx, tVec)
# rosetta.dump_pdb(DuplicatePose, 'Dup%d_DuplicatePose.pdb'%Duplication)
FusionPose, RMSD, CorrespondingResidues = fuse(FusionPose, DuplicatePose)
# print 'Refined RMSD', RMSD
# rosetta.dump_pdb(FusionPose, 'Dup%d_FusionPose.pdb'%Duplication)
NterminalUnmatchedArray = get_residue_array(FusionPose, UnmatchedPose1Residues)
Residues = [ P for P in range(1, FusionPose.n_residue() + 1) ]
Repeat2Pose = rosetta.Pose()
Repeat2Pose.assign(FusionPose)
# rosetta.dump_pdb(Repeat2Pose, 'Dup%d_NewRepeat2Pose.pdb'%Duplication)
return FusionPose
def pose_repeat_unit_finder(Pose, RepeatChains=False, MinRepeats=3, DistanceTarget=4.7, DistanceFlex=0.5, AngleFlex=15.0):
''' Default settings are for beta solenoids !!!
for off roading give pose and '''
if RepeatChains == False:
# following lines find primary sequence repeats to duplicate
'''(self, Pose, MinRepeats=3, DistanceTarget=4.7, DistanceFlex=0.5, AngleFlex=15.0 )'''
wDag = solenoid_tools.pose_wdag(Pose, MinRepeats, DistanceTarget, DistanceFlex, AngleFlex)
wDag.find_downstream_neighbors()
RepeatChains = wDag.find_repeat_chains()
# print 'RepeatChains', RepeatChains
# ConsolidatedRepeatStarts, TandemRepeats = solenoid_tools.consolidate_repeats(RepeatChains)
# print 'ConsolidatedRepeatStarts, TandemRepeats'
# print ConsolidatedRepeatStarts, TandemRepeats
RepeatStretchesByLengthHash, TandemIndenticalSpacings = solenoid_tools.better_consolidate_repeats(RepeatChains)
# print 'RepeatStretchesByLengthHash, TandemIndenticalSpacings'
# print RepeatStretchesByLengthHash, TandemIndenticalSpacings
return TandemIndenticalSpacings, RepeatStretchesByLengthHash
# sys.exit()
# return ConsolidatedRepeatStarts, TandemRepeats, RepeatStretchesByLengthHash
# sys.argv = [sys.argv[0], '-pdbs', '1m8n/1M8N.pdb', '3ult/3ult.pdb', '-repeat', '8', '-max_turns_per_repeat', '3', '-out', 'AllRepeats']
def detect_and_expand_repeats(InputTuple):
Args, Pdb = InputTuple
print 'Pdb:', Pdb
# get name base for output pdbs
InputPdbStem = Pdb.split('/')[-1].replace('.pdb', '')
print 'StemName:', InputPdbStem
# load Pdb into rosetta pose
Pose = rosetta.pose_from_pdb(Pdb)
Pose.pdb_info(rosetta.core.pose.PDBInfo( Pose ))
# Get repeat unit poses from function above
if Args.repeat_residues == False:
TandemRepeats, RepeatStretchesByLengthHash = pose_repeat_unit_finder(Pose)
else:
RepeatChains = Args.repeat_residues.split('__')
RepeatChains = [ [ int(Number) for Number in Chain.split('_') ] for Chain in RepeatChains]
# print 'RepeatChains', RepeatChains
# sys.exit()
TandemRepeats, RepeatStretchesByLengthHash = pose_repeat_unit_finder(Pose, RepeatChains)
# RepeatStretchesByLengthHash[12] = [[14, 15, 16, 17, 18, 21]]
# ConsolidatedRepeatStarts.extend([45,46,47])
# print 'ConsolidatedRepeatStarts', ConsolidatedRepeatStarts
# print 'RepeatStretchesByLengthHash', RepeatStretchesByLengthHash
# print 'TandemRepeats', TandemRepeats
# InputPoseRepeatNumber = len(TandemRepeats[ConsolidatedRepeatStarts[0]])
AllExtrapolationsByRepeatLength = {}
print 'TandemRepeats:', TandemRepeats
print 'RepeatStretchesByLengthHash:', RepeatStretchesByLengthHash
# print
# MaxTurns = Args.max_turns_per_repeat
count = 1
for RepeatUnitLength in RepeatStretchesByLengthHash:
# UniformLength = Args.repeat * RepeatUnitLength
ExtrapolationList = []
MinLength = 9000000000 # will break if pose has more than 9 billion residues
print 'RepeatUnitLength', RepeatUnitLength
for RepeatStretch in RepeatStretchesByLengthHash[RepeatUnitLength]:
print 'RepeatStretch', RepeatStretch
# gets all pairwise combinations of repeat combinations, second arg should ALWAYS be 2, unless manger overhaul is performed
for RepeatUnitCombo in itertools.combinations(RepeatStretch, 2):
# print 'RepeatUnitCombo', RepeatUnitCombo
RepeatUnit1Start, RepeatUnit2Start = RepeatUnitCombo
assert RepeatUnit1Start <= RepeatUnit2Start, ' RepeatUnit1 must begin before RepeatUnit2 '
TandemRepeats1 = TandemRepeats[RepeatUnit1Start]
TandemRepeats2 = TandemRepeats[RepeatUnit2Start]
# Whichever position starts the fewest tandem repeats dicates how far to shift
Shifts = min(len(TandemRepeats1), len(TandemRepeats2))
# How max number of turns to include per repeat depends on available repeats, and uner input max
MaxTurns = min( Args.max_turns_per_repeat, Shifts)
if (RepeatUnit1Start + Args.min_overlap) <= RepeatUnit2Start <= (RepeatUnit1Start + RepeatUnitLength - Args.min_overlap):
# print
# print 'Selected RepeatUnitCombo:', RepeatUnitCombo
# print 'RepeatUnit1Start, repeats ', RepeatUnit1Start, TandemRepeats[RepeatUnit1Start]
# print 'RepeatUnit2Start, repeats ', RepeatUnit2Start, TandemRepeats[RepeatUnit2Start]
for NumTurns in range(1, MaxTurns+1):
# print '\n'*5
# print 'NumTurns', NumTurns
ModLength = NumTurns * RepeatUnitLength
# print 'ModLength', ModLength
ModUniformLength = Args.repeat * ModLength
# print 'ModUniformLength1', ModUniformLength
for Shift in range((Shifts/NumTurns)):
# print 'Shift', Shift
ModRep1Start = RepeatUnit1Start + (Shift*ModLength)
ModRep2Start = RepeatUnit2Start + (Shift*ModLength)
Overlap = ModRep2Start - ModRep1Start
ModRep1End = ModRep1Start + ModLength - 1
ModRep2End = ModRep2Start + ModLength - 1
# print 'ModRep1Start, ModRep1End', ModRep1Start, ModRep1End
# print 'ModRep2Start, ModRep2End', ModRep2Start, ModRep2End
Repeat1Unit = grafting.return_region(Pose, ModRep1Start, ModRep1End)
Repeat2Unit = grafting.return_region(Pose, ModRep2Start, ModRep2End)
# print 'Repeat1Unit', Repeat1Unit
# print 'Repeat2Unit', Repeat2Unit
# use function to extrapolate from a partial repeat
try:
Extrapolation = extrapolate_repeat_pose(Repeat1Unit, Repeat2Unit, Args.repeat - 1)
except AssertionError:
'Extrapolation failed'
continue
# hacky check finds things that went wrong in extrapolation, sometimes
if Extrapolation.n_residue() == ModUniformLength + Overlap:
# trim down to uniform length
Extrapolation = grafting.return_region(Extrapolation, 1, ModUniformLength)
# add extrapolated pose to list
Repeat1Range = (ModRep1Start, ModRep1End)
Repeat2Range = (ModRep2Start, ModRep2End)
ExtrapolationList.append(( Extrapolation, Repeat1Range, Repeat2Range, NumTurns ))
else:
print 'fail'
AllExtrapolationsByRepeatLength[RepeatUnitLength] = ExtrapolationList
with open('%s_RepExtra.log'%InputPdbStem, 'w') as LogFile:
for BaseUnitLength in AllExtrapolationsByRepeatLength:
print 'Extrapolated %d poses with base unit length %d'%(len(AllExtrapolationsByRepeatLength[BaseUnitLength]), BaseUnitLength)
print>>LogFile, 'Extrapolated %d poses with base unit length %d'%(len(AllExtrapolationsByRepeatLength[BaseUnitLength]), BaseUnitLength)
print>>LogFile, 'Number\tUnit1 range\tUnit2 range'
for i, ExtrapolationTuple in enumerate( AllExtrapolationsByRepeatLength[BaseUnitLength] ):
# print 'Extrapolation',Extrapolation
### print>>LogFile, '\t\t'.join([ str(i+1), ','.join([str(Number) for Number in ExtrapolationTuple[1]]), ','.join([str(Number) for Number in ExtrapolationTuple[2]]) ])
Repeat1Range = ExtrapolationTuple[1]
Repeat2Range = ExtrapolationTuple[2]
RepeatUnitLength = BaseUnitLength * ExtrapolationTuple[3]
rosetta.dump_pdb( ExtrapolationTuple[0], '%ssrc%d_%d__%d_%d_rep%d_%s.pdb'%(Args.out, Repeat1Range[0], Repeat1Range[1], Repeat2Range[0], Repeat2Range[1], RepeatUnitLength, InputPdbStem) )
def main(argv=None):
if argv is None:
argv = sys.argv
ArgParser = argparse.ArgumentParser(description=' generate_backbones.py ( -help ) %s'%InfoString)
# Required arguments:
ArgParser.add_argument('-pdbs', type=str, nargs='+', help=' Input pdbs ', required=True)
ArgParser.add_argument('-repeat', type=int, help=' Number of repeats to make ', default = 5)
ArgParser.add_argument('-max_turns_per_repeat', type=int, help=' Upper bound of number of turns (think number of unique repeat unit variations) per repeat unit to extrapolate repeat pose from. Lower bound always is 1.', default=2)
ArgParser.add_argument('-min_overlap', type=int, help=' minimum residue overlap between superimposed regions ', default=4)
ArgParser.add_argument('-repeat_residues', type=str, help=' manual input of repeat chains (i.e. stripes of residues along pdb), _ seperates residues in chain, __ seperates chains ', default=False)
#### ArgParser.add_argument('-start', type=int, help=' Repeat start residue ', default=False)
#### ArgParser.add_argument('-end', type=str, help=' input pdbs ', default=False)
ArgParser.add_argument('-out', type=str, help=' Output directory ', default='./')
Args = ArgParser.parse_args()
# print 'Args.pdbs', Args.pdbs
if len(Args.pdbs) == 1:
Args.pdbs = [''.join(Args.pdbs)]
assert len(Args.pdbs) < 19, 'Too many pdbs to parallelize'
if Args.out [-1] != '/':
Args.out = Args.out + '/'
ParallelizableTuples = []
### find units in input pdb and extrapolate repeat backbones
for i, Pdb in enumerate(Args.pdbs):
ParallelizableTuples.append((Args, Pdb))
pool = Pool(processes=len(ParallelizableTuples))
pool.map(detect_and_expand_repeats, ParallelizableTuples)
if __name__ == "__main__":
sys.exit(main())