메뉴 건너뛰기




Volumn 16, Issue 5, 2009, Pages 725-743

Logic integer programming models for signaling networks

Author keywords

Biological signaling networks; Integer programming; Modeling; Monotone boolean functions; Satisfiability

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; EXPERIMENTAL STUDY; MATHEMATICAL ANALYSIS; MOLECULAR BIOLOGY; PRIORITY JOURNAL; QUALITATIVE ANALYSIS; QUANTITATIVE ANALYSIS; STATISTICAL MODEL;

EID: 67049134787     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2008.0163     Document Type: Article
Times cited : (10)

References (14)
  • 5
    • 0000039971 scopus 로고    scopus 로고
    • On the complexity of dualization of monotone disjunctive normal forms
    • Fredman, M.L., and Khachiyan, L. 1996. On the complexity of dualization of monotone disjunctive normal forms.J. Algorithms 21, 618-628.
    • (1996) J. Algorithms , vol.21 , pp. 618-628
    • Fredman, M.L.1    Khachiyan, L.2
  • 7
    • 0000844603 scopus 로고    scopus 로고
    • Some optimal inapproximability results
    • Hastad, J. 2001. Some optimal inapproximability results. J. ACM 48, 798-859.
    • (2001) J. ACM , vol.48 , pp. 798-859
    • Hastad, J.1
  • 8
    • 67649253261 scopus 로고    scopus 로고
    • Haus, U.-U. 2008. cl-jointgen, a common lisp implementation of the joint-generation method. Available at:www.primaldual.de/cl-jointgen. Accessed March 15, 2009.
    • Haus, U.-U. 2008. cl-jointgen, a common lisp implementation of the joint-generation method. Available at:www.primaldual.de/cl-jointgen. Accessed March 15, 2009.
  • 9
    • 67649286806 scopus 로고    scopus 로고
    • Linear satisfiability algorithm for 3CNF formulas of certainsignaling networks
    • Haus, U.-U., Truemper, K., and Weismantel, R. 2008. Linear satisfiability algorithm for 3CNF formulas of certainsignaling networks. J. Satisf. Boolean Model. Comput. 6, 13-22.
    • (2008) J. Satisf. Boolean Model. Comput , vol.6 , pp. 13-22
    • Haus, U.-U.1    Truemper, K.2    Weismantel, R.3
  • 11
    • 0033752070 scopus 로고    scopus 로고
    • Generating all maximal models of a Boolean expression
    • Saez-Rodriguez, J
    • Kavvadias, D.J., Sideri, M., and Stavropoulos, E.C. 2000. Generating all maximal models of a Boolean expression.Inform. Process. Lett. 74, 157-162. Saez-Rodriguez, J.,
    • (2000) Inform. Process. Lett , vol.74 , pp. 157-162
    • Kavvadias, D.J.1    Sideri, M.2    Stavropoulos, E.C.3
  • 13
    • 67649280735 scopus 로고    scopus 로고
    • receptor signaling network. PLoS Comput. Biol. [DOI http:://dx.doi.org/10.1371/journal.pcbi.0030163.] PLoS Comput. Biol. 3(8), e163.
    • receptor signaling network. PLoS Comput. Biol. [DOI http:://dx.doi.org/10.1371/journal.pcbi.0030163.] PLoS Comput. Biol. 3(8), e163.


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