Réimplémentation du programme DSSP en Python

structure.py 8.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242
  1. import math
  2. import numpy as np
  3. class Structure:
  4. def __init__(self, res):
  5. self.res = res
  6. class Turn(Structure):
  7. def __init__(self, turn_type, res):
  8. self.turn_type = turn_type
  9. Structure.res = res
  10. class Bridge(Structure):
  11. def __init__(self, bridge_type, res_num):
  12. self.bridge_type = bridge_type
  13. self.res_num = res_num
  14. Structure.res = res_num
  15. class Helix(Structure):
  16. def __init__(self, residues, res_num):
  17. self.residues = residues
  18. self.res_num = res_num
  19. Structure.res = res_num
  20. def get_turns(residues):
  21. turns = {}
  22. for i,res in enumerate(residues):
  23. for j in range(3,6):
  24. if(i+j<len(residues)):
  25. if(res.h_bond(residues[i+j])<-0.5):
  26. print(j,"TURN", residues[i].resid, residues[i+j].resid)
  27. turns[residues[i].resid] = Turn(j,residues[i].resid)
  28. return(turns)
  29. def get_bridges(residues):
  30. bridges = []
  31. bridge = {}
  32. strongest_bridge = {}
  33. for i in range(1,len(residues)-4):
  34. E_min = 0
  35. for j in range(i+2,len(residues)-1):
  36. # select triplet with the minimal energy
  37. if(residues[i-1].h_bond(residues[j])<-0.5
  38. and residues[j].h_bond(residues[i+1])<-0.5):
  39. bridge = {'res1':residues[i-1].h_bond(residues[j]),
  40. 'res2':residues[j].h_bond(residues[i+1]),
  41. 'ipos':residues[i].resid,
  42. 'jpos':residues[j].resid,
  43. 'btype':"para"}
  44. # if(residues[i-1].h_bond(residues[j])+
  45. # residues[j].h_bond(residues[i+1]))<E_min:
  46. # E_min = residues[i-1].h_bond(residues[j])
  47. # +residues[j].h_bond(residues[i+1])
  48. # bridge_type = "para"
  49. if(residues[j-1].h_bond(residues[i])<-0.5
  50. and residues[i].h_bond(residues[j+1])<-0.5):
  51. bridge = {'res1':residues[j-1].h_bond(residues[i]),
  52. 'res2':residues[i].h_bond(residues[j+1]),
  53. 'ipos':residues[i].resid,
  54. 'jpos':residues[j].resid,
  55. 'btype':"para"}
  56. # if(residues[j-1].h_bond(residues[i])+
  57. # residues[i].h_bond(residues[j+1]))<E_min:
  58. # E_min = residues[j-1].h_bond(residues[i])
  59. # +residues[i].h_bond(residues[j+1])
  60. # bridge_type = "para"
  61. if(residues[i].h_bond(residues[j])<-0.5
  62. and residues[j].h_bond(residues[i])<-0.5):
  63. bridge = {'res1':residues[i].h_bond(residues[j]),
  64. 'res2':residues[j].h_bond(residues[i]),
  65. 'ipos':residues[i].resid,
  66. 'jpos':residues[j].resid,
  67. 'btype':"anti"}
  68. # if(residues[i].h_bond(residues[j])+
  69. # residues[j].h_bond(residues[i]))<E_min:
  70. # E_min = residues[i].h_bond(residues[j])
  71. # +residues[j].h_bond(residues[i])
  72. # bridge_type = "anti"
  73. if(residues[i-1].h_bond(residues[j+1])<-0.5
  74. and residues[j-1].h_bond(residues[i+1])<-0.5):
  75. bridge = {'res1':residues[i-1].h_bond(residues[j+1]),
  76. 'res2':residues[j-1].h_bond(residues[i+1]),
  77. 'ipos':residues[i].resid,
  78. 'jpos':residues[j].resid,
  79. 'btype':"anti"}
  80. # if(residues[i-1].h_bond(residues[j+1])+
  81. # residues[j-1].h_bond(residues[i+1]))<E_min:
  82. # E_min = residues[i-1].h_bond(residues[j+1])
  83. # +residues[j-1].h_bond(residues[i+1])
  84. # bridge_type = "anti"
  85. if(bridge):
  86. if(bridge['res1']+bridge['res2']<E_min):
  87. E_min = bridge['res1']+bridge['res2']
  88. strongest_bridge = bridge
  89. bridge = {}
  90. # finally add the strongest bridge at i and j pos
  91. if(strongest_bridge):
  92. bridges.append(Bridge(strongest_bridge['btype'],
  93. strongest_bridge['ipos']))
  94. bridges.append(Bridge(strongest_bridge['btype'],
  95. strongest_bridge['jpos']))
  96. if(len(bridges)>0):
  97. return(bridges)
  98. else:
  99. return(False)
  100. def get_helix(residues, turns):
  101. i = 1
  102. helix = []
  103. while i <= len(residues):
  104. if(i in turns.keys() and i-1 in turns.keys()):
  105. k = 0
  106. temp_res = []
  107. while(i+k in turns):
  108. k+=1
  109. temp_res.append(residues[i])
  110. if(k>2):
  111. print(k,"- HELIX at", residues[i].resid)
  112. helix.append(Helix(temp_res,residues[i].resid))
  113. i = i+k
  114. else:
  115. i+=1
  116. return(helix)
  117. def get_ladder(bridges):
  118. ladders = {}
  119. for i in range(len(bridges)):
  120. k = 1
  121. while bridges[i] == bridges[i+k]:
  122. k+=1
  123. if k>1:
  124. ladders[bridges[i].res_num] = k-1
  125. def get_bends(residues):
  126. bends = {}
  127. for i in range(2,len(residues)-2):
  128. angle = vector_angles(vectors_substr(position_vector(residues[i].atoms["CA"].coords),
  129. position_vector(residues[i-2].atoms["CA"].coords)),
  130. vectors_substr(position_vector(residues[i+2].atoms["CA"].coords),
  131. position_vector(residues[i].atoms["CA"].coords)))
  132. if(angle>70):
  133. print("angle", residues[i].resid, angle)
  134. bends[residues[i].resid] = angle
  135. return(bends)
  136. def vector_from_pos(a, b):
  137. xAB = b[0]-a[0]
  138. yAB = b[1]-a[1]
  139. zAB = b[2]-a[2]
  140. coord_AB = [xAB,yAB,zAB]
  141. return coord_AB
  142. def vector_norm(v):
  143. norm = math.sqrt(v[0]**2 + v[1]**2 + v[2]**2)
  144. return norm
  145. def dot_product(v1,v2):
  146. dot_product = v1[0]*v2[0] + v1[1]*v2[1] + v1[2]*v2[2]
  147. return(dot_product)
  148. def position_vector(c):
  149. vector = vector_from_pos([0,0,0],c)
  150. return vector
  151. def vectors_substr(v1, v2):
  152. return ([v1[0]-v2[0],
  153. v1[1]-v2[1],
  154. v1[2]-v2[2]])
  155. def vector_angles(v1,v2):
  156. dot_prod = dot_product(v1,v2)
  157. norm_v1 = vector_norm(v1)
  158. norm_v2 = vector_norm(v2)
  159. term = dot_prod/(abs(norm_v1)*abs(norm_v2))
  160. rad_angle = math.acos(term)
  161. deg_angle = rad_angle*(180/math.pi)
  162. return deg_angle
  163. def calc_dihedral(u1, u2, u3, u4):
  164. """ Calculate dihedral angle method. From bioPython.PDB
  165. (adapted to np.array)
  166. Calculate the dihedral angle between 4 vectors
  167. representing 4 connected points. The angle is in
  168. [-pi, pi].
  169. Adapted function of dihedral_angle_from_coordinates.py
  170. by Eric Alcaide.
  171. Source : https://gist.github.com/EricAlcaide
  172. URL : https://gist.github.com/EricAlcaide/30d6bfdb8358d3a57d010c9a501fda56
  173. """
  174. #convert coords to numpy arrays
  175. u1 = np.array(u1)
  176. u2 = np.array(u2)
  177. u3 = np.array(u3)
  178. u4 = np.array(u4)
  179. a1 = u2 - u1
  180. a2 = u3 - u2
  181. a3 = u4 - u3
  182. v1 = np.cross(a1, a2)
  183. v1 = v1 / (v1 * v1).sum(-1)**0.5
  184. v2 = np.cross(a2, a3)
  185. v2 = v2 / (v2 * v2).sum(-1)**0.5
  186. porm = np.sign((v1 * a3).sum(-1))
  187. rad = np.arccos((v1*v2).sum(-1) / ((v1**2).sum(-1) * (v2**2).sum(-1))**0.5)
  188. if not porm == 0:
  189. rad = rad * porm
  190. deg_angle = rad*(180/math.pi)
  191. return deg_angle
  192. def get_chirality(residues):
  193. for i in range(1,len(residues)-2):
  194. chirality = {}
  195. angle = calc_dihedral(residues[i-1].atoms["CA"].coords,
  196. residues[i].atoms["CA"].coords,
  197. residues[i+1].atoms["CA"].coords,
  198. residues[i+2].atoms["CA"].coords)
  199. if(angle>0 and angle<=180):
  200. sign="+"
  201. print("angle", residues[i].resid, "+", angle)
  202. if(angle<=0 and angle > -180):
  203. sign="-"
  204. print("angle", residues[i].resid, "-", angle)
  205. chirality[residues[i].resid] = sign
  206. return chirality