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
|
# New CIP labelling
This is a C++ port of https://github.com/SiMolecule/centres, which was
originally written by John Mayfield in Java. The original algorithm was
described in:
Hanson, R. M., Musacchio, S., Mayfield, J. W., Vainio, M. J., Yerin, A.,
Redkin, D. Algorithmic Analysis of Cahn--Ingold--Prelog Rules of
Stereochemistry: Proposals for Revised Rules and a Guide for Machine
Implementation. J. Chem. Inf. Model. 2018, 58, 1755-1765.
### Details
The main function is C++ RDKit:: CIPLabeler::assignCIPLabels()/ Python:
rdkit.Chem.rdCIPLabeler.AssignCIPLabels().
`assignCIPLabels()` calculates E/Z bond stereochemistry, R/S tetrahedral
chirality, and r/s pseudochirality according to the Cahn--Ingold--Prelog rules.
Each is stored in the _CIPCode property - including for bonds.
assignCIPLabels() relies on the caller to mark potential stereocenters.
### A couple of remarks:
- This does not perceive potential stereochemical configurations in the
molecule: the input already needs to have information on which atoms/bonds
should be labeled. Also, for resolution of tetrahedral chirality, the parity
of the atoms is required, and for double bond stereochemistry, the bond must
have the appropriate bond directions set on the neighboring bonds.
- The input molecule does not require all Hydrogens to be explicit, the code
will take them into account appropriately.
- Stereochemical labels will be applied by setting the "_CIPCode" property
on the relevant atoms and bonds.
### Some potential points of improvement might be:
- Implement the stereo configuration modes that haven't been ported yet
(atropoisomery, Square planar, extended tetrahedral & cis/trans...). These
haven't been ported yet because RDKit cannot perceive these.
- Digraph generation/handling. It might be useful to improve the way nodes,
edges and the digraph itself are handled, so that they don't need to be passed
around as pointers. It might also be useful to port this to use boost::graph.
- Handling of rules & sorting -- also to avoid pointers that might leak.
- Improve handling of vectors of nodes/edges. This was a quick way of porting
over Java lists and arrays, but it might be improved (e.g. by using std::array)
in some situations where the final/expected sizes are known.
- Check for bugs and add (much) more testing, as the current tests barely
scratch the surface.
|
