Understanding the complexity of the cellular machinery represents a grand challenge in molecular biology. To contribute to the deconvolution of this complexity, a novel inference algorithm based on linear ordinary differential equations is proposed, based on high-throughput gene expression data. The algorithm can infer (i) gene-gene interactions from steady state expression profiles AND (ii) mode-of-action of the components that can trigger changes in the system.

In recent years, the development of high throughput devices for the massive parallel analyses of genomic data has lead to the generation of large amount of new biological evidences and has triggered the proliferation of data mining algorithms for the extraction of meaningful information. Microarrays for gene expression analyses are part of this revolution and provide important insight in molecular biology often in the form of coherent sets of genes representing previously uncharacterized processes.

The biclustering method can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse in gene expression measurement. This is because the biclustering approach, in contrast to the conventional clustering techniques, focuses on finding a subset of the genes and a subset of the experimental conditions that together exhibit coherent behavior. However, the biclustering problem is inherently intractable, and it is often computationally costly to find biclusters with high levels of coherence.

Mathematical models based on non-linear integral and integro-differential equations are gaining increasing attention in mathematical epidemiology due to their ability to incorporate the past infection dynamic into its current development. This property is particularly suitable to represent the evolution of diseases where the dependence of infectivity on the time since becoming infected plays a crucial role.

The study of complex hereditary diseases is a very challenging area of research. The expanding set of in silico approaches offers a flourishing ground for the acceleration of meaningful findings in this area by exploitation of rich and diverse sources of omic data. These approaches are cheap, flexible, extensible, often complementary and can continuously integrate new information and tests to improve the selection of genes responsible for hereditary diseases.

Advances in experimental biology, coupled with advances in computational power, bring new challenges to the interdisciplinary field of computational biology. One such broad challenge lies in the reverse engineering of gene networks, and goes from determining the structure of static networks, to reconstructing the dynamics of interactions from time series data. Here, we focus our attention on the latter area, and in particular, on parameterizing a dynamic network of oriented interactions between genes.

We describe preliminary results from a multiobjective graph matching algorithm, in the coarsening step of an aggregation-based Algebraic MultiGrid (AMG) preconditioner, for solving large and sparse linear systems of equations on highend parallel computers. We have two objectives. First, we wish to improve the convergence behavior of the AMG method when applied to highly anisotropic problems. Second, we wish to extend the parallel package PSCToolkit to exploit multi-threaded parallelism at the node level on multi-core processors.

Degeneration is a hallmark of autoimmune diseases, whose incidence grows worldwide. Current therapies attempt to control the immune response to limit degeneration, commonly promoting immunodepression. Differently, mechanical stimulation is known to trigger healing (regeneration) and it has recently been proposed locally for its therapeutic potential on severely injured areas.