Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
348
0

Year Published

2015
2015
2018
2018

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 687 publications
(349 citation statements)
references
References 17 publications
1
348
0
Order By: Relevance
“…The controllability of Boolean networks, a class of discrete-time nonlinear systems that are often used to model gene regulations, has been intensively studied (Akutsu et al, 2007;Cheng and Qi, 2009). We can prove that finding a control strategy leading to the desired final state is NP-hard for a general Boolean network and this problem can be solved in polynomial time only if the network has a tree structure or contains at most one directed cycle (Akutsu et al, 2007).…”
Section: Boolean Networkmentioning
confidence: 99%
See 2 more Smart Citations
“…The controllability of Boolean networks, a class of discrete-time nonlinear systems that are often used to model gene regulations, has been intensively studied (Akutsu et al, 2007;Cheng and Qi, 2009). We can prove that finding a control strategy leading to the desired final state is NP-hard for a general Boolean network and this problem can be solved in polynomial time only if the network has a tree structure or contains at most one directed cycle (Akutsu et al, 2007).…”
Section: Boolean Networkmentioning
confidence: 99%
“…We can prove that finding a control strategy leading to the desired final state is NP-hard for a general Boolean network and this problem can be solved in polynomial time only if the network has a tree structure or contains at most one directed cycle (Akutsu et al, 2007). Interestingly, based on semi-tensor product of matrices (Cheng et al, 2007) and the matrix expression of Boolean logic, the Boolean dynamics can be exactly mapped into the standard discrete-time linear dynamics (Cheng and Qi, 2009). Necessary and sufficient conditions to assure controllability of Boolean networks can then be proved (Cheng and Qi, 2009).…”
Section: Boolean Networkmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, a huge development in the study of finite-valued systems is the algebraic state space approach proposed by D. Cheng [11], which is based on the semi-tensor product (STP). The algebraic state space approach has been successfully applied to express and analyze Boolean networks, and many excellent works have been presented [11,12].…”
Section: Introductionmentioning
confidence: 99%
“…The algebraic state space approach has been successfully applied to express and analyze Boolean networks, and many excellent works have been presented [11,12].…”
Section: Introductionmentioning
confidence: 99%