Skip Navigation


Bioinformatics Advance Access originally published online on August 7, 2006
Bioinformatics 2006 22(20):2539-2546; doi:10.1093/bioinformatics/btl432
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Supplementary Data
Right arrow All Versions of this Article:
22/20/2539    most recent
btl432v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Stoll, G.
Right arrow Articles by Naef, F.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Stoll, G.
Right arrow Articles by Naef, F.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Few crucial links assure checkpoint efficiency in the yeast cell-cycle network

Gautier Stoll 1, Jacques Rougemont 3 and Félix Naef 1,2,3,*

1 Swiss Institute of Experimental Cancer Research, ISREC, NCCR Molecular Oncology CH-1066 Epalinges, Switzerland
2 Ecole Polytechnique Fédérale de Lausanne, EPFL, School of Life Sciences CH-1015 Lausanne, Switzerland
3 Swiss Institute of Bioinformatics, SIB CH-1015 Lausanne, Switzerland

*To whom correspondence should be addressed.

Motivation: The ability of cells to complete mitosis with high fidelity relies on elaborate checkpoint mechanisms. We study S- and M-phase checkpoint responses in silico in the budding yeast with a stochastic dynamical model for the cell-cycle. We aim to provide an unbiased functional classification of network interactions that reflect the contribution of each link to checkpoint efficiency in the presence of cellular fluctuations.

Results: We developed an algorithm BNetDyn to compute stochastic dynamical trajectories for an input gene network and its structural perturbations. User specified output measures like the mutual information between trigger and output nodes are then evaluated on the stationary state of the Markov process. Systematic perturbations of the yeast cell-cycle model by Li et al. classify each link according to its effect on checkpoint efficiencies and stabilities of the main cell-cycle phases. This points to the crosstalk in the cascades downstream of the SBF/MBF transcription activator complexes as determinant for checkpoint optimality; a finding that consistently reflects recent experiments. Finally our stochastic analysis emphasizes how dynamical stability in the yeast cell-cycle network crucially relies on backward inhibitory circuits next to forward induction.

Availability: C++ source code and network models can be downloaded at http://www.vital-it.ch/Software/

Contact: felix.naef{at}isrec.ch

Supplementary information: Supplementary data are available at Bioinformatics online.

Received on May 10, 2006; revised on July 27, 2006; accepted on August 3, 2006

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Brief BioinformHome page
A. Csikasz-Nagy
Computational systems biology of the cell cycle
Brief Bioinform, July 1, 2009; 10(4): 424 - 434.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.