• Publication
  • PrePrints
  • Abstract - ILP/SMT-Based Method for Design of Boolean Networks Based on Singleton Attractors
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ILP/SMT-Based Method for Design of Boolean Networks Based on Singleton Attractors
PrePrint
ISSN: 1545-5963
Attractors in gene regulatory networks represent cell types or states of cells. In system biology and synthetic biology, it is important to generate gene regulatory networks with desired attractors. In this paper, we focus on a singleton attractor, which is also called a fixed point. Using a Boolean network (BN) model, we consider the problem of finding Boolean functions such that the system has desired singleton attractors and has no undesired singleton attractors. To solve this problem, we propose a matrix-based representation of BNs. Using this representation, the problem of finding Boolean functions can be rewritten as an ILP (Integer Linear Programming) problem and an SMT (Satisfiability Modulo Theories) problem. Furthermore, the effectiveness of the proposed method is shown by a numerical example on a WNT5A network, which is related to melanoma. The proposed method provides us a basic method for design of gene regulatory networks.
Citation:
Kunihiko Hiraishi, "ILP/SMT-Based Method for Design of Boolean Networks Based on Singleton Attractors," IEEE/ACM Transactions on Computational Biology and Bioinformatics, 23 May 2014. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TCBB.2014.2325011>
Usage of this product signifies your acceptance of the Terms of Use.