SAT-based algorithm for finding cycles in a Boolean network

被引：0
|
作者：
School of Computer Science and Technology, University of Electronic Science and Technology of China, Chengdu [1 ]
610054, China
不详 [2 ]
CA
90034, United States
机构：
来源：
Dianzi Keji Diaxue Xuebao | / 6卷 / 881-886期
关键词：
Blocking clause - Boolean Networks - Boolean satisfiability - Conjunctive normal forms - Cycles - Genetic regulatory networks - Reachability analysis - State transition functions;
D O I：
10.3969/j.issn.1001-0548.2015.06.015
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] A SAT-Based Algorithm for Finding Attractors in Synchronous Boolean Networks
    Dubrova, Elena
    Teslenko, Maxim
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2011, 8 (05) : 1393 - 1399
  • [2] An Efficient SAT-Based Algorithm for Finding Short Cycles in Cryptographic Algorithms
    Dubrova, Elena
    Teslenko, Maxim
    [J]. PROCEEDINGS OF THE 2018 IEEE INTERNATIONAL SYMPOSIUM ON HARDWARE ORIENTED SECURITY AND TRUST (HOST), 2018, : 65 - 72
  • [3] SAT-based algorithm for finding all maximal cliques
    Wu, Haitao
    Hao, Ningbo
    Chou, Wen-Kuang
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2016, 12 (2-3) : 186 - 191
  • [4] SAT-based summarization for boolean programs
    Basler, Gerard
    Kroening, Daniel
    Weissenbacher, Georg
    [J]. MODEL CHECKING SOFTWARE, PROCEEDINGS, 2007, 4595 : 131 - +
  • [5] Simulation and SAT-Based Boolean Matching for Large Boolean Networks
    Wang, Kuo-Hua
    Chan, Chung-Ming
    Liu, Jung-Chang
    [J]. DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2009, : 396 - 401
  • [6] Search techniques for SAT-based Boolean optimization
    Department of Computer Engineering, American University of Sharjah, Sharjah, United Arab Emirates
    [J]. Met. Finish., 2006, 6 (436-447):
  • [7] Search techniques for SAT-based boolean optimization
    Aloul, Fadi A.
    [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 2006, 343 (4-5): : 436 - 447
  • [8] New algorithm for finding fixed points and cycles of Boolean network
    Suo, Jinghui
    Sun, Jitao
    [J]. PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012), 2012, : 2691 - 2694
  • [9] A SAT-based algorithm for context matching
    Bouquet, P
    Magnini, B
    Serafini, L
    Zanobini, S
    [J]. MODELING AND USING CONTEXT, PROCEEDINGS, 2003, 2680 : 66 - 79
  • [10] A SAT-based decision procedure for the Boolean combination of difference constraints
    Armando, A
    Castellini, C
    Giunchiglia, E
    Maratea, M
    [J]. THEORY AND APPLICATIONS OF SATISFIABILITY TESTING, 2005, 3542 : 16 - 29
12345