SAT-based algorithm for finding cycles in a Boolean network

DOI10.3969/J.ISSN.1001-0548.2015.06.015MaRDI QIDQ2993454zbMATH OpenFDO

Authors Wensheng Guo, Guowu Yang, Min Gao, XiaoYu Li

Publication date 10 August 2016

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-0548.2015.06.015

zbMATH Keywords

blocking clauseBoolean networksBoolean satisfiabilitycycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS
• Algorithms for analysis and control of Boolean networks
• scientific article; zbMATH DE number 1630006
• Fixed points of Boolean networks with small number of elementary circuits
• Sequential operator for filtering cycles in Boolean networks

Cited in

(4)

• Cycles of periodically time-variant Boolean networks
• Finding Lean Induced Cycles in Binary Hypercubes
• FINDING CYCLES IN SYNCHRONOUS BOOLEAN NETWORKS WITH APPLICATIONS TO BIOCHEMICAL SYSTEMS
• Sequential operator for filtering cycles in Boolean networks

This page was built for publication: SAT-based algorithm for finding cycles in a Boolean network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993454)