SBGN support in BIOCHAM

BIOCHAM - BioChemical Abstract Machine is an environment for modeling biological systems and formalizing experimental knowledge. Mainly, it is composed of:
* a rule-based language for modeling biochemical systems (compatible with SBML)
* several simulators (boolean, differential, stochastic)
* a temporal logic based language to formalize the temporal properties of a biological system and validate models with respect to such specifications,
* unique features for developing/correcting/completing/reducing/coupling models, including the inference of kinetic parameters in high dimension from temporal logic constraints.

BIOCHAM is presented with a user friendly graphical interface, that is easy to use and gives the user richer experience throughout his work. The current release of its graphical user interface has a SBGN compliant Reaction Graph Editor for drawing and editing biochemical networks. It also offers export features to SBML and other formats.

It is implemented by the CONTRAINTES team in INRIA ( National Institute for Research in Computer Science and Control), in Paris - Rocquencourt, France.
&#xa

A Machine Learning approach to Biochemical Reaction Rules Discovery

Beyond numerical simulation, the possibility of performing symbolic computation on bio-molecular interaction networks opens the way to the design of new automated reasoning tools for biologists/modelers. The Biochemical Abstract machine BIOCHAM provides a precise semantics to biomolecular interaction maps as concurrent transition systems. Based on this formal semantics, BIOCHAM offers a compositional rule-based language for modeling biochemical systems, and an original query language based on temporal logic for expressing biological queries about reachability, checkpoints, oscillations or stability. Turning the temporal logic query language into a specification language for expressing the observed behavior of the system (in wild-life and mutated organisms) makes it possible to use machine learning techniques for completing or correcting biological models semi-automatically. Machine learning from temporal logic formulae is quite new however, both from the machine learning perspective and from the Systems Biology perspective. In this paper, we report on the machine learning system of BIOCHAM which allows to discover, on the one hand, interaction rules from a partial model with constraints on the system behavior expressed in temporal logic, and on the other hand, kinetic parameter values from a temporal logic specification with constraints on numerical concentrations

Machine Learning Bio-molecular Interactions from Temporal Logic Properties

With the advent of formal languages for modeling bio-molecu\-lar interaction systems, the design of automated reasoning tools to assist the biologist becomes possible. The biochemical abstract machine BIOCHAM software environment offers a rule-based language to model bio-molecular interactions and an original temporal logic based language to formalize the biological properties of the system. Building on these two formal languages, machine learning techniques can be used to infer new molecular interaction rules from temporal properties. In this context, the aim is to semi-automatically correct or complete models from observed biological properties of the system. Machine learning from temporal logic formulae is quite new however, both from the machine learning perspective and from the Systems Biology perspective. In this paper we present an ad-hoc enumerative method for structural learning from temporal properties and report on the evaluation of this method on formal biological models of the literature

BIOCHAM: an environment for modeling biological systems and formalizing experimental knowledge

International audienceBIOCHAM (the BIOCHemical Abstract Machine) is a software environment for modeling biochemical systems. It is based on two aspects: (1) the analysis and simulation of boolean, kinetic and stoch-astic models and (2) the formalization of biological properties in temporal logic. BIOCHAM provides tools and languages for describing protein networks with a simple and straightforward syntax, and for integrating biological properties into the model. It then becomes possible to analyze, query, verify and maintain the model with respect to those properties. For kinetic models, BIOCHAM can search for appropriate parameter values in order to reproduce a specific behavior observed in experiments and formalized in temporal logic. Coupled with other methods such as bifurcation diagrams, this search assists the modeler/biologist in the modeling process

Conceptual graph-based knowledge representation for supporting reasoning in African traditional medicine

Although African patients use both conventional or modern and traditional healthcare simultaneously, it has been proven that 80% of people rely on African traditional medicine (ATM). ATM includes medical activities stemming from practices, customs and traditions which were integral to the distinctive African cultures. It is based mainly on the oral transfer of knowledge, with the risk of losing critical knowledge. Moreover, practices differ according to the regions and the availability of medicinal plants. Therefore, it is necessary to compile tacit, disseminated and complex knowledge from various Tradi-Practitioners (TP) in order to determine interesting patterns for treating a given disease. Knowledge engineering methods for traditional medicine are useful to model suitably complex information needs, formalize knowledge of domain experts and highlight the effective practices for their integration to conventional medicine. The work described in this paper presents an approach which addresses two issues. First it aims at proposing a formal representation model of ATM knowledge and practices to facilitate their sharing and reusing. Then, it aims at providing a visual reasoning mechanism for selecting best available procedures and medicinal plants to treat diseases. The approach is based on the use of the Delphi method for capturing knowledge from various experts which necessitate reaching a consensus. Conceptual graph formalism is used to model ATM knowledge with visual reasoning capabilities and processes. The nested conceptual graphs are used to visually express the semantic meaning of Computational Tree Logic (CTL) constructs that are useful for formal specification of temporal properties of ATM domain knowledge. Our approach presents the advantage of mitigating knowledge loss with conceptual development assistance to improve the quality of ATM care (medical diagnosis and therapeutics), but also patient safety (drug monitoring)

Analysis of signalling pathways using the prism model checker

We describe a new modelling and analysis approach for signal transduction networks in the presence of incomplete data. We illustrate the approach with an example, the RKIP inhibited ERK pathway [1]. Our models are based on high level descriptions of continuous time Markov chains: reactions are modelled as synchronous processes and concentrations are modelled by discrete, abstract quantities. The main advantage of our approach is that using a (continuous time) stochastic logic and the PRISM model checker, we can perform quantitative analysis of queries such as if a concentration reaches a certain level, will it remain at that level thereafter? We also perform standard simulations and compare our results with a traditional ordinary differential equation model. An interesting result is that for the example pathway, only a small number of discrete data values is required to render the simulations practically indistinguishable

Efficient parameter search for qualitative models of regulatory networks using symbolic model checking

Investigating the relation between the structure and behavior of complex biological networks often involves posing the following two questions: Is a hypothesized structure of a regulatory network consistent with the observed behavior? And can a proposed structure generate a desired behavior? Answering these questions presupposes that we are able to test the compatibility of network structure and behavior. We cast these questions into a parameter search problem for qualitative models of regulatory networks, in particular piecewise-affine differential equation models. We develop a method based on symbolic model checking that avoids enumerating all possible parametrizations, and show that this method performs well on real biological problems, using the IRMA synthetic network and benchmark experimental data sets. We test the consistency between the IRMA network structure and the time-series data, and search for parameter modifications that would improve the robustness of the external control of the system behavior