File Download
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: On Construction of Sparse Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix
Title | On Construction of Sparse Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix |
---|---|
Authors | |
Keywords | Probabilistic Boolean Networks Inverse Problem Transition Probability Matrix Sparse |
Issue Date | 2010 |
Publisher | World Publishing Corporation. The Journal's web site is located at http://www.aporc.org/LNOR/ |
Citation | 4th International Conference on Computational Systems Biology (ISB2010), Suzhou, China, 9-11 Sepetember 2010. In Lecture Notes in Operational Research, 2010, v. 13, p. 227-234 How to Cite? |
Abstract | Probabilistic Boolean Networks (PBNs) are useful models for modeling genetic regulatory networks. In this paper, we propose efficient algorithms for constructing a sparse probabilistic Boolean network when its transition probability matrix and a set of possible Boolean networks are given. This is an interesting inverse problem in network inference and it is important in the sense that most microarray data sets are assumed to be obtained from sampling the steady-state. |
Persistent Identifier | http://hdl.handle.net/10722/128315 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cui, LB | en_HK |
dc.contributor.author | Li, W | en_HK |
dc.contributor.author | Ching, WK | en_HK |
dc.date.accessioned | 2010-10-31T14:18:34Z | - |
dc.date.available | 2010-10-31T14:18:34Z | - |
dc.date.issued | 2010 | en_HK |
dc.identifier.citation | 4th International Conference on Computational Systems Biology (ISB2010), Suzhou, China, 9-11 Sepetember 2010. In Lecture Notes in Operational Research, 2010, v. 13, p. 227-234 | - |
dc.identifier.isbn | 9787510024078 | - |
dc.identifier.uri | http://hdl.handle.net/10722/128315 | - |
dc.description.abstract | Probabilistic Boolean Networks (PBNs) are useful models for modeling genetic regulatory networks. In this paper, we propose efficient algorithms for constructing a sparse probabilistic Boolean network when its transition probability matrix and a set of possible Boolean networks are given. This is an interesting inverse problem in network inference and it is important in the sense that most microarray data sets are assumed to be obtained from sampling the steady-state. | - |
dc.language | eng | en_HK |
dc.publisher | World Publishing Corporation. The Journal's web site is located at http://www.aporc.org/LNOR/ | - |
dc.relation.ispartof | Lecture Notes in Operational Research | - |
dc.subject | Probabilistic Boolean Networks | - |
dc.subject | Inverse Problem | - |
dc.subject | Transition Probability Matrix | - |
dc.subject | Sparse | - |
dc.title | On Construction of Sparse Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=9787510024078&volume=13&spage=227&epage=234&date=2010&atitle=On+Construction+of+Sparse+Probabilistic+Boolean+Networks+from+a+Prescribed+Transition+Probability+Matrix | - |
dc.identifier.email | Ching, WK: wching@HKUCC.hku.hk | en_HK |
dc.identifier.authority | Ching, WK=rp00679 | en_HK |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.hkuros | 179079 | en_HK |
dc.identifier.volume | 13 | en_HK |
dc.identifier.spage | 227 | - |
dc.identifier.epage | 234 | - |