Design of fixed points in Boolean networks using feedback vertex sets and model reduction

DOI10.1155/2019/9261793zbMath1421.93014OpenAlexW2920149896MaRDI QIDQ2325214

Koichi Kobayashi

Publication date: 9 September 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/9261793

Mathematics Subject Classification ID

Uses Software

• Yices

Cites Work

• Unnamed Item
• Dynamics and control at feedback vertex sets. I: Informative and determining nodes in regulatory networks
• Modeling and integer programming techniques applied to propositional calculus
• Controllability and observability of Boolean control networks
• Analysis and control of Boolean networks. A semi-tensor product approach.
• Approximating minimum feedback sets and multicuts in directed graphs
• Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics
• Optimization-based approaches to control of probabilistic Boolean networks
• Compositional analysis of Boolean networks using local fixed-point iterations
• Reduction of Boolean network models
• Dynamics and control at feedback vertex sets. II: A faithful monitor to determine the diversity of molecular activities in regulatory networks
• Control of Boolean networks: hardness results and algorithms for tree structured networks
• Reducibility among Combinatorial Problems
• Structural Monostability of Activation-Inhibition Boolean Networks
• Static Analysis of Boolean Networks Based on Interaction Graphs: A Survey

This page was built for publication: Design of fixed points in Boolean networks using feedback vertex sets and model reduction