An algorithm for finding the singleton attractors and pre-images in strong-inhibition boolean networks

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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 thestrong-inhibition Boolean networks.

Cite

CITATION STYLE

APA

He, Z., Zhan, M., Liu, S., Fang, Z., & Yao, C. (2016). An algorithm for finding the singleton attractors and pre-images in strong-inhibition boolean networks. PLoS ONE, 11(11). https://doi.org/10.1371/journal.pone.0166906

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free