IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0166906.html
   My bibliography  Save this article

An Algorithm for Finding the Singleton Attractors and Pre-Images in Strong-Inhibition Boolean Networks

Author

Listed:
  • Zhiwei He
  • Meng Zhan
  • Shuai Liu
  • Zebo Fang
  • Chenggui Yao

Abstract

The detection of the singleton attractors is of great significance for the systematic study of genetic regulatory network. In this paper, we design an algorithm to compute the singleton attractors and pre-images of the strong-inhibition Boolean networks which is a biophysically plausible gene model. Our algorithm can not only identify accurately the singleton attractors, but also find easily the pre-images of the network. Based on extensive computational experiments, we show that the computational time of the algorithm is proportional to the number of the singleton attractors, which indicates the algorithm has much advantage in finding the singleton attractors for the networks with high average degree and less inhibitory interactions. Our algorithm may shed light on understanding the function and structure of the strong-inhibition Boolean networks.

Suggested Citation

  • Zhiwei He & Meng Zhan & Shuai Liu & Zebo Fang & Chenggui Yao, 2016. "An Algorithm for Finding the Singleton Attractors and Pre-Images in Strong-Inhibition Boolean Networks," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-18, November.
    • Handle: RePEc:plo:pone00:0166906
    DOI: 10.1371/journal.pone.0166906
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0166906
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0166906&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0166906?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:0166906. 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.