Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Reports, Documentation, and Standards
  4. Canalizing structure of genetic network dynamics: modelling and identification via mixed-integer programming
 
research report

Canalizing structure of genetic network dynamics: modelling and identification via mixed-integer programming

Porreca, R.
•
Cinquemani, E.
•
Lygeros, J.
Show more
2009

We discuss the identification of genetic networks based on a class of boolean gene activation rules known as hierarchically canalizing functions. We introduce a class of kinetic models for the concentration of the proteins in the network built on a family of canalizing functions that has been shown to capture the vast majority of the known interaction networks. The simultaneous identification of the structure and of the parameters of the model from experimental data is ad dressed based on a mixed integer parametrization of the model class. The resulting regression problem is solved numerically via standard branch-and-bound techniques. The performance of the method is tested on simulated data generated by a simple model of Escherichia coli nutrient stress response.

  • Details
  • Metrics
Type
research report
Author(s)
Porreca, R.
Cinquemani, E.
Lygeros, J.
Ferrari-Trecate, G.
Date Issued

2009

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
SCI-STI-GFT  
Available on Infoscience
January 10, 2017
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/132607
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés