H2020Индивидуална стипендия2017–2019

RaSiR · Rule-algebraic Simple Rewriting

„Хоризонт 2020“ — Действия „Мария Склодовска-Кюри“

Период
2017-10-01 → 2019-09-30
Финансиране от ЕС
173 076 €
Участници
1
Схема
MSCA-IF-EF-ST

Линиите свързват координатора с партньорите.

Накратко на български

Математическата теория за пренаписване на правила се използва за моделиране на сложни биохимични реакции, при които молекулите се разглеждат като обекти. Това помага за по-доброто разбиране на динамиката и взаимодействията в биологичните системи, вместо само на отделните процеси.

Този кратък обзор е генериран от изкуствен интелект

Кратко обяснение, генерирано от езиков модел по текста на CORDIS. Оригиналът е по-долу.

Резултати накратко

Rule-algebraic Simple Rewriting

One of the most successful modern approaches to the study of complex biochemical reaction systems is the so-called rule-based modeling approach (via the Kappa or BioNetGen frameworks). These approaches intrinsically rely upon a sophisticated concept from theoretical computer science known as rewriting theory. The abstraction of molecules to so-called agents and of reactions to so-called rewriting rules not only permits to efficiently encode empirical information on biochemical reaction systems, but in particular permits to implement high-performance simulation algorithms as a source of “in silico” empirical data. The central aim of the RaSiR project has been to improve upon the existing theory of rewriting systems in order to permit the development of fundamentally new approaches to algorithm design in bioinformatics. Crucially, the simulations provided by the existing rule-based modeling platforms alone are not providing sufficient information in order to understand dynamical and functional behaviors of biological systems, since the core sources of these behaviors are given by pathways and their interactions rather than individual realizations of the systems. Despite the long history of rewriting theory with over 40 years of developments, we identified certain key aspects of the theory that had previously not been considered or understood. In particular, through a close analogy to the theory of combinatorics, re-focusing the analysis of rule-based systems upon sequential compositions of rules (rather than on sequential rewriting steps) revealed a fruitful new type of mathematical structure: sequential compositions of rules have a certain associativity property, which permits to encode the non-determinism in rule compositions within a mathematical structure of so-called rule algebras. At a fundamental level, we addressed the question of how to extrapolate from customized formulations of rewriting theories to a universal framework, accessible also to practitioners outside the bioinformatics communities. Developing this general framework permitted us to discover interesting novel application areas of rewriting theories including the stochastic dynamics of social networks, random graph models and pattern counting problems in combinatorics. Our work was motivated by the possibility of achieving a deeper understanding of the origin of functional behavior of biological systems and of their pathway dynamics, with potential applications including the discovery of potential drug targets, as well as the discovery of a variant of statistical mechanics tailor-made for the study of stochastic network models and random graphs.

Текст от CORDIS, на английски · Данни: CORDIS, © Европейски съюз

Цел на проекта

The basis for this project consists in a mathematical framework previously developed by the applicant that allows to describe graph rewriting systems algebraically, the so-called rule algebraic framework. In order to advance and valorise the concept, this project proposes to develop a general concept for rule-algebraic simple rewriting (RaSiR), both for conventional graph rewriting and for a novel form of simplicial rewriting. Secondly, RaSiR will serve as the basis for developing rule-algebraic variants of trace compression and observable-update algorithms for the rewriting system Kappa. The final aim of the project consists in developing and implementing the so-called observable-centric bootstrapping algorithm (OCBA) as a module for the simulation suite KaSim for the Kappa language. Kappa is predominantly used for simulating biochemical reaction systems, which typically display an extremely high combinatorial complexity. The algorithms and software modules developed in this project will provide in particular an alternative to pure stochastic simulation via the SSA algorithm as currently implemented in KaSim, in the form of the OCBA module. This module will admit the generation of approximate observable distributions from individual pure states of the system by calculating algebraically truncations of the formal solution of the chemical master equation as well as the induced observable update functions. The project shall be hosted by Dr. Jean Krivine of the PPS team at IRIF at the University Paris-Diderot in France. Dr. Krivine is one of the two main developers of the KaSim simulation suite, and moreover one of the world experts in the theoretical and practical development of the programming language Kappa. IRIF will provide an ideal environment for the applicant to develop new skills, to be part the very interdisciplinary research team PPS, and to communicate and valorise the project results to the greater biochemical and systems biological simulation community.

Оригинален текст от CORDIS (на английски).

Участници

Връзки

Данни: CORDIS, © Европейски съюз