IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v86y2013i6p1-510.1140-epjb-e2013-30746-7.html
   My bibliography  Save this article

Optimal finite horizon control in gene regulatory networks

Author

Listed:
  • Qiuli Liu

Abstract

As a paradigm for modeling gene regulatory networks, probabilistic Boolean networks (PBNs) form a subclass of Markov genetic regulatory networks. To date, many different stochastic optimal control approaches have been developed to find therapeutic intervention strategies for PBNs. A PBN is essentially a collection of constituent Boolean networks via a probability structure. Most of the existing works assume that the probability structure for Boolean networks selection is known. Such an assumption cannot be satisfied in practice since the presence of noise prevents the probability structure from being accurately determined. In this paper, we treat a case in which we lack the governing probability structure for Boolean network selection. Specifically, in the framework of PBNs, the theory of finite horizon Markov decision process is employed to find optimal constituent Boolean networks with respect to the defined objective functions. In order to illustrate the validity of our proposed approach, an example is also displayed. Copyright EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg 2013

Suggested Citation

  • Qiuli Liu, 2013. "Optimal finite horizon control in gene regulatory networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 86(6), pages 1-5, June.
  • Handle: RePEc:spr:eurphb:v:86:y:2013:i:6:p:1-5:10.1140/epjb/e2013-30746-7
    DOI: 10.1140/epjb/e2013-30746-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2013-30746-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1140/epjb/e2013-30746-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Qiuli & He, Yu & Wang, Junwei, 2018. "Optimal control for probabilistic Boolean networks using discrete-time Markov decision processes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 503(C), pages 1297-1307.

    More about this item

    Keywords

    Statistical and Nonlinear Physics;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:eurphb:v:86:y:2013:i:6:p:1-5:10.1140/epjb/e2013-30746-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.