IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-79409-7_17.html

Modelling Gene Regulatory Networks Using Galerkin Techniques Based on State Space Aggregation and Sparse Grids

In: Modeling, Simulation and Optimization of Complex Processes

Author

Listed:
  • Markus Hegland

    (ANU and ARC Centre in Bioinformatics, Mathematical Sciences Institute)

  • Conrad Burden

    (ANU, Mathematical Sciences Institute and John Curtin School of Medical Research)

  • Lucia Santoso

    (ANU and ARC Centre in Bioinformatics, Mathematical Sciences Institute)

Abstract

An important driver of the dynamics of gene regulatory networks is noise generated by transcription and translation processes involving genes and their products. As relatively small numbers of copies of each substrate are involved, such systems are best described by stochastic models. With these models, the stochastic master equations, one can follow the time development of the probability distributions for the states defined by the vectors of copy numbers of each substance. Challenges are posed by the large discrete state spaces, and are mainly due to high dimensionality. In order to address this challenge we propose effective approximation techniques, and, in particular, numerical techniques to solve the master equations. Two theoretical results show that the numerical methods are optimal. The techniques are combined with sparse grids to give an effective method to solve high-dimensional problems.

Suggested Citation

  • Markus Hegland & Conrad Burden & Lucia Santoso, 2008. "Modelling Gene Regulatory Networks Using Galerkin Techniques Based on State Space Aggregation and Sparse Grids," Springer Books, in: Hans Georg Bock & Ekaterina Kostina & Hoang Xuan Phu & Rolf Rannacher (ed.), Modeling, Simulation and Optimization of Complex Processes, pages 259-272, Springer.
  • Handle: RePEc:spr:sprchp:978-3-540-79409-7_17
    DOI: 10.1007/978-3-540-79409-7_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:sprchp:978-3-540-79409-7_17. 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.