KOPS - The Institutional Repository of the University of Konstanz

Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set

Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

BEICA, Andreea, Calin C. GUET, Tatjana PETROV, 2016. Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set. 4th International Workshop on Hybrid Systems Biology : HSB 2015. Madrid, Spain, Sep 4, 2015 - Sep 5, 2015. In: ABATE, Alessandro, ed., David SAFRANEK, ed.. Hybrid Systems Biology : Fourth International Workshop. Cham:Springer, pp. 173-191. ISSN 0302-9743. eISSN 1611-3349. ISBN 978-3-319-26915-3. Available under: doi: 10.1007/978-3-319-26916-0_10

@inproceedings{Beica2016-01-10Effic-42138, title={Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set}, year={2016}, doi={10.1007/978-3-319-26916-0_10}, number={9271}, isbn={978-3-319-26915-3}, issn={0302-9743}, address={Cham}, publisher={Springer}, series={Lecture Notes in Bioinformatics}, booktitle={Hybrid Systems Biology : Fourth International Workshop}, pages={173--191}, editor={Abate, Alessandro and Safranek, David}, author={Beica, Andreea and Guet, Calin C. and Petrov, Tatjana} }

Petrov, Tatjana Efficient Reduction of Kappa Models by Static Inspection of the Rule-Set 2018-04-23T12:53:10Z Beica, Andreea Beica, Andreea Guet, Calin C. Guet, Calin C. 2016-01-10 eng 2018-04-23T12:53:10Z When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations.<br />Our algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude. Petrov, Tatjana

This item appears in the following Collection(s)

Search KOPS


My Account