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

Listing Degree Restricted Trees

Although stack overflow is generally just an endless source of questions on the lines of "HALP plz give CODES!? ... NOT homeWORK!! - don't close :(" occasionally you get more interesting ones. For example this one that asks about degree-restricted trees. Also there's some stuff about vertex labelling, but I think I've slightly missed something there.

In any case, lets look at the simpler problem : listing non-isomorphic trees with max degree 3. It's a nice small example of a general approach that I've been thinking about. The idea is to:
Given N vertices, partition 2(N - 1) into N parts of at most 3 -> D = {d0, d1, ... }For each d_i in D, connect the degrees in all possible ways that make trees.Filter out duplicates within each set generated by some d_i. Hmm. Sure would be nice to have maths formatting on blogger....

Anyway, look at this example for partitioning 12 into 7 parts:

At the top are the partitions, in the middle the trees (colored by degree) …

Common Vertex Matrices of Graphs

There is an interesting set of papers out this year by Milan Randic et al (sorry about the accents - blogger seems to have a problem with accented 'c'...). I've looked at his work before here.

[1] Common vertex matrix: A novel characterization of molecular graphs by counting
[2] On the centrality of vertices of molecular graphs

and one still in publication to do with fullerenes. The central idea here (ho ho) is a graph descriptor a bit like path lengths called 'centrality'. Briefly, it is the count of neighbourhood intersections between pairs of vertices. Roughly this is illustrated here:


For the selected pair of vertices, the common vertices are those at the same distance from each - one at a distance of two and one at a distance of three. The matrix element for this pair will be the sum - 2 - and this is repeated for all pairs in the graph. Naturally, this is symmetric:


At the right of the matrix is the row sum (∑) which can be ordered to provide a graph invarian…

How many isomers of C4H11N are there?

One of the most popular queries that lands people at this blog is about the isomers of C4H11N - which I suspect may be some kind of organic chemistry question on student homework. In any case, this post will describe how to find all members of a small space like this by hand rather than using software.

Firstly, lets connect all the hydrogens to the heavy atoms (C and N, in this case). For example:


Now eleven hydrogens can be distributed among these five heavy atoms in various ways. In fact this is the problem of partitioning a number into a list of other numbers which I've talked about before. These partitions and (possible) fragment lists are shown here:


One thing to notice is that all partitions have to have 5 parts - even if one of those parts is 0. That's not strictly a partition anymore, but never mind. The other important point is that some of the partitions lead to multiple fragment lists - [3, 3, 2, 2, 1] could have a CH+NH2 or an NH+CH2.

The final step is to connect u…