We propose a new method to explore the characteristics of genetic networks whose dynamics are described by a linear discrete dynamical model x t+1 = Axt . The gene expression data xt is given for various time points and the matrix A of interactions among the genes is unknown. First we formulate and solve a parameter estimation problem by linear programming in order to obtain the entries of the matrix A. We then use ideas from Vester's Sensitivity Model, more precisely, the Impact Matrix, and the determination of the Systemic Roles, to understand the interactions among the genes and their role in the system. The method identifies prominent outliers, that is, the most active, reactive, buffering and critical genes in the network. Numerical examples for different datasets containing mRNA transcript levels during the cell cycle of budding yeast are presented. © 2014 Springer International Publishing.
CITATION STYLE
Amaya Moreno, L., Defterli, O., Fügenschuh, A., & Weber, G. W. (2014). Algorithms for Computational Biology. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8542, pp. 35–46). Retrieved from http://www.scopus.com/inward/record.url?eid=2-s2.0-84904016057&partnerID=tZOtx3y1
Mendeley helps you to discover research relevant for your work.