@article{JARRAH2007477,
    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 Macaulay 2, and are available from the authors.},
    Author = {Jarrah, Abdul Salam and Laubenbacher, Reinhard and Stigler, Brandilyn and Stillman, Michael},
    File = {Reverse-engineering of polynomial dynamical systems - 1-s2.0-S0196885806001205-main - a - o.pdf},
    ISSN = {0196-8858},
    Journal = {Advances in Applied Mathematics},
    Keywords = {Finite dynamical system, Finite field, Monomial ideal, Primary decomposition, Reverse-engineering, Gene regulatory network},
    Number = {4},
    Pages = {477 - 489},
    Title = {Reverse-engineering of polynomial dynamical systems},
    URL = {http://www.sciencedirect.com/science/article/pii/S0196885806001205},
    Volume = {39},
    Year = {2007},
    bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0196885806001205},
    bdsk-url-2 = {https://doi.org/10.1016/j.aam.2006.08.004},
    date-added = {2021-01-20 19:04:28 +0100},
    date-modified = {2021-01-20 19:04:28 +0100},
    doi = {10.1016/j.aam.2006.08.004}
}

@article{JARRAH2007477, 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 Macaulay 2, and are available from the authors.}, Author = {Jarrah, Abdul Salam and Laubenbacher, Reinhard and Stigler, Brandilyn and Stillman, Michael}, File = {Reverse-engineering of polynomial dynamical systems - 1-s2.0-S0196885806001205-main - a - o.pdf}, ISSN = {0196-8858}, Journal = {Advances in Applied Mathematics}, Keywords = {Finite dynamical system, Finite field, Monomial ideal, Primary decomposition, Reverse-engineering, Gene regulatory network}, Number = {4}, Pages = {477 - 489}, Title = {Reverse-engineering of polynomial dynamical systems}, URL = {http://www.sciencedirect.com/science/article/pii/S0196885806001205}, Volume = {39}, Year = {2007}, bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0196885806001205}, bdsk-url-2 = {https://doi.org/10.1016/j.aam.2006.08.004}, date-added = {2021-01-20 19:04:28 +0100}, date-modified = {2021-01-20 19:04:28 +0100}, doi = {10.1016/j.aam.2006.08.004} }