Algorithms for Inference, Analysis and Control of Boolean Networks

Authors:
Tatsuya Akutsu;Morihiro Hayashida;Takeyuki Tamura
Affiliations:
Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan 611-0011;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan 611-0011;Bioinformatics Center, Institute for Chemical Research, Kyoto University, Kyoto, Japan 611-0011
Venue:
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Year:
2008

Citing 13
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Solving the Satisfiability Problem through Boolean Networks

AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model

Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
External Control in Markovian Genetic Regulatory Networks

Machine Learning
Learning functions of k relevant variables

Journal of Computer and System Sciences - Special issue: STOC 2003
Performance analysis of a greedy algorithm for inferring boolean functions

Information Processing Letters
Intervention in context-sensitive probabilistic Boolean networks

Bioinformatics
Algorithms for finding small attractors in boolean networks

EURASIP Journal on Bioinformatics and Systems Biology
An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes

AB '08 Proceedings of the 3rd international conference on Algebraic Biology
An efficient method for dynamic analysis of gene regulatory networks and in silico gene perturbation experiments

RECOMB'07 Proceedings of the 11th annual international conference on Research in computational molecular biology
A control model for markovian genetic regulatory networks

Transactions on Computational Systems Biology V
Optimal infinite-horizon control for probabilistic Boolean networks

IEEE Transactions on Signal Processing - Part II
When does greedy learning of relevant attributes succeed?: a fourier-based characterization

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Boolean networks (BNs) are known as a mathematical model of genetic networks. In this paper, we overview algorithmic aspects of inference, analysis and control of BNs while focusing on the authors' works. For inference of BN, we review results on the sample complexity required to uniquely identify a BN. For analysis of BN, we review efficient algorithms for identifying singleton attractors. For control of BN, we review NP-hardness results and dynamic programming algorithms for general and special cases.