Abstract
This paper addresses the problem of providing mathematical conditions that allow one to ensure that biological networks, such as transcriptional systems, can be globally entrained to external periodic inputs. Despite appearing obvious at first, this is by no means a generic property of nonlinear dynamical systems. Through the use of contraction theory, a powerful tool from dynamical systems theory, it is shown that certain systems driven by external periodic signals have the property that all their solutions converge to a fixed limit cycle. General results are proved, and the properties are verified in the specific cases of models of transcriptional systems as well as constructs of interest in synthetic biology. A self-contained exposition of all needed results is given in the paper.
| Original language | American English |
|---|---|
| Journal | PLoS computational biology |
| Volume | 6 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 2010 |
ASJC Scopus subject areas
- Ecology, Evolution, Behavior and Systematics
- Modeling and Simulation
- Ecology
- Molecular Biology
- Genetics
- Cellular and Molecular Neuroscience
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Global entrainment of transcriptional systems to periodic inputs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver