Skip Navigation


Bioinformatics Advance Access originally published online on January 29, 2004
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow All Versions of this Article:
20/6/924    most recent
bth008v1
Right arrow Alert me when this article is cited
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 (15)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Datta, A.
Right arrow Articles by Dougherty, E. R.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Datta, A.
Right arrow Articles by Dougherty, E. R.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics 20(6) © Oxford University Press 2004; all rights reserved.

External control in Markovian genetic regulatory networks: the imperfect information case

Aniruddha Datta 1, Ashish Choudhary 1, Michael L. Bittner 2 and Edward R. Dougherty 1,3,*

1 Department of Electrical Engineering, Texas A & M University, College Station, TX 77843-3128, USA, 2 TGEN, 400 North Fifth Street, Suite 1600, Phoenix, AZ 85004, USA and 3 Department of Pathology, University of Texas M. D. Anderson Cancer Center, 1515 Holcombe Blvd, Houston, TX 77030, USA

Received on September 11, 2003 ; accepted on October 31, 2003
Advance Access Publication January 29, 2004

Probabilistic Boolean Networks, which form a subclass of Markovian Genetic Regulatory Networks, have been recently introduced as a rule-based paradigm for modeling gene regulatory networks. In an earlier paper, we introduced external control into Markovian Genetic Regulatory networks. More precisely, given a Markovian genetic regulatory network whose state transition probabilities depend on an external (control) variable, a Dynamic Programming-based procedure was developed by which one could choose the sequence of control actions that minimized a given performance index over a finite number of steps. The control algorithm of that paper, however, could be implemented only when one had perfect knowledge of the states of the Markov Chain. This paper presents a control strategy that can be implemented in the imperfect information case, and makes use of the available measurements which are assumed to be probabilistically related to the states of the underlying Markov Chain.

Contact: edward{at}ee.tamu.edu

* To whom correspondence should be addressed.


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
 BioinformaticsHome page
W.-K. Ching, S. Zhang, M. K. Ng, and T. Akutsu
An approximation method for solving the steady-state probability distribution of probabilistic Boolean networks
Bioinformatics, June 15, 2007; 23(12): 1511 - 1518.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
A. Choudhary, A. Datta, M. L. Bittner, and E. R. Dougherty
Intervention in a family of Boolean networks
Bioinformatics, January 15, 2006; 22(2): 226 - 232.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
R. Pal, A. Datta, M. L. Bittner, and E. R. Dougherty
Intervention in context-sensitive probabilistic Boolean networks
Bioinformatics, April 1, 2005; 21(7): 1211 - 1218.
[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.