IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0355545.html

Bayesian model discovery for reverse-engineering biochemical networks from data

Author

Listed:
  • Andreas Christ Sølvsten Jørgensen
  • Marc Sturrock
  • Atiyo Ghosh
  • Vahid Shahrezaei

Abstract

Reverse engineering gene regulatory networks from gene expression data is a challenging inference task. A related problem in computational systems biology is identification of signalling networks that perform particular functions, such as adaptation. Indeed, for many research questions, there is an ongoing need for efficient inference algorithms that can identify the simplest model, from among a larger set of inter-related models, that best explains empirical observations. To this end, we introduce Sparse Likelihood-free Inference using Gibbs sampling (SLInG), a Bayesian sparse likelihood-free inference method. SLInG provides an efficient sampling method for Approximate Bayesian Computation with sparsity-inducing hierarchical priors that is widely applicable for any simulation-based model discovery task. We first apply SLInG to linear sparse regression problem using a classic dataset, before focusing on applications to biochemical network model discovery. We demonstrate that SLInG can reverse engineer stochastic gene regulatory networks from single-cell data with high accuracy, outperforming state-of-the-art correlation-based methods. Furthermore, we show that SLInG can successfully identify signalling networks that execute adaptation. Sparse hierarchical Bayesian inference thus provides a versatile and powerful tool for model discovery in systems biology and beyond.

Suggested Citation

  • Andreas Christ Sølvsten Jørgensen & Marc Sturrock & Atiyo Ghosh & Vahid Shahrezaei, 2026. "Bayesian model discovery for reverse-engineering biochemical networks from data," PLOS ONE, Public Library of Science, vol. 21(8), pages 1-23, August.
  • Handle: RePEc:plo:pone00:0355545
    DOI: 10.1371/journal.pone.0355545
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0355545
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0355545&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0355545?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
    ---><---

    More about this item

    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:plo:pone00:0355545. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.