Parameter identification and model ranking of Thomas networks

21Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a new methodology for identification and analysis of discrete gene networks as defined by René Thomas, supported by a tool chain: (i) given a Thomas network with partially known kinetic parameters, we reduce the number of acceptable parametrizations to those that fit time-series measurements and reflect other known constraints by an improved technique of coloured LTL model checking performing efficiently on Thomas networks in distributed environment; (ii) we introduce classification of acceptable parametrizations to identify most optimal ones; (iii) we propose two ways of visualising parametrizations dynamics wrt time-series data. Finally, computational efficiency is evaluated and the methodology is validated on bacteriophage λ case study. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Klarner, H., Streck, A., Šafránek, D., Kolčák, J., & Siebert, H. (2012). Parameter identification and model ranking of Thomas networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7605 LNBI, pp. 207–226). https://doi.org/10.1007/978-3-642-33636-2_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free