Skip to main content

Multi-view

A quick example of a mini-application made using the new JChempaint renderer:

the picture is of an isomer space (C3H7NO), with compact mode on and atoms rendered as circles. The code is here, for now:

http://gist.github.com/70342

which is a kind of dumb way to achieve this, as it creates an instance of a renderer for each molecule, instead of adding them to a molecule set, and then laying that out...

edit: just realised; it's rendering the hydrogens as compact black circles :(

edit2: Ahhh. that's better:



edit3: Ha! This was a mistake, but it looks kind of cool:

Comments

Rajarshi said…
Very cool. From your description I understand that it'd be possible to layout multiple molecules with a single renderer? Does this mean it can layout disconnected components? Or should that be done by splitting it up and supplying it as a 2 item IMoleculeSet?
I just wondered if this might be a better molecular table for Bioclipse... I know the traditional spreadsheet approach, with structures and properties in rows...

But Bioclipse actually has a Properties View, so why not show a table like yours, and just have all the properties stay i nthe Properties View...
gilleain said…
Rajarshi: It's possible to render disconnected atom containers, or molecule sets. However, the renderer will not lay them out.

A nice (future!) project would be to make layout managers - probably using the same command design pattern as java does (LayoutManager).

Egon: Maybe, maybe not. When you get very large numbers, there's not much difference between 5 columns of 100 rows and one column and 500 rows.

Well, okay, so the difference is 400, but still.

Oh, now I see. The properties for each item would be down below. Hmmm.
Abhishek Tiwari said…
Aha, I am impressed with this blog, I just added this on my list of blogs about bioinformatics and chemoinformatics programming-

http://www.abhishek-tiwari.com/2009/02/30-blogs-about-bioinformatics-and.html
Gilleain, or on the left or right side... you choose :)

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…