Skip to main content

Spectral Full House

So, all of the isomers of C4H11O are in NMRShiftDB and here are all the experimental and predicted carbon spectra:

It's not obvious from this picture, but not all of the predicted spectra are unique matches for their experimental partners. In other words, you could not pick out the right molecule by comparing the predicted and experimental spectra.

The situation is more difficult still for larger isomer spaces, where the predicted spectra may be exactly the same for sub-sets of the isomers. There are still many with unique predictions, but the rest follow a sort of power-law distribution of spectral-equivalent sets.

EDIT: As per a suggestion by egon, here is a table of top hits (a yellow square indicates the top match):


Nice example.

1. Now, the next step is to express the proper similarity of the predicted versus experimental spectrum. A 7x7 matrix. If you color the cells of that matrix by similarity, you should immediately see a trace on on the diagonal (if matches are properly found). You'll notice that not every similarity measure is equally sensitive for this data. (Check bc_seneca for my suggested measure :)

2. I also would like to see if it works out nicely for the oxygens... since these are much more alike, I expect two group: hydroxyl and ether, but am interested in seeing the results for that too... just out of curiosity...
cic said…
Very nice indeed.
It will be interesting to see how this does statistically develop over a larger number of test sets. Since we have already demonstrated that a-pinene can be found in a C10H16 chemical space, it is not safe to assume that the number of degenerate cases grows in some clear way with the number of atoms in the molecular formular.
CIC, what information was used for that, only 1D 13C data, and what 13NMR prediction software?

Christoph's SENECA code can easily find a-pinene too, particularly when hydrogen count info for the carbons is included (DEPT experiment).

CIC, I noted that your blog is empty? Do you have yet to start blogging? And, at which university is your fachgruppe? CIC, as in the former Gasteiger group?
Gilleain, the matrix is interesting. You mentioned as there are a few clearly off-diagonal hits. Which similarity measure did you use there? Can you please try the WCC too? Source code can be found in the Bioclipse1 repository.
gilleain said…
Hei Egon,

I used the simplest possible similarity measure, which is the sum of the differences between pairs of equivalent peaks, where equivalence is based on respective order in the peak lists.

I don't know what the WCC code is weighting by, I should look at it again (and get Mark to translate the code comments, some of which are in Dutch :)

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…