Skip to main content

Atom-typing the Hetgroup Dictionary

So I posted this to CDK-devel, but probably this is the better place...

I've been trying to make a map between the atom IDs used in the HET dictionary (which is in CIF format) and atom types of some sort. To see what this looks like, here is a tail of the file:

'Zzzz', you may be thinking, but although many atom ids are quite obvious (like H8 is a hydrogen), some are probably not. One annoying aspect of this process was that the CIF file format is not especially friendly, and particularly, the file has 'loop_'s that don't terminate in octothorpes ('#'), as I thought they would.

Probably the parser (an IteratingCIFReader) could be much better written - in fact, it will probably only parse this one CIF! So my initial estimates of 13,000 typing failures is now down to only 3,508. What are the atoms that fail? There are some that are bound to like TBR, which is decidedly a non-organic molecule.

Quite a few, however, are aromatic chlorines:

Null type for 00A CL4A [CL]([C]([C]=[C]))
Null type for 014 CL [CL]([C]([C]=[C]))
Null type for 01A CL4A [CL]([C]([C]=[C]))
Null type for 01W N [N]([C]([C][C][H])[H][H][H])
Null type for 024 BR19 [BR]([C]([C]=[C]))
Null type for 032 CL13 [CL]([C](=[C][C]))
Null type for 039 CL [CL]([C](=[C][C]))
Null type for 055 CL1 [CL]([C](=[C][C]))
Null type for 062 CL1 [CL]([C]([C]=[C]))
Null type for 064 CL13 [CL]([C]([C]=[C]))
Null type for 064 CL15 [CL]([C](=[C][C]))
Null type for 064 CL25 [CL]([C](=[C][C]))
Null type for 088 CL32 [CL]([C](=[C][C]))
Null type for 088 CL37 [CL]([C]([C]=[C]))
The last part is the height-2 signature, just to give a quick idea of the environment of the atom. Aha! Some quick "cut | sort | uniq -c | sort -n" gives me:
24 [BR]([C]([C][H][H]))
29 [CL]([C](=[C][N]))
29 [CL]([C](=[C][S]))
38 [N]([C]([C][C][H])[H][H][H])
42 [N]([C]([C][H][H])[H][H][H])
48 [CL]([C]([C][H][H]))
75 [N]([C]([C][H][H])[C]([H][H][H])[C]([H][H][H])[C]([H][H][H]))
337 [BR]([C]([C]=[C]))
1176 [CL]([C]([C]=[C]))
gives the 'top-10' worst offenders. That nitrogen one is N(CH3)4 - perhaps charge is a problem here?


Popular posts from this blog

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…

Havel-Hakimi Algorithm for Generating Graphs from Degree Sequences

A degree sequence is an ordered list of degrees for the vertices of a graph. For example, here are some graphs and their degree sequences:

Clearly, each graph has only one degree sequence, but the reverse is not true - one degree sequence can correspond to many graphs. Finally, an ordered sequence of numbers (d1 >= d2 >= ... >= dn > 0) may not be the degree sequence of a graph - in other words, it is not graphical.

The Havel-Hakimi (HH) theorem gives us a way to test a degree sequence to see if it is graphical or not. As a side-effect, a graph is produced that realises the sequence. Note that it only produces one graph, not all of them. It proceeds by attaching the first vertex of highest degree to the next set of high-degree vertices. If there are none left to attach to, it has either used up all the sequence to produce a graph, or the sequence was not graphical.

The image above shows the HH algorithm at work on the sequence [3, 3, 2, 2, 1, 1]. Unfortunately, this produce…

Generating Dungeons With BSP Trees or Sliceable Rectangles

So, I admit that the original reason for looking at sliceable rectangles was because of this gaming stackoverflow question about generating dungeon maps. The approach described there uses something called a binary split partition tree (BSP Tree) that's usually used in the context of 3D - notably in the rendering engine of the game Doom. Here is a BSP tree, as an example:

In the image, we have a sliced rectangle on the left, with the final rectangles labelled with letters (A-E) and the slices with numbers (1-4). The corresponding tree is on the right, with the slices as internal nodes labelled with 'h' for horizontal and 'v' for vertical. Naturally, only the leaves correspond to rectangles, and each internal node has two children - it's a binary tree.

So what is the connection between such trees and the sliceable dual graphs? Well, the rectangles are related in exactly the expected way:

Here, the same BSP tree is on the left (without some labels), and the slicea…