256 related articles for article (PubMed ID: 21431552)
1. Algebraic model checking for Boolean gene regulatory networks.
Tran QN
Adv Exp Med Biol; 2011; 696():113-22. PubMed ID: 21431552
[TBL] [Abstract][Full Text] [Related]
2. A SAT-based algorithm for finding attractors in synchronous Boolean networks.
Dubrova E; Teslenko M
IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1393-9. PubMed ID: 21778527
[TBL] [Abstract][Full Text] [Related]
3. P_UNSAT approach of attractor calculation for Boolean gene regulatory networks.
He Q; Xia Z; Lin B
J Theor Biol; 2018 Jun; 447():171-177. PubMed ID: 29605228
[TBL] [Abstract][Full Text] [Related]
4. Construction of a Boolean model of gene and protein regulatory network with memory.
Yang M; Li R; Chu T
Neural Netw; 2014 Apr; 52():18-24. PubMed ID: 24444824
[TBL] [Abstract][Full Text] [Related]
5. Distribution and enumeration of attractors in probabilistic Boolean networks.
Hayashida M; Tamura T; Akutsu T; Ching WK; Cong Y
IET Syst Biol; 2009 Nov; 3(6):465-74. PubMed ID: 19947772
[TBL] [Abstract][Full Text] [Related]
6. An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks.
He Q; Xia Z; Lin B
J Theor Biol; 2016 Nov; 408():137-144. PubMed ID: 27524645
[TBL] [Abstract][Full Text] [Related]
7. "Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis.
Arellano G; Argil J; Azpeitia E; Benítez M; Carrillo M; Góngora P; Rosenblueth DA; Alvarez-Buylla ER
BMC Bioinformatics; 2011 Dec; 12():490. PubMed ID: 22192526
[TBL] [Abstract][Full Text] [Related]
8. An efficient algorithm for computing fixed length attractors based on bounded model checking in synchronous Boolean networks with biochemical applications.
Li XY; Yang GW; Zheng DS; Guo WS; Hung WN
Genet Mol Res; 2015 Apr; 14(2):4238-44. PubMed ID: 25966195
[TBL] [Abstract][Full Text] [Related]
9. On control of singleton attractors in multiple Boolean networks: integer programming-based method.
Qiu Y; Tamura T; Ching WK; Akutsu T
BMC Syst Biol; 2014; 8 Suppl 1(Suppl 1):S7. PubMed ID: 24565276
[TBL] [Abstract][Full Text] [Related]
10. ILP/SMT-Based Method for Design of Boolean Networks Based on Singleton Attractors.
Kobayashi K; Hiraishi K
IEEE/ACM Trans Comput Biol Bioinform; 2014; 11(6):1253-9. PubMed ID: 26357060
[TBL] [Abstract][Full Text] [Related]
11. An approximation method for solving the steady-state probability distribution of probabilistic Boolean networks.
Ching WK; Zhang S; Ng MK; Akutsu T
Bioinformatics; 2007 Jun; 23(12):1511-8. PubMed ID: 17463027
[TBL] [Abstract][Full Text] [Related]
12. The Case for Algebraic Biology: from Research to Education.
Macauley M; Youngs N
Bull Math Biol; 2020 Aug; 82(9):115. PubMed ID: 32816124
[TBL] [Abstract][Full Text] [Related]
13. Boolean networks with multiexpressions and parameters.
Zou YM
IEEE/ACM Trans Comput Biol Bioinform; 2013; 10(3):584-92. PubMed ID: 24091393
[TBL] [Abstract][Full Text] [Related]
14. Common Attractors in Multiple Boolean Networks.
Cao Y; Pi W; Lin CY; Munzner U; Ohtomo M; Akutsu T
IEEE/ACM Trans Comput Biol Bioinform; 2023; 20(5):2862-2873. PubMed ID: 37079419
[TBL] [Abstract][Full Text] [Related]
15. An Algorithm for Finding the Singleton Attractors and Pre-Images in Strong-Inhibition Boolean Networks.
He Z; Zhan M; Liu S; Fang Z; Yao C
PLoS One; 2016; 11(11):e0166906. PubMed ID: 27861624
[TBL] [Abstract][Full Text] [Related]
16. Finding optimal control policy in probabilistic Boolean Networks with hard constraints by using integer programming and dynamic programming.
Chen X; Akutsu T; Tamura T; Ching WK
Int J Data Min Bioinform; 2013; 7(3):322-43. PubMed ID: 23819262
[TBL] [Abstract][Full Text] [Related]
17. Optimal control policy for probabilistic Boolean networks with hard constraints.
Ching WK; Zhang SQ; Jiao Y; Akutsu T; Tsing NK; Wong AS
IET Syst Biol; 2009 Mar; 3(2):90-9. PubMed ID: 19292563
[TBL] [Abstract][Full Text] [Related]
18. ViSiBooL-visualization and simulation of Boolean networks with temporal constraints.
Schwab J; Burkovski A; Siegle L; Müssel C; Kestler HA
Bioinformatics; 2017 Feb; 33(4):601-604. PubMed ID: 27797768
[TBL] [Abstract][Full Text] [Related]
19. Taming Asynchrony for Attractor Detection in Large Boolean Networks.
Mizera A; Pang J; Qu H; Yuan Q
IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(1):31-42. PubMed ID: 29994682
[TBL] [Abstract][Full Text] [Related]
20. Control of Boolean networks: hardness results and algorithms for tree structured networks.
Akutsu T; Hayashida M; Ching WK; Ng MK
J Theor Biol; 2007 Feb; 244(4):670-9. PubMed ID: 17069859
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
