File Download
 
 
Supplementary

Postgraduate Thesis: On construction and control of probabilistic Boolean networks
  • Basic View
  • Metadata View
  • XML View
TitleOn construction and control of probabilistic Boolean networks
 
AuthorsChen, Xi
陈曦
 
Issue Date2012
 
PublisherThe University of Hong Kong (Pokfulam, Hong Kong)
 
AbstractModeling gene regulation is an important problem in genomic research. The Boolean network (BN) and its generalization Probabilistic Boolean network (PBN) have been proposed to model genetic regulatory interactions. BN is a deterministic model while PBN is a stochastic model. In a PBN, on one hand, its stationary distribution gives important information about the long-run behavior of the network. On the other hand, one may be interested in system synthesis which requires the construction of networks from the observed stationary distribution. This results in an inverse problem of constructing PBNs from a given stationary distribution and a given set of Boolean Networks (BNs), which is ill-posed and challenging, because there may be many networks or no network having the given properties and the size of the inverse problem is huge. The inverse problem is first formulated as a constrained least squares problem. A heuristic method is then proposed based on the conjugate gradient (CG) algorithm, an iterative method, to solve the resulting least squares problem. An estimation method for the parameters of the PBNs is also discussed. Numerical examples are then given to demonstrate the effectiveness of the proposed methods. However, the PBNs generated by the above algorithm depends on the initial guess and is not unique. A heuristic method is then proposed for generating PBNs from a given transition probability matrix. Unique solution can be obtained in this case. Moreover, these algorithms are able to recover the dominated BNs and therefore the major structure of the network. To further evaluate the feasible solutions, a maximum entropy approach is proposed using entropy as a measure of the fitness. Newton’s method in conjunction with the CG method is then applied to solving the inverse problem. The convergence rate of the proposed method is demonstrated. Numerical examples are also given to demonstrate the effectiveness of our proposed method. Another important problem is to find the optimal control policy for a PBN so as to avoid the network from entering into undesirable states. By applying external control, the network is desired to enter into some state within a few time steps. For PBN CONTROL, people propose to find a control sequence such that the network will terminate in the desired state with a maximum probability. Also, the problem of minimizing the maximum cost is considered. Integer linear programming (ILP) and dynamic programming (DP) in conjunction with hard constraints are then employed to solve the above problems. Numerical experiments are given to demonstrate the effectiveness of our algorithms. A hardness result is demonstrated and suggests that PBN CONTROL is harder than BN CONTROL. In addition, deciding the steady state probability in PBN for a specified global state is demonstrated to be NP-hard. However, due to the high computational complexity of PBNs, DP method is computationally inefficient for a large size network. Inspired by the state reduction strategies studied in [86], the DP method in conjunction with state reduction approach is then proposed to reduce the computational cost of the DP method. Numerical examples are given to demonstrate both the effectiveness and the efficiency of our proposed method.
 
AdvisorsChing, WK
Tsing, NK
 
DegreeDoctor of Philosophy
 
SubjectGenetic regulation - Mathematical models.
Algebra, Boolean.
Control theory.
 
Dept/ProgramMathematics
 
DC FieldValue
dc.contributor.advisorChing, WK
 
dc.contributor.advisorTsing, NK
 
dc.contributor.authorChen, Xi
 
dc.contributor.author陈曦
 
dc.date.hkucongregation2012
 
dc.date.issued2012
 
dc.description.abstractModeling gene regulation is an important problem in genomic research. The Boolean network (BN) and its generalization Probabilistic Boolean network (PBN) have been proposed to model genetic regulatory interactions. BN is a deterministic model while PBN is a stochastic model. In a PBN, on one hand, its stationary distribution gives important information about the long-run behavior of the network. On the other hand, one may be interested in system synthesis which requires the construction of networks from the observed stationary distribution. This results in an inverse problem of constructing PBNs from a given stationary distribution and a given set of Boolean Networks (BNs), which is ill-posed and challenging, because there may be many networks or no network having the given properties and the size of the inverse problem is huge. The inverse problem is first formulated as a constrained least squares problem. A heuristic method is then proposed based on the conjugate gradient (CG) algorithm, an iterative method, to solve the resulting least squares problem. An estimation method for the parameters of the PBNs is also discussed. Numerical examples are then given to demonstrate the effectiveness of the proposed methods. However, the PBNs generated by the above algorithm depends on the initial guess and is not unique. A heuristic method is then proposed for generating PBNs from a given transition probability matrix. Unique solution can be obtained in this case. Moreover, these algorithms are able to recover the dominated BNs and therefore the major structure of the network. To further evaluate the feasible solutions, a maximum entropy approach is proposed using entropy as a measure of the fitness. Newton’s method in conjunction with the CG method is then applied to solving the inverse problem. The convergence rate of the proposed method is demonstrated. Numerical examples are also given to demonstrate the effectiveness of our proposed method. Another important problem is to find the optimal control policy for a PBN so as to avoid the network from entering into undesirable states. By applying external control, the network is desired to enter into some state within a few time steps. For PBN CONTROL, people propose to find a control sequence such that the network will terminate in the desired state with a maximum probability. Also, the problem of minimizing the maximum cost is considered. Integer linear programming (ILP) and dynamic programming (DP) in conjunction with hard constraints are then employed to solve the above problems. Numerical experiments are given to demonstrate the effectiveness of our algorithms. A hardness result is demonstrated and suggests that PBN CONTROL is harder than BN CONTROL. In addition, deciding the steady state probability in PBN for a specified global state is demonstrated to be NP-hard. However, due to the high computational complexity of PBNs, DP method is computationally inefficient for a large size network. Inspired by the state reduction strategies studied in [86], the DP method in conjunction with state reduction approach is then proposed to reduce the computational cost of the DP method. Numerical examples are given to demonstrate both the effectiveness and the efficiency of our proposed method.
 
dc.description.naturepublished_or_final_version
 
dc.description.thesisdisciplineMathematics
 
dc.description.thesisleveldoctoral
 
dc.description.thesisnameDoctor of Philosophy
 
dc.identifier.hkulb4832960
 
dc.languageeng
 
dc.publisherThe University of Hong Kong (Pokfulam, Hong Kong)
 
dc.relation.ispartofHKU Theses Online (HKUTO)
 
dc.rightsThe author retains all proprietary rights, (such as patent rights) and the right to use in future works.
 
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License
 
dc.source.urihttp://hub.hku.hk/bib/B48329605
 
dc.subject.lcshGenetic regulation - Mathematical models.
 
dc.subject.lcshAlgebra, Boolean.
 
dc.subject.lcshControl theory.
 
dc.titleOn construction and control of probabilistic Boolean networks
 
dc.typePG_Thesis
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.advisor>Ching, WK</contributor.advisor>
<contributor.advisor>Tsing, NK</contributor.advisor>
<contributor.author>Chen, Xi</contributor.author>
<contributor.author>&#38472;&#26342;</contributor.author>
<date.issued>2012</date.issued>
<description.abstract>&#65279;Modeling gene regulation is an important problem in genomic research. The Boolean network (BN) and its generalization Probabilistic Boolean network (PBN) have been proposed to model genetic regulatory interactions.



BN is a deterministic model while PBN is a stochastic model. In a PBN, on one hand, its stationary distribution gives important information about the long-run behavior of the network. On the other hand, one may be interested in system synthesis which requires the construction of networks from the observed stationary distribution. This results in an inverse problem of constructing PBNs from a given stationary distribution and a given set of Boolean Networks (BNs), which is ill-posed and challenging, because there may be many networks or no network having the given properties and the size of the inverse problem is huge. The inverse problem is first formulated as a constrained least squares problem. A heuristic method is then proposed based on the conjugate gradient (CG) algorithm, an iterative method, to solve the resulting least squares problem. An estimation method for the parameters of the PBNs is also discussed. Numerical examples are then given to demonstrate the effectiveness of the proposed methods.



However, the PBNs generated by the above algorithm depends on the initial guess and is not unique. A heuristic method is then proposed for generating PBNs from a given transition probability matrix. Unique solution can be obtained in this case. Moreover, these algorithms are able to recover the dominated BNs and therefore the major structure of the network.



To further evaluate the feasible solutions, a maximum entropy approach is proposed using entropy as a measure of the fitness. Newton&#8217;s method in conjunction with the CG method is then applied to solving the inverse problem. The convergence rate of the proposed method is demonstrated. Numerical examples are also given to demonstrate the effectiveness of our proposed method.



Another important problem is to find the optimal control policy for a PBN so as to avoid the network from entering into undesirable states. By applying external control, the network is desired to enter into some state within a few time steps. For PBN CONTROL, people propose to find a control sequence such that the network will terminate in the desired state with a maximum probability. Also, the problem of minimizing the maximum cost is considered. Integer linear programming (ILP) and dynamic programming (DP) in conjunction with hard constraints are then employed to solve the above problems. Numerical experiments are given to demonstrate the effectiveness of our algorithms. A hardness result is demonstrated and suggests that PBN CONTROL is harder than BN CONTROL. In addition, deciding the steady state probability in PBN for a specified global state is demonstrated to be NP-hard.



However, due to the high computational complexity of PBNs, DP method is computationally inefficient for a large size network. Inspired by the state reduction strategies studied in [86], the DP method in conjunction with state reduction approach is then proposed to reduce the computational cost of the DP method. Numerical examples are given to demonstrate both the effectiveness and the efficiency of our proposed method.</description.abstract>
<language>eng</language>
<publisher>The University of Hong Kong (Pokfulam, Hong Kong)</publisher>
<relation.ispartof>HKU Theses Online (HKUTO)</relation.ispartof>
<rights>The author retains all proprietary rights, (such as patent rights) and the right to use in future works.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<source.uri>http://hub.hku.hk/bib/B48329605</source.uri>
<subject.lcsh>Genetic regulation - Mathematical models.</subject.lcsh>
<subject.lcsh>Algebra, Boolean.</subject.lcsh>
<subject.lcsh>Control theory.</subject.lcsh>
<title>On construction and control of probabilistic Boolean networks</title>
<type>PG_Thesis</type>
<identifier.hkul>b4832960</identifier.hkul>
<description.thesisname>Doctor of Philosophy</description.thesisname>
<description.thesislevel>doctoral</description.thesislevel>
<description.thesisdiscipline>Mathematics</description.thesisdiscipline>
<description.nature>published_or_final_version</description.nature>
<date.hkucongregation>2012</date.hkucongregation>
<bitstream.url>http://hub.hku.hk/bitstream/10722/173904/1/FullText.pdf</bitstream.url>
</item>