File Download
Supplementary
-
Citations:
- Appears in Collections:
Book Chapter: On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks
| Title | On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks |
|---|---|
| Authors | |
| Issue Date | 2008 |
| Publisher | World Publishing Corporation. |
| Citation | On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks. In Zhang, X, Chen, L, Wu, L et al. (eds.), Optimization and Systems Biology-The Second International Symposium, OSB'08, Lijiang, China, October 31-November 3, 2008, Proceedings, p. 91-100. World Publishing Corporation, 2008 How to Cite? |
| Abstract | In this paper, we study attractors in Probabilistic Boolean Networks (PBNs). We study
the expected number of singleton attractors in a PBN and show that it is 1.5
n
if the number of
Boolean functions assigned to each node is 2, where n is the number of nodes in a PBN. Then,
we present algorithms for identifying singleton and small attractors and perform both theoretical
and computational analyses on their average case time complexities. The results of computational
experiments suggest that these algorithms are much more efficient than the naive algorithm that
examines all possible 2
n
states. We also show a simple and interesting relation between the distribution
of attractors in a BN and the steady-state distribution in a corresponding variant of a PBN. |
| Persistent Identifier | http://hdl.handle.net/10722/64487 |
| ISBN |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hayashida, M | en_HK |
| dc.contributor.author | Tamura, T | en_HK |
| dc.contributor.author | Ching, WK | en_HK |
| dc.contributor.author | Akutsu, T | en_HK |
| dc.date.accessioned | 2010-07-13T04:51:53Z | - |
| dc.date.available | 2010-07-13T04:51:53Z | - |
| dc.date.issued | 2008 | en_HK |
| dc.identifier.citation | On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks. In Zhang, X, Chen, L, Wu, L et al. (eds.), Optimization and Systems Biology-The Second International Symposium, OSB'08, Lijiang, China, October 31-November 3, 2008, Proceedings, p. 91-100. World Publishing Corporation, 2008 | en_HK |
| dc.identifier.isbn | 978-7-5062-9289-4/O639 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/64487 | - |
| dc.description.abstract | In this paper, we study attractors in Probabilistic Boolean Networks (PBNs). We study the expected number of singleton attractors in a PBN and show that it is 1.5 n if the number of Boolean functions assigned to each node is 2, where n is the number of nodes in a PBN. Then, we present algorithms for identifying singleton and small attractors and perform both theoretical and computational analyses on their average case time complexities. The results of computational experiments suggest that these algorithms are much more efficient than the naive algorithm that examines all possible 2 n states. We also show a simple and interesting relation between the distribution of attractors in a BN and the steady-state distribution in a corresponding variant of a PBN. | - |
| dc.language | eng | en_HK |
| dc.publisher | World Publishing Corporation. | en_HK |
| dc.relation.ispartof | Optimization and Systems Biology-The Second International Symposium, OSB'08, Lijiang, China, October 31-November 3, 2008, Proceedings | - |
| dc.title | On Distribution and Enumeration of Attractors in Probabilistic Boolean Networks | en_HK |
| dc.type | Book_Chapter | en_HK |
| dc.identifier.email | Ching, WK: wching@HKUCC.hku.hk | en_HK |
| dc.identifier.authority | Ching, WK=rp00679 | en_HK |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.hkuros | 153461 | en_HK |