The Polycomb system via the methylation of the lysine 27 of histone H3 (H3K27) plays central roles in the silencing of many lineage-specific genes during development. Recent experimental evidence suggested that the recruitment of histone modifying enzymes like the Polycomb repressive complex 2 (PRC2) at specific sites and their spreading capacities from these sites are key to the establishment and maintenance of a proper epigenomic landscape around Polycomb-target genes. Here, to test whether such mechanisms, as a minimal set of qualitative rules, are quantitatively compatible with data, we developed a mathematical model that can predict the locus-specific distributions of H3K27 modifications based on previous biochemical knowledge. Within the biological context of mouse embryonic stem cells, our model showed quantitative agreement with experimental profiles of H3K27 acetylation and methylation around Polycomb-target genes in wild-type and mutants. In particular, we demonstrated the key role of the reader-writer module of PRC2 and of the competition between the binding of activating and repressing enzymes in shaping the H3K27 landscape around transcriptional start sites. The predicted dynamics of establishment and maintenance of the repressive trimethylated H3K27 state suggest a slow accumulation, in perfect agreement with experiments. Our approach represents a first step towards a quantitative description of PcG regulation in various cellular contexts and provides a generic framework to better characterize epigenetic regulation in normal or disease situations.

MOTIVATION: Skeletal muscle dysfunction is a systemic effect in one-third of patients with chronic obstructive pulmonary disease (COPD), characterized by high reactive-oxygen-species (ROS) production and abnormal endurance training-induced adaptive changes. However, the role of ROS in COPD remains unclear, not least because of the lack of appropriate tools to study multifactorial diseases. RESULTS: We describe a discrete model-driven method combining mechanistic and probabilistic approaches to decipher the role of ROS on the activity state of skeletal muscle regulatory network, assessed before and after an 8-week endurance training program in COPD patients and healthy subjects. In COPD, our computational analysis indicates abnormal training-induced regulatory responses leading to defective tissue remodeling and abnormal energy metabolism. Moreover, we identified tnf, insr, inha and myc as key regulators of abnormal training-induced adaptations in COPD. The tnf-insr pair was identified as a promising target for therapeutic interventions. Our work sheds new light on skeletal muscle dysfunction in COPD, opening new avenues for cost-effective therapies. It overcomes limitations of previous computational approaches showing high potential for the study of other multi-factorial diseases such as diabetes or cancer. CONTACT: [email protected] or [email protected] information: Supplementary data are available at Bioinformatics online.

The liver performs many essential metabolic functions, which can be studied using computational models of hepatocytes. Here we present HepatoDyn, a highly detailed dynamic model of hepatocyte metabolism. HepatoDyn includes a large metabolic network, highly detailed kinetic laws, and is capable of dynamically simulating the redox and energy metabolism of hepatocytes. Furthermore, the model was coupled to the module for isotopic label propagation of the software package IsoDyn, allowing HepatoDyn to integrate data derived from 13C based experiments. As an example of dynamical simulations applied to hepatocytes, we studied the effects of high fructose concentrations on hepatocyte metabolism by integrating data from experiments in which rat hepatocytes were incubated with 20 mM glucose supplemented with either 3 mM or 20 mM fructose. These experiments showed that glycogen accumulation was significantly lower in hepatocytes incubated with medium supplemented with 20 mM fructose than in hepatocytes incubated with medium supplemented with 3 mM fructose. Through the integration of extracellular fluxes and 13C enrichment measurements, HepatoDyn predicted that this phenomenon can be attributed to a depletion of cytosolic ATP and phosphate induced by high fructose concentrations in the medium.

Linear network coding transmits data through networks by letting the intermediate nodes combine the messages they receive and forward the combinations toward their destinations. The solvability problem asks whether the demands of all the destinations can be simultaneously satisfied by using linear network coding. The guessing number approach converts this problem into determining the number of fixed points of coding functions f : An→ Anover a finite alphabet A (usually referred to as Boolean networks if A = {0, 1}) with a given interaction graph that describes which local functions depend on which variables. In this paper, we generalize the so-called reduction of coding functions in order to eliminate variables. We then determine the maximum number of fixed points of a fully reduced coding function, whose interaction graph has a loop on every vertex. Since the reduction preserves the number of fixed points, we then apply these ideas and results to obtain four main results on the linear network coding solvability problem. First, we prove that non-decreasing coding functions cannot solve any more instances than routing already does. Second, we show that the triangle-free undirected graphs are linearly solvable if and only if they are solvable by routing. This is the first classification result for the linear network coding solvability problem. Third, we exhibit a new class of non-linearly solvable graphs. Fourth, we determine large classes of strictly linearly solvable graphs.

BACKGROUND: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant and applicable to address questions raised by biologists about such networks. The behaviour of these systems being complex, it is essential to exploit efficiently every bit of experimental information. In our approach, both the evolution rules and the partial knowledge about the structure and the behaviour of the network are formalized using a common constraint-based language. RESULTS: In this article our formal and declarative approach is applied to three biological applications. The software environment that we developed allows to specifically address each application through a new class of biologically relevant queries. We show that we can describe easily and in a formal manner the partial knowledge about a genetic network. Moreover we show that this environment, based on a constraint algorithmic approach, offers a wide variety of functionalities, going beyond simple simulations, such as proof of consistency, model revision, prediction of properties, search for minimal models relatively to specified criteria. CONCLUSIONS: The formal approach proposed here deeply changes the way to proceed in the exploration of genetic and biochemical networks, first by avoiding the usual trial-and-error procedure, and second by placing the emphasis on sets of solutions, rather than a single solution arbitrarily chosen among many others. Last, the constraint approach promotes an integration of model and experimental data in a single framework.

We describe an application of controlled text authoring to biological experiment reports. This work is the result of a collaboration between a computational linguistics team and biologists specializing in protein production studies. We start by presenting our semantically-controlled authoring system, MDA (Multilingual Document Authoring), an expressive model for specifying well-formedness conditions both at the level of the document content and at the level of its textual realization. We then discuss the practical needs of experiment documentation in bioengineering. We go on to describe the prototype we have developed for this application domain, along with a preliminary evaluation. Finally we discuss a promising new idea emerging from the experimentation but which seems of wider applicability: how the authoring system represents a step towards integrating the formalization of an experimental protocol with its associated textual documentation.