We explain how to organize the atoms resulting from clique minimal separator decomposition into a metagraph which we call the atom graph, and give an efficient recursive algorithm to compute this graph at no extra cost than computing the atoms.

The paper discusses the approach to solving problem of processing metagraphs using Big Data technology. formal definition metagraph data model and agent are given. representation flat graph is discussed. described. architecture system for in agents based on technology experiments result parallel

A recent trend of research uses graphs to modelize experimental microarray data. Recently, we used graph separators to group a set of 40 genes from a yeast database of Saccharomyces cerevisiae into very coherent clusters. Here, we extend our investigation to all 518 genes of S. cerevisiae which have reacted during the sporulation process. We propose a recursive decomposition into coherent clust...

Protein-protein interaction (PPI) networks play an important role in studying the functional roles of proteins, including their association with diseases. However, protein interaction networks are not sufficient without the support of additional biological knowledge for proteins such as their molecular functions and biological processes. To complement and enrich PPI networks, we propose to expl...