Skip to main content

Open Molecule Generator's Algorithm

With the recent release of the Open Molecule Generator (OMG) I thought it would be nice to add to (or augment) the description of the algorithm in the paper. The description here will be in terms of graphs, but the principle is largely the same.

OMG's algorithm is a variant of McKay's canonical path augmentation algorithm, as mentioned before here. However, instead of augmenting by vertex it augments by edges. To illustrate this, consider a diagram for graphs with up to 4 vertices:
The graphs are grouped by vertex count (boxes), and each box is sorted into columns. Along the top are the number of edges for graphs in that column, and along the bottom are number of vertices for graphs in the box. Two graphs are connected by an arrow if the larger can be made from the smaller by adding a single edge.

A couple of important things to note about edge-addition are : 1) two paths can lead to the same graph, and 2) at least one of the graphs is disconnected. The first of these is solved by canonical augmentation; a bond is only added if it is the inverse of a canonical deletion. For example:



The image above shows two parent graphs on the left, and an extension of each on their right. The extensions are isomorphic, and have the same canonical form on the far right. The canonical deletion edge is 2:3 - which maps to 0:3 in both graphs. Only one extension is equivalent to the canonical deletion edge.

The second problem - that of disconnected graphs - is only a problem if the canonicalisation routine cannot handle such graphs. Unfortunately, this currently applies to signatures; luckily OMG uses nauty for this part, which doesn't suffer from this limitation. An example of extending a disconnected graph is shown below:

Clearly connected graphs can be constructed from disconnected ones, although it is possible that a canonicalisation method could be designed that avoided disconnected parents. In other words, one that only chose edges that didn't separate the graph.

One final important point is that the OMG algorithm cannot proceed by extending every member of the set of graphs G(n) on n vertices to get non-redundant G(n + 1). For example, extending from both of the members of G(3) will produce multiple copies of one of G(4) - at least, in my test code. This might rule out one easy way to run the program in parallel (running separate subtrees in different processes), but possibly could be solved by using a subset of G(n) to generate the next level.

Comments

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