Reverse-engineering of polynomial dynamical systems

Abstract

Multivariate polynomial dynamical systems over finite fields have been studied in several contexts, including engineering and mathematical biology. An important problem is to construct models of such systems from a partial specification of dynamic properties, e.g., from a collection of state transition measurements. Here, we consider static models, which are directed graphs that represent the causal relationships between system variables, so-called wiring diagrams. This paper contains an algorithm which computes all possible minimal wiring diagrams for a given set of state transition measurements. The paper also contains several statistical measures for model selection. The algorithm uses primary decomposition of monomial ideals as the principal tool. An application to the reverse-engineering of a gene regulatory network is included. The algorithm and the statistical measures are implemented in Macaulay2 and are available from the authors.

References in corpus (2)

• A Computational Algebra Approach to the Reverse Engineering of Gene Regulatory Networks
• Discretization of Time Series Data

Cited by in corpus (19)

• Identification of control targets in Boolean molecular network models via computational algebra
• ADAM: Analysis of Discrete Models of Biological Systems Using Computer Algebra
• Parameter estimation for Boolean models of biological networks
• The Slice Algorithm For Irreducible Decomposition of Monomial Ideals
• Solving Thousand Digit Frobenius Problems Using Grobner Bases
• The Dynamics of Conjunctive and Disjunctive Boolean Networks
• Quantifier Elimination over Finite Fields Using Gröbner Bases
• Inferring Biologically Relevant Models: Nested Canalyzing Functions
• Geometric characterization of data sets with unique reduced Gröbner bases
• Computing Irreducible Decomposition of Monomial Ideals
• The neural ring: using algebraic geometry to analyze neural codes
• Reduction of Boolean Networks
• Dynamics of Boolean Networks
• The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
• On the dynamics of endomorphisms of finite groups
• On finite groups where the order of every automorphism is a cycle length
• Inference of ecological interaction networks
• Algebraic Experimental Design: Theory and Computation
• Computing linear extensions for polynomial posets subject to algebraic constraints