A computational algebra approach to the reverse engineering of gene regulatory networks.

By Reinhard C. Laubenbacher, Brandilyn Stigler. Journal of Theoretical Biology, 2003

308 citations recorded by the source corpus.

This paper proposes a new method to reverse engineer gene regulatory networks from experimental data. The modeling framework used is time-discrete deterministic dynamical systems, with a finite set of states for each of the variables. The simplest examples of such models are Boolean networks, in which variables have only two possible states. The use of a larger number of possible states allows a finer discretization of experimental data and more than one possible mode of action for the variables, depending on threshold values. Furthermore, with a suitable choice of state set, one can employ powerful tools from computational algebra, that underlie the reverse-engineering algorithm, avoiding costly enumeration strategies. To perform well, the algorithm requires wildtype together with perturbation time courses. This makes it suitable for small to meso-scale networks rather than networks on a genome-wide scale. An analysis of the complexity of the algorithm is performed. The algorithm is validated on a recently published Boolean network model of segment polarity development in Drosophila melanogaster.

Subfields: Genetics, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/b39e1e20a15de3f4b1a3799e99247ad33fee3f2b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Genetics

  1. Stephen Kingsmore
  2. R. Toledo

In Molecular Biology

  1. Douglas A. Lauffenburger
  2. Peter K. Sorger
  3. J. Sáez-Rodríguez
  4. Stephen Kingsmore
  5. R. Toledo
  6. Steffen Klamt
  7. Ernst Dieter Gilles

Citations in the corpus