On Algorithmic Analysis of Transcriptional Regulation by LTL Model Checking

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BARNAT Jiří BRIM Luboš ČERNÁ Ivana DRAŽAN Sven FABRIKOVÁ Jana ŠAFRÁNEK David

Year of publication 2009
Type Article in Periodical
Magazine / Source Theoretical Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Web http://dx.doi.org/10.1016/j.tcs.2009.02.017
Field Informatics
Keywords Genetic regulatory network; Piecewise-linear approximation; Model checking
Description This paper is focused on the model checking approach for analysis of piecewise-linear deterministic models of genetic regulatory networks. Firstly, the qualitative simulation algorithm of de Jong et.al. that builds the heart of Genetic Network Analyzer (GNA) is revisited and its time complexity is studied in detail. Secondly, a novel algorithm that reduces the state space generation time is introduced. The new algorithm is developed as an abstraction of the original GNA algorithm. Finally, a fragment of linear time temporal logic for which the provided abstraction is conservative is identified. Efficiency of the new algorithm when implemented in the parallel model checking environment is demonstrated on a set of experiments performed on randomly modified biological models. In general, the achieved results bring a new insight into the field of qualitative simulation emerging in the context of systems biology.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info