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

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 Trees

Tree generation is a well known (and solved!) problem in computer science. On the other hand, it's pretty important for various problems - in my case, making tree-like fusanes. I'll describe here the slightly tortuous route I took to make trees.

Firstly, there is a famous theorem due to Cayley that the number of (labelled) trees on n vertices is nn - 2 which can be proved by using Prüfer sequences. That's all very well, you might well say - but what does all this mean?

Well, it's not all that important, since there is a fundamental problem with this approach : the difference between a labelled tree and an unlabelled tree. There are many more labeled trees than unlabeled :


There is only one unlabeled tree on 3 vertices, but 3 labeled ones
this is easy to check using the two OEIS sequences for this : A000272 (labeled) and A000055 (unlabeled). For n ranging from 3 to 8 we have [3, 16, 125, 1296, 16807, 262144] labeled trees and [1, 2, 3, 6, 11, 23] unlabeled ones. Only 23 …