Dace Ruklisa, (Dace.Ruklisa@mii.lu.lv)
Alvis Brazma (email@example.com)
Juris Viksna, (firstname.lastname@example.org)
Institute of Mathematics and Computer Science, University of Latvia, Rainis boulevard 29, Riga LV-1459, Latvia
European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, CB10 1SD, UK
supported by ESF (European Social Fund) project 2004/0001/VPD1/ESF/PIAA/04/NP/22.214.171.124./0001/0063 and Latvian Council of Science grant 05.1535
supported by EPSRC grant EP/C00373X/1 and Latvian Council of Science grant 05.1535
We study the Finite State Linear Model (FSLM) for modelling gene regulatory networks proposed by A. Brazma and T. Schlitt in . The model incorporates biologically intuitive gene regulatory mechanism similar to that in Boolean networks, and can describe also the continuous changes in protein levels. We consider several theoretical properties of this model; in particular we show that the problem whether a particular gene will reach an active state is algorithmically unsolvable. This imposes some practical difficulties in simulation and reverse engineering of FSLM networks. Nevertheless, our simulation experiments show that sufficiently many of FSLM networks exhibit a regular behaviour and that the model is still quite adequate to describe biological reality. We also propose a comparatively efficient O(2K nK+1 M2K m log m ) time algorithm for reconstruction of FSLM networks from experimental data. Experiments on reconstruction of random networks are performed to estimate the running time of the algorithm in practice, as well as the number of measurements needed for successful network reconstruction.