메뉴 건너뛰기




Volumn E95-D, Issue 12, 2012, Pages 2960-2970

Integer programming-based approach to attractor detection and control of boolean networks

Author keywords

Attractors; Boolean networks; Genetic networks; Integer programming; Nonlinear discrete systems

Indexed keywords

BOOLEAN ALGEBRA; DYNAMICAL SYSTEMS; INTEGER PROGRAMMING; MATHEMATICAL MODELS;

EID: 84870681779     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1587/transinf.E95.D.2960     Document Type: Conference Paper
Times cited : (23)

References (32)
  • 1
    • 0000005079 scopus 로고    scopus 로고
    • A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions
    • T. Akutsu, S. Kuhara, O. Maruyama, and S. Miyano, "A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions," Genome Informatics, no.9, pp.151-160, 1998.
    • (1998) Genome Informatics , Issue.9 , pp. 151-160
    • Akutsu, T.1    Kuhara, S.2    Maruyama, O.3    Miyano, S.4
  • 2
    • 33846424927 scopus 로고    scopus 로고
    • Control of Boolean networks: Hardness results and algorithms for treestructured networks
    • T. Akutsu, M. Hayashida, W.-K. Ching, W.-K., and M.K. Ng, "Control of Boolean networks: hardness results and algorithms for treestructured networks," J. Theoretical Biology, vol.244, pp.670-679, 2007.
    • (2007) J. Theoretical Biology , vol.244 , pp. 670-679
    • Akutsu, T.1    Hayashida, M.2    Ching, W.-K.3    Ng, M.K.4
  • 4
    • 80053121012 scopus 로고    scopus 로고
    • Determining a singleton attractor of a Boolean network with nested canalyzing functions
    • T. Akutsu, A.A. Melkman, T. Tamura, and M. Yamamoto, "Determining a singleton attractor of a Boolean network with nested canalyzing functions," J. Computational Biology, vol.18, pp.1275-1290, 2011.
    • (2011) J. Computational Biology , vol.18 , pp. 1275-1290
    • Akutsu, T.1    Melkman, A.A.2    Tamura, T.3    Yamamoto, M.4
  • 6
    • 84870707671 scopus 로고    scopus 로고
    • Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming
    • to appear
    • X. Chen, T. Akutsu, T. Tamura, and W.-K. Ching, "Finding optimal control policy in probabilistic Boolean networks with hard constraints by using integer programming and dynamic programming," International Journal of Data Mining and Bioinformatics, to appear.
    • International Journal of Data Mining and Bioinformatics
    • Chen, X.1    Akutsu, T.2    Tamura, T.3    Ching, W.-K.4
  • 7
    • 67349272281 scopus 로고    scopus 로고
    • Controllability and observability of Boolean control networks
    • D. Cheng and H. Qi, "Controllability and observability of Boolean control networks," Automatica, vol.45, pp.1659-1667, 2009.
    • (2009) Automatica , vol.45 , pp. 1659-1667
    • Cheng, D.1    Qi, H.2
  • 8
    • 63049093000 scopus 로고    scopus 로고
    • Input-state approach to Boolean networks
    • D. Cheng, "Input-state approach to Boolean networks," IEEE Trans. Neural Netw., vol.20, pp.512-521, 2009.
    • (2009) IEEE Trans. Neural Netw. , vol.20 , pp. 512-521
    • Cheng, D.1
  • 9
    • 0038724486 scopus 로고    scopus 로고
    • External control in Markovian genetic regulatory networks
    • A. Datta, A. Choudhary, M.L. Bittner, and E.R. Dougherty, "External control in Markovian genetic regulatory networks," Mach. Learn., vol.52, pp.169-191, 2003.
    • (2003) Mach. Learn. , vol.52 , pp. 169-191
    • Datta, A.1    Choudhary, A.2    Bittner, M.L.3    Dougherty, E.R.4
  • 10
    • 43849093137 scopus 로고    scopus 로고
    • Search for steady states of piecewiselinear differential equation models of genetic regulatory networks
    • H. de Jong and M. Page, "Search for steady states of piecewiselinear differential equation models of genetic regulatory networks," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, no.2, pp.208-222, 2008.
    • (2008) IEEE/ACM Transactions on Computational Biology and Bioinformatics , vol.5 , Issue.2 , pp. 208-222
    • De Jong, H.1    Page, M.2
  • 11
    • 0345393853 scopus 로고    scopus 로고
    • Identification of all steady states in large networks by logical analysis
    • V. Devloo, P. Hansen, and M. Labb'e, "Identification of all steady states in large networks by logical analysis," Bulletin of Mathematical Biology, vol.65, pp.1025-1051, 2003.
    • (2003) Bulletin of Mathematical Biology , vol.65 , pp. 1025-1051
    • Devloo, V.1    Hansen, P.2    Labb'E, M.3
  • 14
    • 50549088838 scopus 로고    scopus 로고
    • Synchronous versus asynchronous modeling of gene regulatory networks
    • A. Garg, A. DiCara, I. Xenarios, L. Mendoza, and G. DeMicheli, "Synchronous versus asynchronous modeling of gene regulatory networks," Bioinformatics, vol.24, pp.1917-1925, 2008.
    • (2008) Bioinformatics , vol.24 , pp. 1917-1925
    • Garg, A.1    Dicara, A.2    Xenarios, I.3    Mendoza, L.4    Demicheli, G.5
  • 17
    • 33747889591 scopus 로고    scopus 로고
    • Improving the efficiency of attractor cycle identification in Boolean networks
    • D.J. Irons, "Improving the efficiency of attractor cycle identification in Boolean networks," Physica D, vol.217, pp.7-21, 2006.
    • (2006) Physica D , vol.217 , pp. 7-21
    • Irons, D.J.1
  • 21
    • 1542619848 scopus 로고    scopus 로고
    • Cancer as a robust system: Implications for anticancer therapy
    • H. Kitano, "Cancer as a robust system: implications for anticancer therapy," Nature Reviews Cancer, vol.4, pp.227-235, 2004.
    • (2004) Nature Reviews Cancer , vol.4 , pp. 227-235
    • Kitano, H.1
  • 22
    • 77957800208 scopus 로고    scopus 로고
    • An integer programming approach to control problems in probabilistic Boolean networks
    • K. Kobayashi and K. Hiraishi. "An integer programming approach to control problems in probabilistic Boolean networks," Proc. 2010 American Control Conference, pp.6710-6715, 2010.
    • (2010) Proc. 2010 American Control Conference , pp. 6710-6715
    • Kobayashi, K.1    Hiraishi, K.2
  • 23
    • 79956212739 scopus 로고    scopus 로고
    • An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
    • K. Kobayashi and K. Hiraishi, "An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks," Automatica, vol.47, pp.1260-1264, 2011.
    • (2011) Automatica , vol.47 , pp. 1260-1264
    • Kobayashi, K.1    Hiraishi, K.2
  • 24
    • 65549157940 scopus 로고    scopus 로고
    • Symbolic approaches for finding control strategies in Boolean networks
    • C.J. Langmead and S.K. Jha, "Symbolic approaches for finding control strategies in Boolean networks," J. Bioinformatics and Computational Biology, vol.7, pp.323-338, 2009.
    • (2009) J. Bioinformatics and Computational Biology , vol.7 , pp. 323-338
    • Langmead, C.J.1    Jha, S.K.2
  • 25
    • 79955879494 scopus 로고    scopus 로고
    • Controllability of complex networks
    • Y.-Y. Liu, J.-J. Slotin, and A.-L. Barab'asi, "Controllability of complex networks," Nature, vol.473, pp.167-173, 2011.
    • (2011) Nature , vol.473 , pp. 167-173
    • Liu, Y.-Y.1    Slotin, J.-J.2    Barab'Asi, A.-L.3
  • 26
    • 0031579615 scopus 로고    scopus 로고
    • Controlling chaos in random Boolean networks
    • B. Luque and R.V. Sol'e, "Controlling chaos in random Boolean networks," Europhysics Letters, vol.37, pp.597-602, 1997.
    • (1997) Europhysics Letters , vol.37 , pp. 597-602
    • Luque, B.1    Sol'E, R.V.2
  • 27
    • 80053119334 scopus 로고    scopus 로고
    • Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time
    • A.A. Melkman, T. Tamura, and T. Akutsu, "Determining a singleton attractor of an AND/OR Boolean network in O(1.587n) time," Inf. Process. Lett., vol.110, pp.565-569, 2010.
    • (2010) Inf. Process. Lett. , vol.110 , pp. 565-569
    • Melkman, A.A.1    Tamura, T.2    Akutsu, T.3
  • 28
    • 0037799461 scopus 로고    scopus 로고
    • Superpolynomial growth in the number of attractors in Kauffman networks
    • B. Samuelsson and C. Troein, "Superpolynomial growth in the number of attractors in Kauffman networks," Phys. Rev. Lett., vol.90, 098701, 2003.
    • (2003) Phys. Rev. Lett. , vol.90 , pp. 098701
    • Samuelsson, B.1    Troein, C.2
  • 29
    • 44649167785 scopus 로고
    • The polynomial-time hierarchy
    • L.J. Stockmeyer, "The polynomial-time hierarchy," Theor. Comput. Sci., vol.3, pp.1-22, 1976.
    • (1976) Theor. Comput. Sci. , vol.3 , pp. 1-22
    • Stockmeyer, L.J.1
  • 30
    • 36248966518 scopus 로고    scopus 로고
    • Induction of pluripotent stem cells from adult human fibroblasts by defined factors
    • K. Takahashi, K. Tanabe, M. Ohnuki, M. Narita, T. Ichisaka, K. Tomoda, and S. Yamanaka, "Induction of pluripotent stem cells from adult human fibroblasts by defined factors," Cell, vol.131, pp.1-12, 2007.
    • (2007) Cell , vol.131 , pp. 1-12
    • Takahashi, K.1    Tanabe, K.2    Ohnuki, M.3    Narita, M.4    Ichisaka, T.5    Tomoda, K.6    Yamanaka, S.7
  • 31
    • 71649101152 scopus 로고    scopus 로고
    • Detecting a singleton attractor in a Boolean network utilizing SAT algorithms
    • Feb
    • T. Tamura and T. Akutsu, "Detecting a singleton attractor in a Boolean network utilizing SAT algorithms," IEICE Trans. Fundamentals, vol.E92-A, no.2, pp.493-501, Feb. 2009.
    • (2009) IEICE Trans. Fundamentals , vol.E92-A , Issue.2 , pp. 493-501
    • Tamura, T.1    Akutsu, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.