ChEBI in Bioclipse

Says it all, really.

The scrolling can hang if you move too fast, which might be due to garbage collection? It is a very large file....

Comments

How large is the file? Can I download it somewhere? Should we set up a ChEBI plugin, perhaps? Or maybe have this ChEBI data as data plugin? That would be easiest...

26 April 2009 at 09:32

gilleain said…

1) 58.2 Mb
2) From the ebi ftp site - I /think/ the ChEBI team meant it to be public, but I will ask them
3) Probably not, they have a good website for this purpose.
4) Maybe, but again, depending on the team.

It is a nice test for bioclipse, but there are other similar tests, in a way.

26 April 2009 at 11:17

Kirill said…

Re. (2): It should appear on ftp next Wednesday (April ChEBI release).

26 April 2009 at 20:33

Kirill said…

Check ftp://ftp.ebi.ac.uk/pub/databases/chebi/SDF/. The data is provided in two flavours:
* Chebi_lite.sdf file contains only the chemical structure, ChEBI identifier and ChEBI Name.
* Chebi_complete.sdf file contains all the chemical structures and associated information.

29 April 2009 at 18:30

Adamantane, Diamantane, Twistane

After cubane, the thought occurred to look at other regular hydrocarbons. If only there was some sort of classification of chemicals that I could use look up similar structures. Oh wate, there is . Anyway, adamantane is not as regular as cubane, but it is highly symmetrical, looking like three cyclohexanes fused together. The vertices fall into two different types when colored by signature: The carbons with three carbon neighbours (degree-3, in the simple graph) have signature (a) and the degree-2 carbons have signature (b). Atoms of one type are only connected to atoms of another - the graph is bipartite . Adamantane connects together to form diamondoids (or, rather, this class have adamantane as a repeating subunit). One such is diamantane , which is no longer bipartite when colored by signature: It has three classes of vertex in the simple graph (a and b), as the set with degree-3 has been split in two. The tree for signature (c) is not shown. The graph is still bipartite accordin

Király's Method for Generating All Graphs from a Degree Sequence

After posting about the Hakimi-Havel theorem, I received a nice email suggesting various relevant papers. One of these was by Zoltán Király called " Recognizing Graphic Degree Sequences and Generating All Realizations ". I have now implemented a sketch of the main idea of the paper, which seems to work reasonably well, so I thought I would describe it. See the paper for details, of course. One focus of Király's method is to generate graphs efficiently , by which I mean that it has polynomial delay. In turn, an algorithm with 'polynomial delay' takes a polynomial amount of time between outputs (and to produce the first output). So - roughly - it doesn't take 1s to produce the first graph, 10s for the second, 2s for the third, 300s for the fourth, and so on. Central to the method is the tree that is traversed during the search for graphs that satisfy the input degree sequence. It's a little tricky to draw, but looks something like this: At the top

General Graph Layout : Putting the Parts Together

An essential tool for graph generation is surely the ability to draw graphs. There are, of course, many methods for doing so along with many implementations of them. This post describes one more (or perhaps an existing method - I haven't checked). Firstly, lets divide a graph up into two parts; a) the blocks, also known as ' biconnected components ', and b) trees connecting those blocks. This is illustrated in the following set of examples on 6 vertices: Trees are circled in green, and blocks in red; the vertices in the overlap between two circles are articulation points. Since all trees are planar, a graph need only have planar blocks to be planar overall. The layout then just needs to do a tree layout on the tree bits and some other layout on the embedding of the blocks. One slight wrinkle is shown by the last example in the image above. There are three parts - two blocks and a tree - just like the one to its left, but sharing a single articulation point. I had

Some Stuff

Search This Blog