Repository navigation
Expand file tree
/
Copy pathsmiles.py
More file actions
580 lines (514 loc) · 22.8 KB
/
Copy pathsmiles.py
File metadata and controls
580 lines (514 loc) · 22.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
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
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
# -*- coding: utf-8 -*-
#
# Copyright 2017-2025 Ramil Nugmanov <nougmanoff@protonmail.com>
# Copyright 2019 Timur Gimadiev <timur.gimadiev@gmail.com>
# This file is part of chython.
#
# chython is free software; you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as published by
# the Free Software Foundation; either version 3 of the License, or
# (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public License
# along with this program; if not, see <https://www.gnu.org/licenses/>.
#
from abc import ABC, abstractmethod
from CachedMethods import cached_method
from collections import defaultdict
from functools import cached_property
from heapq import heappop, heappush
from itertools import product
from random import random
from typing import Callable, Optional, Tuple, TYPE_CHECKING, Union
if TYPE_CHECKING:
from chython import MoleculeContainer, CGRContainer
from chython.containers.graph import Graph
charge_str = {-4: '-4', -3: '-3', -2: '-2', -1: '-', 0: '0', 1: '+', 2: '+2', 3: '+3', 4: '+4'}
order_str = {1: '-', 2: '=', 3: '#', 4: ':', 8: '~', None: '.'}
organic_set = {'C', 'N', 'O', 'P', 'S', 'F', 'Cl', 'Br', 'I', 'B'}
dyn_order_str = {(None, 1): '[.>-]', (None, 2): '[.>=]', (None, 3): '[.>#]', (None, 4): '[.>:]', (None, 8): '[.>~]',
(1, None): '[->.]', (1, 1): '', (1, 2): '[->=]', (1, 3): '[->#]', (1, 4): '[->:]', (1, 8): '[->~]',
(2, None): '[=>.]', (2, 1): '[=>-]', (2, 2): '=', (2, 3): '[=>#]', (2, 4): '[=>:]', (2, 8): '[=>~]',
(3, None): '[#>.]', (3, 1): '[#>-]', (3, 2): '[#>=]', (3, 3): '#', (3, 4): '[#>:]', (3, 8): '[#>~]',
(4, None): '[:>.]', (4, 1): '[:>-]', (4, 2): '[:>=]', (4, 3): '[:>#]', (4, 4): ':', (4, 8): '[:>~]',
(8, None): '[~>.]', (8, 1): '[~>-]', (8, 2): '[~>=]', (8, 3): '[~>#]', (8, 4): '[~>:]', (8, 8): '~'}
dyn_charge_str = {(i, j): f'{charge_str[i]}>{charge_str[j]}' if i != j else charge_str[i]
for i, j in product(range(-4, 5), repeat=2)}
dyn_charge_str[(0, 0)] = ''
dyn_radical_str = {(True, True): '*', (True, False): '*>^', (False, True): '^>*'}
# atomic number constants
B = 5
C = 6
N = 7
P = 15
S = 16
class Smiles(ABC):
__slots__ = ()
@property
def smiles(self):
"""
Generate SMILES string of the molecule.
"""
return str(self)
@cached_method
def __str__(self):
smiles, order = self._smiles(self._smiles_order(), _return_order=True)
if (cx := self._format_cxsmiles(order)) is not None:
smiles.append(' ')
smiles.append(cx)
self.__dict__['smiles_atoms_order'] = tuple(order) # cache smiles_atoms_order
return ''.join(smiles)
def __format__(self: Union['Graph', 'Smiles'], format_spec, *, _return_order=False):
"""
Signature generation options.
:param format_spec: String with keys:
a - Generate asymmetric closures.
!s - Disable stereo marks.
A - Use aromatic bonds instead aromatic atoms.
m - Set atom mapping.
r - Generate random-ordered smiles.
h - Show implicit hydrogens.
!b - Disable bonds tokens.
!x - Disable CXSMILES extension.
!z - Disable charge representation.
Combining possible. Order independent. Another keys ignored.
"""
if format_spec:
kwargs = {}
if 'a' in format_spec:
kwargs['asymmetric_closures'] = True
if '!s' in format_spec:
kwargs['stereo'] = False
if 'A' in format_spec:
kwargs['aromatic'] = False
if 'm' in format_spec:
kwargs['mapping'] = True
if 'h' in format_spec:
kwargs['hydrogens'] = True
if '!b' in format_spec:
kwargs['bonds'] = False
if '!z' in format_spec:
kwargs['charges'] = False
if 'r' in format_spec:
kwargs['random'] = True
def w(_):
return random()
else:
w = self._smiles_order('!s' not in format_spec)
smiles, order = self._smiles(w, _return_order=True, **kwargs)
if _return_order:
return ''.join(smiles), order
elif '!x' in format_spec or (cx := self._format_cxsmiles(order)) is None:
return ''.join(smiles)
else:
smiles.append(' ')
smiles.append(cx)
return ''.join(smiles)
elif _return_order:
smiles, order = self._smiles(self._smiles_order(), _return_order=True)
smiles = ''.join(smiles)
if (cx := self._format_cxsmiles(order)) is not None: # cache molecule smiles
self.__dict__['__cached_method___str__'] = f'{smiles} {cx}'
else:
self.__dict__['__cached_method___str__'] = smiles
self.__dict__['smiles_atoms_order'] = tuple(order) # cache smiles_atoms_order
return smiles, order
return str(self)
def __eq__(self, other):
return isinstance(other, Smiles) and str(self) == str(other)
@cached_method
def __hash__(self):
return hash(str(self))
@cached_property
def smiles_atoms_order(self) -> Tuple[int, ...]:
"""
Atoms order in canonic SMILES.
"""
smiles, order = self._smiles(self._smiles_order(), _return_order=True)
if (cx := self._format_cxsmiles(order)) is not None:
smiles.append(' ')
smiles.append(cx)
self.__dict__['__cached_method___str__'] = ''.join(smiles) # cache smiles
return tuple(order)
def _smiles(self: Union['Graph', 'Smiles'], weights, *, asymmetric_closures=False,
open_parenthesis='(', close_parenthesis=')', delimiter='.', _return_order=False, **kwargs):
if not self._atoms:
return []
bonds = self._bonds
atoms_set = set(self._atoms)
seen = {}
cycle = 0
casted_cycles = {}
string = []
order = []
visited_bond = set()
heap = list(range(1, 100))
if kwargs.get('random', False):
mod_weights_start = mod_weights = weights
else:
groups = defaultdict(int)
for n in atoms_set:
groups[weights(n)] -= 1
def mod_weights_start(x):
return (groups[weights(x)], # common groups
weights(x)) # smallest weight
def mod_weights(x):
return (groups[weights(x)], # common groups
weights(x), # smallest weight
seen[x]) # BFS nearest to starting
while True:
start = min(atoms_set, key=mod_weights_start)
if not kwargs.get('random', False):
seen[start] = 0
queue = [(start, 1)]
while queue:
n, d = queue.pop(0)
for m in bonds[n].keys() - seen.keys():
queue.append((m, d + 1))
seen[m] = d
# modified NX dfs with cycle detection
stack = [(start, len(atoms_set), iter(sorted(bonds[start], key=mod_weights)))]
visited = {start: []} # predecessors for stereo. atom: (visited[atom], *edges[atom])
disconnected = set()
edges = defaultdict(list)
tokens = defaultdict(list)
while stack:
parent, depth_now, children = stack[-1]
try:
child = next(children)
except StopIteration:
stack.pop()
else:
if child not in visited:
edges[parent].append(child)
visited[child] = [parent]
if depth_now > 1:
front = bonds[child].keys() - {parent}
if front:
stack.append((child, depth_now - 1, iter(sorted(front, key=mod_weights))))
elif (child, parent) not in disconnected:
disconnected.add((parent, child))
disconnected.add((child, parent))
cycle += 1
tokens[parent].append((child, cycle))
tokens[child].append((parent, cycle))
# flatten directed graph: edges
stack = [[start, 0, [start]]]
while True:
tail, closure, smiles = stack[-1]
if tail in edges:
children = edges[tail]
if len(children) > 1: # has side chain
child = children[-1]
stack_len = len(stack)
stack.append([child, 0, [(tail, child), child]]) # end of current chain
for child in children[-2::-1]: # start side chains
stack.append([child, stack_len, ['(', (tail, child), child]])
else: # chain grow
child = children[-1]
stack[-1][0] = child
smiles.append((tail, child))
smiles.append(child)
elif closure: # end of side chain
stack.pop()
if smiles[-2] == '(':
smiles.pop(-2)
else:
smiles.append(')')
stack[closure - 1][2].extend(smiles)
elif len(stack) > 2:
stack.pop()
stack[-1][0] = tail
stack[-1][2].extend(smiles)
elif len(stack) == 2:
stack[0][2].extend(smiles)
smiles = stack[0][2]
break
else:
break
# get order of each atom in ring closures
rings_order = {token: n for n, token in enumerate(smiles) if token in tokens}
for token in rings_order: # prepare closure numbers
released = []
# order closure atoms as in smiles string
for _, c in sorted(tokens[token], key=lambda x: rings_order[x[0]]):
if c in casted_cycles: # release ring closure number
released.append(casted_cycles[c])
else:
casted_cycles[c] = heappop(heap)
for c in released: # delayed release to avoid duplicates. e.g. C1..C11..C1 instead of C1..C12..C2
heappush(heap, c)
# prepare new neighbors order for stereo sign calculation
for token in smiles:
if token in tokens:
tokens[token].sort(key=lambda x: casted_cycles[x[1]]) # order closures
visited[token].extend(n for n, _ in tokens[token])
if token in edges:
visited[token].extend(edges[token])
for token in smiles:
if isinstance(token, int): # atoms
string.append(self._format_atom(token, visited, **kwargs))
order.append(token)
if token in tokens:
for m, c in tokens[token]:
if asymmetric_closures:
if (token, m) not in visited_bond:
string.append(self._format_bond(token, m, visited, **kwargs))
visited_bond.add((m, token))
else:
string.append(self._format_bond(token, m, visited, **kwargs))
string.append(self._format_closure(casted_cycles[c]))
elif token == '(':
string.append(open_parenthesis)
elif token == ')':
string.append(close_parenthesis)
else: # bonds
string.append(self._format_bond(*token, visited, **kwargs))
atoms_set.difference_update(visited)
if atoms_set:
string.append(delimiter)
else:
break
if _return_order:
return string, order
return string
@staticmethod
def _format_closure(c):
return str(c) if c < 10 else f'%{c}'
@abstractmethod
def _format_atom(self, n, adjacency, **kwargs):
...
@abstractmethod
def _format_bond(self, n, m, adjacency, **kwargs):
...
@abstractmethod
def _smiles_order(self, stereo=True) -> Callable:
...
def _format_cxsmiles(self, order) -> Optional[str]:
...
class MoleculeSmiles(Smiles):
__slots__ = ()
def sticky_smiles(self: Union['MoleculeContainer', 'MoleculeSmiles'], left: int = None, right: int = None, *,
remove_left: bool = False, remove_right: bool = False, tries: int = 10):
"""
Generate smiles with fixed left and/or right terminal atoms.
The right atom must be terminal if set. Use a temporary attached atom with remove_right=True as a workaround.
:param remove_left: drop terminal atom and corresponding bond
:param remove_right: drop terminal atom and corresponding bond
:param tries: number of attempts to generate smiles
"""
bonds = self._bonds
if right:
assert tries > 0, 'tries count should be positive'
assert len(bonds[right]) == 1, 'right atom should be terminal'
assert left != right, 'left and right atoms the same'
assert self.connected_components_count == 1, 'only single component structures supported'
seen = {right: 0}
queue = [(right, -10)]
while queue:
n, d = queue.pop(0)
for m in bonds[n].keys() - seen.keys():
queue.append((m, d - 10))
seen[m] = d
if left:
bonds[left] # noqa. check left atom availability
seen[left] = -1_000_000_000 # prioritize left atom
for _ in range(tries):
smiles, order = self._smiles(lambda x: seen[x] + random(), _return_order=True, random=True)
if order[-1] == right:
break
else:
raise Exception('generation of smiles failed')
if remove_left:
smiles = smiles[2:]
if remove_right:
smiles = smiles[:-2]
elif left:
bonds[left] # noqa. check left atom availability
smiles = self._smiles(lambda x: x != left, random=True)
if remove_left:
smiles = smiles[2:]
else:
raise ValueError('either left or right atom should be specified')
return ''.join(smiles)
def _smiles_order(self: 'MoleculeContainer', stereo=True):
if stereo:
return self._chiral_morgan.__getitem__
else:
return self.atoms_order.__getitem__
def _format_cxsmiles(self: 'MoleculeContainer', order):
cx = []
rd = []
es = defaultdict(list)
atoms = self._atoms
for i, n in enumerate(order):
a = atoms[n]
if a.is_radical:
rd.append(str(i))
if (s := a.extended_stereo) is not None:
if s < 0:
es[f'o{-s}:'].append(str(i))
elif s > 0:
es[f'&{s}:'].append(str(i))
if rd:
cx.append('^1:' + ','.join(rd))
if es:
for k in sorted(es):
cx.append(k + ','.join(es[k]))
if cx:
return '|' + ','.join(cx) + '|'
return None
def _format_atom(self: 'MoleculeContainer', n, adjacency, **kwargs):
atom = self._atoms[n]
smi = ['', # [
str(atom.isotope) if atom.isotope else '', # isotope
None,
'', # stereo
'', # hydrogen
'', # charge
f':{n}' if kwargs.get('mapping', False) else '', # mapping
''] # ]
if atom.stereo is not None and kwargs.get('stereo', True):
# allene
if n in self._stereo_allenes_terminals:
t1, t2 = self._stereo_allenes_terminals[n]
env = self.stereogenic_allenes[n]
n1 = next(x for x in adjacency[t1] if x in env)
n2 = next(x for x in adjacency[t2] if x in env)
smi[3] = '@' if self._translate_allene_sign(n, n1, n2) else '@@'
# tetrahedron
elif atom.implicit_hydrogens and next(x for x in adjacency) == n:
# first atom in smiles has reversed chiral mark
smi[3] = '@@' if self._translate_tetrahedron_sign(n, adjacency[n]) else '@'
else:
smi[3] = '@' if self._translate_tetrahedron_sign(n, adjacency[n]) else '@@'
if atom.charge and kwargs.get('charges', True):
smi[5] = charge_str[atom.charge]
if any(smi) or atom.atomic_symbol not in organic_set or atom.is_radical or kwargs.get('hydrogens', False):
smi[0] = '['
smi[-1] = ']'
if atom.implicit_hydrogens == 1:
smi[4] = 'H'
elif atom.implicit_hydrogens:
smi[4] = f'H{atom.implicit_hydrogens}'
elif atom.hybridization == 4 and atom.implicit_hydrogens and atom in (B, N, P): # pyrrole
smi[0] = '['
smi[-1] = ']'
if atom.implicit_hydrogens == 1:
smi[4] = 'H'
else:
smi[4] = f'H{atom.implicit_hydrogens}'
elif not atom.implicit_hydrogens and atom in (B, C, P, S) and not self.not_special_connectivity[n]:
# elemental B, C, P, S
smi[0] = '['
smi[-1] = ']'
elif atom.implicit_hydrogens and atom == P and atom.hybridization != 1:
smi[0] = '['
smi[-1] = ']'
if atom.implicit_hydrogens == 1:
smi[4] = 'H'
else:
smi[4] = f'H{atom.implicit_hydrogens}'
if kwargs.get('aromatic', True) and atom.hybridization == 4:
smi[2] = atom.atomic_symbol.lower()
else:
smi[2] = atom.atomic_symbol
return ''.join(smi)
def _format_bond(self: Union['MoleculeContainer', 'MoleculeSmiles'], n, m, adjacency, **kwargs):
if not kwargs.get('bonds', True):
return ''
bond = self._bonds[n][m]
if bond == 4:
if kwargs.get('aromatic', True):
return ''
return ':'
elif bond == 1: # cis-trans /\
if kwargs.get('aromatic', True) and self._atoms[n].hybridization == self._atoms[m].hybridization == 4:
return '-'
if kwargs.get('stereo', True):
if 'cache' in adjacency:
ct_map = adjacency['cache']
else:
ct_map = adjacency['cache'] = self.__ct_map(adjacency)
if (x := ct_map.get((n, m))) is not None:
return '/' if x else '\\'
return ''
elif bond == 2:
return '='
elif bond == 3:
return '#'
else: # bond == 8
return '~'
def __ct_map(self: 'MoleculeContainer', adjacency):
stereo_bonds = {n for n, mb in self._bonds.items() if any(b.stereo is not None for m, b in mb.items())}
if not stereo_bonds:
return {}
ct_map = {}
sct = self.stereogenic_cis_trans
ctc = self._stereo_cis_trans_centers
ctt = self._stereo_cis_trans_terminals
ctcp = self._stereo_cis_trans_counterpart
seen = set()
for k, vs in adjacency.items():
seen.add(k)
if (cs := ctc.get(k)) and stereo_bonds.issuperset(cs):
env = sct[ctt[k]]
for v in vs:
if v in env:
if (k, v) in ct_map:
continue
elif x := ct_map.get(k): # second substituent of C=
s = ct_map[(k, x)]
ct_map[(k, v)] = not s # X/C(/R)=, C(\X)(/R)=, C(=C(\X)/R)=C=
ct_map[(v, k)] = s
if y := ctc.get(v): # =C(\X)/R=, C(\X)(/R=)=
ct_map[v] = k
seen.add(y)
elif cs in seen:
o = ctcp[k]
on = ct_map[o]
s = ct_map[(o, on)]
if not self._translate_cis_trans_sign(k, o, v, on):
s = not s
ct_map[(k, v)] = s
ct_map[k] = v
ct_map[(v, k)] = not s # C/R=, R\1...C/1
if y := ctc.get(v):
ct_map[v] = k
seen.add(y)
else: # left entry to double bond
if y := ctc.get(v): # 1,3-diene case
ct_map[v] = k
seen.add(y)
ct_map[(v, k)] = True # R/C=, C\1=...R/1, C(/R=)=, C(=C(/R=))=C=
ct_map[(k, v)] = False # first DOWN
ct_map[k] = v
seen.add(cs)
return ct_map
class CGRSmiles(Smiles):
__slots__ = ()
def _smiles_order(self: 'CGRContainer', stereo=True):
return self.atoms_order.__getitem__
def _format_atom(self: 'CGRContainer', n, adjacency, **kwargs):
atom = self._atoms[n]
if atom.isotope:
smi = [str(atom.isotope), atom.atomic_symbol]
else:
smi = [atom.atomic_symbol]
if atom.charge or atom.p_charge:
smi.append(dyn_charge_str[(atom.charge, atom.p_charge)])
if atom.is_radical or atom.p_is_radical:
smi.append(dyn_radical_str[(atom.is_radical, atom.p_is_radical)])
if len(smi) != 1 or atom.atomic_symbol not in organic_set:
smi.insert(0, '[')
smi.append(']')
return ''.join(smi)
def _format_bond(self: 'CGRContainer', n, m, adjacency, **kwargs):
bond = self._bonds[n][m]
return dyn_order_str[(bond.order, bond.p_order)]
__all__ = ['MoleculeSmiles', 'CGRSmiles']