File size: 19,196 Bytes
d766458 | 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 | import numpy as np
import itertools
import jax.numpy as jnp
import jax
import time
# The following gather functions
def gather_edges(edges, neighbor_idx):
# Features [B,N,N,C] at Neighbor indices [B,N,K] => Neighbor features [B,N,K,C]
neighbors = jnp.tile(jnp.expand_dims(neighbor_idx, -1), [1, 1, 1, edges.shape[-1]])
edge_features = jnp.take_along_axis(edges, neighbors, 2)
return edge_features
def gather_nodes(nodes, neighbor_idx):
# Features [B,N,C] at Neighbor indices [B,N,K] => [B,N,K,C]
# Flatten and expand indices per batch [B,N,K] => [B,NK] => [B,NK,C]
neighbors_flat = neighbor_idx.reshape([neighbor_idx.shape[0], -1])
neighbors_flat = jnp.tile(jnp.expand_dims(neighbors_flat, -1),[1, 1, nodes.shape[2]])
# Gather and re-pack
neighbor_features = jnp.take_along_axis(nodes, neighbors_flat, 1)
neighbor_features = neighbor_features.reshape(list(neighbor_idx.shape[:3]) + [-1])
return neighbor_features
def gather_nodes_t(nodes, neighbor_idx):
# Features [B,N,C] at Neighbor index [B,K] => Neighbor features[B,K,C]
idx_flat = jnp.tile(jnp.expand_dims(neighbor_idx, -1),[1, 1, nodes.shape[2]])
neighbor_features = jnp.take_along_axis(nodes, idx_flat, 1)
return neighbor_features
def cat_neighbors_nodes(h_nodes, h_neighbors, E_idx):
h_nodes = gather_nodes(h_nodes, E_idx)
h_nn = jnp.concatenate([h_neighbors, h_nodes], -1)
return h_nn
def scatter(input, dim, index, src):
idx = jnp.indices(index.shape)
dim_num = idx.shape[0] # dimension of the dim
a = idx.at[dim].set(index)
idx = jnp.moveaxis(idx, 0, -1).reshape((-1, dim_num))
a = jnp.moveaxis(a, 0, -1).reshape((-1, dim_num))
return input.at[tuple(a.T)].set(src[tuple(idx.T)])
def get_ar_mask(order):
'''compute autoregressive mask, given order of positions'''
L = order.shape[-1]
oh_order = jax.nn.one_hot(order, L)
tri = jnp.tri(L, k=-1)
return jnp.einsum('ij,...iq,...jp->...qp', tri, oh_order, oh_order)
class StructureDatasetPDB():
def __init__(self, pdb_dict_list, verbose=True, truncate=None, max_length=100,
alphabet='ACDEFGHIKLMNPQRSTVWYX-'):
alphabet_set = set([a for a in alphabet])
discard_count = {
'bad_chars': 0,
'too_long': 0,
'bad_seq_length': 0
}
self.data = []
start = time.time()
for i, entry in enumerate(pdb_dict_list):
seq = entry['seq']
name = entry['name']
bad_chars = set([s for s in seq]).difference(alphabet_set)
if len(bad_chars) == 0:
if len(entry['seq']) <= max_length:
self.data.append(entry)
else:
discard_count['too_long'] += 1
else:
discard_count['bad_chars'] += 1
# Truncate early
if truncate is not None and len(self.data) == truncate:
return
if verbose and (i + 1) % 1000 == 0:
elapsed = time.time() - start
#print('Discarded', discard_count)
def __len__(self):
return len(self.data)
def __getitem__(self, idx):
return self.data[idx]
def _S_to_seq(S, mask):
alphabet = 'ACDEFGHIKLMNPQRSTVWYX'
seq = ''.join([alphabet[c] for c, m in zip(S.tolist(), mask.tolist()) if m > 0])
return seq
def parse_PDB_biounits(x, atoms=['N', 'CA', 'C'], chain=None):
'''
input: x = PDB filename
atoms = atoms to extract (optional)
output: (length, atoms, coords=(x,y,z)), sequence
'''
alpha_1 = list("ARNDCQEGHILKMFPSTWYV-")
states = len(alpha_1)
alpha_3 = ['ALA', 'ARG', 'ASN', 'ASP', 'CYS', 'GLN', 'GLU', 'GLY', 'HIS', 'ILE',
'LEU', 'LYS', 'MET', 'PHE', 'PRO', 'SER', 'THR', 'TRP', 'TYR', 'VAL', 'GAP']
aa_1_N = {a: n for n, a in enumerate(alpha_1)}
aa_3_N = {a: n for n, a in enumerate(alpha_3)}
aa_N_1 = {n: a for n, a in enumerate(alpha_1)}
aa_1_3 = {a: b for a, b in zip(alpha_1, alpha_3)}
aa_3_1 = {b: a for a, b in zip(alpha_1, alpha_3)}
def AA_to_N(x):
# ["ARND"] -> [[0,1,2,3]]
x = np.array(x)
if x.ndim == 0:
x = x[None]
return [[aa_1_N.get(a, states-1) for a in y] for y in x]
def N_to_AA(x):
# [[0,1,2,3]] -> ["ARND"]
x = np.array(x)
if x.ndim == 1:
x = x[None]
return ["".join([aa_N_1.get(a, "-") for a in y]) for y in x]
xyz, seq, min_resn, max_resn = {}, {}, 1e6, -1e6
for line in open(x, "rb"):
line = line.decode("utf-8", "ignore").rstrip()
if line[:6] == "HETATM" and line[17:17+3] == "MSE":
line = line.replace("HETATM", "ATOM ")
line = line.replace("MSE", "MET")
if line[:4] == "ATOM":
ch = line[21:22]
if ch == chain or chain is None:
atom = line[12:12+4].strip()
resi = line[17:17+3]
resn = line[22:22+5].strip()
x, y, z = [float(line[i:(i+8)]) for i in [30, 38, 46]]
if resn[-1].isalpha():
resa, resn = resn[-1], int(resn[:-1])-1
else:
resa, resn = "", int(resn)-1
# resn = int(resn)
if resn < min_resn:
min_resn = resn
if resn > max_resn:
max_resn = resn
if resn not in xyz:
xyz[resn] = {}
if resa not in xyz[resn]:
xyz[resn][resa] = {}
if resn not in seq:
seq[resn] = {}
if resa not in seq[resn]:
seq[resn][resa] = resi
if atom not in xyz[resn][resa]:
xyz[resn][resa][atom] = np.array([x, y, z])
# convert to numpy arrays, fill in missing values
seq_, xyz_ = [], []
try:
for resn in range(min_resn, max_resn+1):
if resn in seq:
for k in sorted(seq[resn]):
seq_.append(aa_3_N.get(seq[resn][k], 20))
else:
seq_.append(20)
if resn in xyz:
for k in sorted(xyz[resn]):
for atom in atoms:
if atom in xyz[resn][k]:
xyz_.append(xyz[resn][k][atom])
else:
xyz_.append(np.full(3, np.nan))
else:
for atom in atoms:
xyz_.append(np.full(3, np.nan))
return np.array(xyz_).reshape(-1, len(atoms), 3), N_to_AA(np.array(seq_))
except TypeError:
return 'no_chain', 'no_chain'
def parse_PDB(path_to_pdb, input_chain_list=None):
c = 0
pdb_dict_list = []
init_alphabet = ['A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']
extra_alphabet = [str(item) for item in list(np.arange(300))]
chain_alphabet = init_alphabet + extra_alphabet
if input_chain_list:
chain_alphabet = input_chain_list
biounit_names = [path_to_pdb]
for biounit in biounit_names:
my_dict = {}
s = 0
concat_seq = ''
concat_N = []
concat_CA = []
concat_C = []
concat_O = []
concat_mask = []
coords_dict = {}
for letter in chain_alphabet:
xyz, seq = parse_PDB_biounits(
biounit, atoms=['N', 'CA', 'C', 'O'], chain=letter)
if type(xyz) != str:
concat_seq += seq[0]
my_dict['seq_chain_'+letter] = seq[0]
coords_dict_chain = {}
coords_dict_chain['N_chain_'+letter] = xyz[:, 0, :].tolist()
coords_dict_chain['CA_chain_'+letter] = xyz[:, 1, :].tolist()
coords_dict_chain['C_chain_'+letter] = xyz[:, 2, :].tolist()
coords_dict_chain['O_chain_'+letter] = xyz[:, 3, :].tolist()
my_dict['coords_chain_'+letter] = coords_dict_chain
s += 1
fi = biounit.rfind("/")
my_dict['name'] = biounit[(fi+1):-4]
my_dict['num_of_chains'] = s
my_dict['seq'] = concat_seq
if s <= len(chain_alphabet):
pdb_dict_list.append(my_dict)
c += 1
return pdb_dict_list
def tied_featurize(batch, chain_dict,
fixed_position_dict=None, omit_AA_dict=None,
tied_positions_dict=None, pssm_dict=None,
bias_by_res_dict=None):
""" Pack and pad batch into torch tensors """
alphabet = 'ACDEFGHIKLMNPQRSTVWYX'
B = len(batch)
lengths = np.array([len(b['seq']) for b in batch], int) #sum of chain seq lengths
L_max = max([len(b['seq']) for b in batch])
X = np.zeros([B, L_max, 4, 3])
residue_idx = -100*np.ones([B, L_max], int)
chain_M = np.zeros([B, L_max], int) #1.0 for the bits that need to be predicted
pssm_coef_all = np.zeros([B, L_max], float) #1.0 for the bits that need to be predicted
pssm_bias_all = np.zeros([B, L_max, 21], float) #1.0 for the bits that need to be predicted
pssm_log_odds_all = 10000.0*np.ones([B, L_max, 21], float) #1.0 for the bits that need to be predicted
chain_M_pos = np.zeros([B, L_max], int) #1.0 for the bits that need to be predicted
bias_by_res_all = np.zeros([B, L_max, 21], float)
chain_idx = np.zeros([B, L_max], int) #1.0 for the bits that need to be predicted
S = np.zeros([B, L_max], int)
omit_AA_mask = np.zeros([B, L_max, len(alphabet)], int)
# Build the batch
letter_list_list = []
visible_list_list = []
masked_list_list = []
masked_chain_length_list_list = []
tied_pos_list_of_lists_list = []
#shuffle all chains before the main loop
for i, b in enumerate(batch):
if chain_dict != None:
masked_chains, visible_chains = chain_dict[b['name']] #masked_chains a list of chain letters to predict [A, D, F]
else:
masked_chains = [item[-1:] for item in list(b) if item[:10]=='seq_chain_']
visible_chains = []
num_chains = b['num_of_chains']
all_chains = masked_chains + visible_chains
#random.shuffle(all_chains)
for i, b in enumerate(batch):
mask_dict = {}
a = 0
x_chain_list = []
chain_mask_list = []
chain_seq_list = []
chain_encoding_list = []
c = 1
letter_list = []
global_idx_start_list = [0]
visible_list = []
masked_list = []
masked_chain_length_list = []
fixed_position_mask_list = []
omit_AA_mask_list = []
pssm_coef_list = []
pssm_bias_list = []
pssm_log_odds_list = []
bias_by_res_list = []
l0 = 0
l1 = 0
for step, letter in enumerate(all_chains):
if letter in visible_chains:
letter_list.append(letter)
visible_list.append(letter)
chain_seq = b[f'seq_chain_{letter}']
chain_seq = ''.join([a if a!='-' else 'X' for a in chain_seq])
chain_length = len(chain_seq)
global_idx_start_list.append(global_idx_start_list[-1]+chain_length)
chain_coords = b[f'coords_chain_{letter}'] #this is a dictionary
chain_mask = np.zeros(chain_length) #0.0 for visible chains
x_chain = np.stack([chain_coords[c] for c in [f'N_chain_{letter}', f'CA_chain_{letter}', f'C_chain_{letter}', f'O_chain_{letter}']], 1) #[chain_lenght,4,3]
x_chain_list.append(x_chain)
chain_mask_list.append(chain_mask)
chain_seq_list.append(chain_seq)
chain_encoding_list.append(c*np.ones(np.array(chain_mask).shape[0]))
l1 += chain_length
residue_idx[i, l0:l1] = 100*(c-1)+np.arange(l0, l1)
l0 += chain_length
c+=1
fixed_position_mask = np.ones(chain_length)
fixed_position_mask_list.append(fixed_position_mask)
omit_AA_mask_temp = np.zeros([chain_length, len(alphabet)], np.int32)
omit_AA_mask_list.append(omit_AA_mask_temp)
pssm_coef = np.zeros(chain_length)
pssm_bias = np.zeros([chain_length, 21])
pssm_log_odds = 10000.0*np.ones([chain_length, 21])
pssm_coef_list.append(pssm_coef)
pssm_bias_list.append(pssm_bias)
pssm_log_odds_list.append(pssm_log_odds)
bias_by_res_list.append(np.zeros([chain_length, 21]))
if letter in masked_chains:
masked_list.append(letter)
letter_list.append(letter)
chain_seq = b[f'seq_chain_{letter}']
chain_seq = ''.join([a if a!='-' else 'X' for a in chain_seq])
chain_length = len(chain_seq)
global_idx_start_list.append(global_idx_start_list[-1]+chain_length)
masked_chain_length_list.append(chain_length)
chain_coords = b[f'coords_chain_{letter}'] #this is a dictionary
chain_mask = np.ones(chain_length) #1.0 for masked
x_chain = np.stack([chain_coords[c] for c in [f'N_chain_{letter}', f'CA_chain_{letter}', f'C_chain_{letter}', f'O_chain_{letter}']], 1) #[chain_lenght,4,3]
x_chain_list.append(x_chain)
chain_mask_list.append(chain_mask)
chain_seq_list.append(chain_seq)
chain_encoding_list.append(c*np.ones(np.array(chain_mask).shape[0]))
l1 += chain_length
residue_idx[i, l0:l1] = 100*(c-1)+np.arange(l0, l1)
l0 += chain_length
c+=1
fixed_position_mask = np.ones(chain_length)
if fixed_position_dict!=None:
fixed_pos_list = fixed_position_dict[b['name']][letter]
if fixed_pos_list:
fixed_position_mask[np.array(fixed_pos_list)-1] = 0.0
fixed_position_mask_list.append(fixed_position_mask)
omit_AA_mask_temp = np.zeros([chain_length, len(alphabet)], np.int32)
if omit_AA_dict!=None:
for item in omit_AA_dict[b['name']][letter]:
idx_AA = np.array(item[0])-1
AA_idx = np.array([np.argwhere(np.array(list(alphabet))== AA)[0][0] for AA in item[1]]).repeat(idx_AA.shape[0])
idx_ = np.array([[a, b] for a in idx_AA for b in AA_idx])
omit_AA_mask_temp[idx_[:,0], idx_[:,1]] = 1
omit_AA_mask_list.append(omit_AA_mask_temp)
pssm_coef = np.zeros(chain_length)
pssm_bias = np.zeros([chain_length, 21])
pssm_log_odds = 10000.0*np.ones([chain_length, 21])
if pssm_dict:
if pssm_dict[b['name']][letter]:
pssm_coef = pssm_dict[b['name']][letter]['pssm_coef']
pssm_bias = pssm_dict[b['name']][letter]['pssm_bias']
pssm_log_odds = pssm_dict[b['name']][letter]['pssm_log_odds']
pssm_coef_list.append(pssm_coef)
pssm_bias_list.append(pssm_bias)
pssm_log_odds_list.append(pssm_log_odds)
if bias_by_res_dict:
bias_by_res_list.append(bias_by_res_dict[b['name']][letter])
else:
bias_by_res_list.append(np.zeros([chain_length, 21]))
letter_list_np = np.array(letter_list)
tied_pos_list_of_lists = []
tied_beta = np.ones(L_max)
if tied_positions_dict!=None:
tied_pos_list = tied_positions_dict[b['name']]
if tied_pos_list:
set_chains_tied = set(list(itertools.chain(*[list(item) for item in tied_pos_list])))
for tied_item in tied_pos_list:
one_list = []
for k, v in tied_item.items():
start_idx = global_idx_start_list[np.argwhere(letter_list_np == k)[0][0]]
if isinstance(v[0], list):
for v_count in range(len(v[0])):
one_list.append(start_idx+v[0][v_count]-1)#make 0 to be the first
tied_beta[start_idx+v[0][v_count]-1] = v[1][v_count]
else:
for v_ in v:
one_list.append(start_idx+v_-1)#make 0 to be the first
tied_pos_list_of_lists.append(one_list)
tied_pos_list_of_lists_list.append(tied_pos_list_of_lists)
x = np.concatenate(x_chain_list,0) #[L, 4, 3]
all_sequence = "".join(chain_seq_list)
m = np.concatenate(chain_mask_list,0) #[L,], 1.0 for places that need to be predicted
chain_encoding = np.concatenate(chain_encoding_list,0)
m_pos = np.concatenate(fixed_position_mask_list,0) #[L,], 1.0 for places that need to be predicted
pssm_coef_ = np.concatenate(pssm_coef_list,0) #[L,], 1.0 for places that need to be predicted
pssm_bias_ = np.concatenate(pssm_bias_list,0) #[L,], 1.0 for places that need to be predicted
pssm_log_odds_ = np.concatenate(pssm_log_odds_list,0) #[L,], 1.0 for places that need to be predicted
bias_by_res_ = np.concatenate(bias_by_res_list, 0) #[L,21], 0.0 for places where AA frequencies don't need to be tweaked
l = len(all_sequence)
x_pad = np.pad(x, [[0,L_max-l], [0,0], [0,0]], 'constant', constant_values=(np.nan, ))
X[i,:,:,:] = x_pad
m_pad = np.pad(m, [[0,L_max-l]], 'constant', constant_values=(0.0, ))
m_pos_pad = np.pad(m_pos, [[0,L_max-l]], 'constant', constant_values=(0.0, ))
omit_AA_mask_pad = np.pad(np.concatenate(omit_AA_mask_list,0), [[0,L_max-l]], 'constant', constant_values=(0.0, ))
chain_M[i,:] = m_pad
chain_M_pos[i,:] = m_pos_pad
omit_AA_mask[i,] = omit_AA_mask_pad
chain_encoding_pad = np.pad(chain_encoding, [[0,L_max-l]], 'constant', constant_values=(0.0, ))
chain_idx[i,:] = chain_encoding_pad
pssm_coef_pad = np.pad(pssm_coef_, [[0,L_max-l]], 'constant', constant_values=(0.0, ))
pssm_bias_pad = np.pad(pssm_bias_, [[0,L_max-l], [0,0]], 'constant', constant_values=(0.0, ))
pssm_log_odds_pad = np.pad(pssm_log_odds_, [[0,L_max-l], [0,0]], 'constant', constant_values=(0.0, ))
pssm_coef_all[i,:] = pssm_coef_pad
pssm_bias_all[i,:] = pssm_bias_pad
pssm_log_odds_all[i,:] = pssm_log_odds_pad
bias_by_res_pad = np.pad(bias_by_res_, [[0,L_max-l], [0,0]], 'constant', constant_values=(0.0, ))
bias_by_res_all[i,:] = bias_by_res_pad
# Convert to labels
indices = np.asarray([alphabet.index(a) for a in all_sequence], int)
S[i, :l] = indices
letter_list_list.append(letter_list)
visible_list_list.append(visible_list)
masked_list_list.append(masked_list)
masked_chain_length_list_list.append(masked_chain_length_list)
isnan = np.isnan(X)
mask = np.isfinite(np.sum(X,(2,3))).astype(float)
X[isnan] = 0.
# Conversion
pssm_coef_all = jnp.array(pssm_coef_all, float)
pssm_bias_all = jnp.array(pssm_bias_all, float)
pssm_log_odds_all = jnp.array(pssm_log_odds_all, float)
tied_beta = jnp.array(tied_beta, float)
jumps = ((residue_idx[:,1:]-residue_idx[:,:-1])==1).astype(float)
bias_by_res_all = jnp.array(bias_by_res_all, float)
phi_mask = np.pad(jumps, [[0,0],[1,0]])
psi_mask = np.pad(jumps, [[0,0],[0,1]])
omega_mask = np.pad(jumps, [[0,0],[0,1]])
dihedral_mask = np.concatenate([phi_mask[:,:,None], psi_mask[:,:,None], omega_mask[:,:,None]], -1) #[B,L,3]
dihedral_mask = jnp.array(dihedral_mask, float)
residue_idx = jnp.array(residue_idx, int)
S = jnp.array(S, int)
X = jnp.array(X, float)
mask = jnp.array(mask, float)
chain_M = jnp.array(chain_M, float)
chain_M_pos = jnp.array(chain_M_pos, float)
omit_AA_mask = jnp.array(omit_AA_mask, float)
chain_idx = jnp.array(chain_idx, int)
return X, S, mask, lengths, chain_M, chain_idx, letter_list_list, \
visible_list_list, masked_list_list, masked_chain_length_list_list, \
chain_M_pos, omit_AA_mask, residue_idx, dihedral_mask, tied_pos_list_of_lists_list, \
pssm_coef_all, pssm_bias_all, pssm_log_odds_all, bias_by_res_all, tied_beta
|