Skip to main content

Alternative Molecule Generation Implementation using the CDK and Signatures

Over the weekend, I cobbled together some components that I've been developing for a while (the past four years in fact) to make a molecule structure generator. As described in recent posts, OMG is one new available solution; now here is a proof-of-concept for a quite similar one.

So what are the differences? Well, firstly OMG uses NautY to check candidates for canonicity while this implementation uses signatures, so is currently slower. The major difference, though is the algorithm. While OMG uses bond-augmentation of a parent structure to make children, this one uses atom-augmentation. Here is a small example (augmenting ethane):

Of course, these are only the immediate children of the C-C parent; for OMG the unique, canonical ones will themselves be augmented further until they are the right size and have the correct number of hydrogens. The atom-augmentation algorithm, by contrast, produces a next generation with exactly one new atom, but a different number of bonds.

The slightly tricky part was to generate all possible combinations of bonds to add. There might be many ways to do this, but the way I picked was this:


Here we are augmenting the C=C(O)C structure on the left to get a cyclobuten-1-ol on the right. First, the atoms that can be added to are calculated using the bond-order sum (bos) : only atoms that are 'undersaturated' can have new bonds. Then all possible multisets are generated, up to the max degree of the added atom (so: {{1,1,1,1}, {1, 1, 2}, {2, 2}...). Finally these multisets are converted to 'bond order arrays' which are just a list of bond orders to attach to each atom.

For the child-filtering approach used in OMG, the algorithm is much the same. For the alternative 'symmetry' approach, the automorphism group of the parent is used to select the bond order array that is minimal in its orbit. Either way, a set of non-redundant children is produced which can then be tested for canonicity.

At the moment, this implementation has had a small amount of testing on alkene (CnH2n) structures to check that it gets the numbers right, but more rigorous testing on different series is necessary. Then some optimisations could be tried to get the time closer to OMG (at least).

Comments

Tobias said…
Hi,
any chance of providing a compiled JAR file and readme.txt
with examples for the command line such as java -jar AMG.jar C6H6

Of course SDF file generation would be important, to validate
with INCHIKeys.

Cheers
Tobias
gilleain said…
Hi Tobias,

I'll give it a go, although at the moment the element handling is very limited, although there are no technical barriers to expanding it. It also could be better tested, and better optimized, and (as you rightly point out) better documented.

gilleain

Popular posts from this blog

Adamantane, Diamantane, Twistane

After cubane, the thought occurred to look at other regular hydrocarbons. If only there was some sort of classification of chemicals that I could use look up similar structures. Oh wate, there is . Anyway, adamantane is not as regular as cubane, but it is highly symmetrical, looking like three cyclohexanes fused together. The vertices fall into two different types when colored by signature: The carbons with three carbon neighbours (degree-3, in the simple graph) have signature (a) and the degree-2 carbons have signature (b). Atoms of one type are only connected to atoms of another - the graph is bipartite . Adamantane connects together to form diamondoids (or, rather, this class have adamantane as a repeating subunit). One such is diamantane , which is no longer bipartite when colored by signature: It has three classes of vertex in the simple graph (a and b), as the set with degree-3 has been split in two. The tree for signature (c) is not shown. The graph is still bipartite accordin

Király's Method for Generating All Graphs from a Degree Sequence

After posting about the Hakimi-Havel  theorem, I received a nice email suggesting various relevant papers. One of these was by Zoltán Király  called " Recognizing Graphic Degree Sequences and Generating All Realizations ". I have now implemented a sketch of the main idea of the paper, which seems to work reasonably well, so I thought I would describe it. See the paper for details, of course. One focus of Király's method is to generate graphs efficiently , by which I mean that it has polynomial delay. In turn, an algorithm with 'polynomial delay' takes a polynomial amount of time between outputs (and to produce the first output). So - roughly - it doesn't take 1s to produce the first graph, 10s for the second, 2s for the third, 300s for the fourth, and so on. Central to the method is the tree that is traversed during the search for graphs that satisfy the input degree sequence. It's a little tricky to draw, but looks something like this: At the top

1,2-dichlorocyclopropane and a spiran

As I am reading a book called "Symmetry in Chemistry" (H. H. Jaffé and M. Orchin) I thought I would try out a couple of examples that they use. One is 1,2-dichlorocylopropane : which is, apparently, dissymmetric because it has a symmetry element (a C2 axis) but is optically active. Incidentally, wedges can look horrible in small structures - this is why: The box around the hydrogen is shaded in grey, to show the effect of overlap. A possible fix might be to shorten the wedge, but sadly this would require working out the bounds of the text when calculating the wedge, which has to be done at render time. Oh well. Another interesting example is this 'spiran', which I can't find on ChEBI or ChemSpider: Image again courtesy of JChempaint . I guess the problem marker (the red line) on the N suggests that it is not a real compound? In any case, some simple code to determine potential chiral centres (using signatures) finds 2 in the cyclopropane structure, and 4 in the