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:

ZZZ.O6A:O.sp2
ZZZ.H7C1:H
ZZZ.H7C2:H
ZZZ.H8:H
ZZZ.H2N1:H
ZZZ.H2N2:H
ZZZ.H3:H
ZZZ.H5:H
ZZZ.H6:H
ZZZ.H6A:H
'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?

Comments

Popular posts from this blog

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…

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…

Signatures with user-defined edge colors

A bug in the CDK implementation of my signature library turned out to be due to the fact that the bond colors were hard coded to just recognise the labels {"-", "=", "#" }. The relevant code section even had an XXX above it!

Poor show, but it's finally fixed now. So that means I can handle user-defined edge colors/labels - consider the complete graph (K5) below:

So the red/blue colors here are simply those of a chessboard imposed on top of the adjacency matrix - shown here on the right. You might expect there to be at least two vertex signature classes here : {0, 2, 4} and {1, 3} where the first class has vertices with two blue and two red edges, and the second has three blue and two red.

Indeed, here's what happens for K4 to K7:

Clearly even-numbered complete graphs have just one vertex class, while odd-numbered ones have two (at least?). There is a similar situation for complete bipartite graphs:

Although I haven't explored any more of these…