Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T20:47:52.719Z Has data issue: false hasContentIssue false

Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach

Published online by Cambridge University Press:  28 May 2015

Xi Chen*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Wai-Ki Ching*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Xiao-Shan Chen*
Affiliation:
School of Mathematical Sciences, South China Normal University, Guangzhou, China
Yang Cong*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
Nam-Kiu Tsing*
Affiliation:
Advanced Modeling and Applied Computing Laboratory, Department of Mathematics, The University of Hong Kong, Pokfulam Road, Hong Kong
*
Corresponding author. Email: dlkcissy@hotmail.com
Corresponding author. Email: wching@hkusua.hku.hk
Corresponding author. Email: cxs333@21cn.com
Corresponding author. Email: congyang0305@yahoo.com.cn
Corresponding author. Email: nktsing@hku.hk
Get access

Abstract

Modeling genetic regulatory networks is an important problem in genomic research. Boolean Networks (BNs) and their extensions Probabilistic Boolean Networks (PBNs) have been proposed for modeling genetic regulatory interactions. In a PBN, its steady-state distribution gives very important information about the long-run behavior of the whole network. However, one is also interested in system synthesis which requires the construction of networks. The inverse problem is ill-posed and challenging, as there may be many networks or no network having the given properties, and the size of the problem is huge. The construction of PBNs from a given transition-probability matrix and a given set of BNs is an inverse problem of huge size. We propose a maximum entropy approach for the above problem. Newton's method in conjunction with the Conjugate Gradient (CG) method is then applied to solving the inverse problem. We investigate the convergence rate of the proposed method. Numerical examples are also given to demonstrate the effectiveness of our proposed method.

Information

Type
Research Article
Copyright
Copyright © Global-Science Press 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable