Reverse-engineering of polynomial dynamical systems
From MaRDI portal
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.
Recommendations
- Reversibility in polynomial systems of ODE's
- scientific article; zbMATH DE number 3991354
- Some aspects of polynomial dynamic systems
- Parameter synthesis of polynomial dynamical systems
- Automated reverse engineering of nonlinear dynamical systems
- Polynomial Equations over Finite, Discrete-Time Dynamical Systems
- Polynomial functional dynamical systems
- Polynomial dynamical systems and the Korteweg-de Vries equation
- scientific article; zbMATH DE number 5035727
- Discovering polynomial Lyapunov functions for continuous dynamical systems
Cites work
- A computational algebra approach to the reverse engineering of gene regulatory networks
- Algebraic dependency models of protein signal transduction networks from time-series data
- Assessing cellular automata based models using partial differential equations
- Computing irredundant irreducible decompositions of large scale monomial ideals
- scientific article; zbMATH DE number 1693050 (Why is no real title available?)
- scientific article; zbMATH DE number 493127 (Why is no real title available?)
- scientific article; zbMATH DE number 1163422 (Why is no real title available?)
- Linear analysis of switching nets
- Logical identification of all steady states: The concept of feedback loop characteristic states
- The topology of the regulatory interactions predicts the expression pattern of the segment polarity genes in \textit{Drosophila melanogaster}
Cited in
(27)- Reduction of Boolean network models
- Geometric characterization of data sets with unique reduced Gröbner bases
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- Neural codes and the factor complex
- Reversibility in polynomial systems of ODE's
- On the dynamics of endomorphisms of finite groups
- Forecasting polynomial dynamics
- Probability estimates for reachability of linear systems defined over finite fields
- Vector space bases associated to vanishing ideals of points
- The minimal hitting set generation problem: algorithms and computation
- Quantifier elimination over finite fields using Gröbner bases
- Noise-tolerant algebraic method for reconstruction of nonlinear dynamical systems
- Inferring biologically relevant models: nested canalyzing functions
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- Polynomial dynamical systems in systems biology
- Data identification for improving gene network inference using computational algebra
- Algebraic Models and Their Use in Systems Biology
- Computing linear extensions for polynomial posets subject to algebraic constraints
- An algebraic approach to reverse engineering finite dynamical systems arising from biology
- scientific article; zbMATH DE number 5035727 (Why is no real title available?)
- Parameter estimation for Boolean models of biological networks
- Analytical approach for simplifying dynamical systems of polynomial type.
- Identification and stabilization of faulty Boolean control networks
- Primary decomposition of squarefree pseudomonomial ideals
- Polynomial Equations over Finite, Discrete-Time Dynamical Systems
- A Unified Approach to Reverse Engineering and Data Selection for Unique Network Identification
- Algebraic network reconstruction of discrete dynamical systems
This page was built for publication: Reverse-engineering of polynomial dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467344)
