Computing Symbolic Steady States of Boolean Networks

Hannes Klarner; Alexander Bockmayr; Heike Siebert

doi:10.1007/978-3-319-11520-7_59

ScienceGate Book Chapters

BOOK-CHAPTER

Computing Symbolic Steady States of Boolean Networks

Hannes Klarner Alexander Bockmayr Heike Siebert

Year: 2014 Lecture notes in computer science Pages: 561-570 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-319-11520-7_59

Get Full-Text PDF Get Analytical Report

Keywords:

Attractor Computer science Asynchronous communication Boolean network Generalization Implicant Theoretical computer science Steady state (chemistry) Reduction (mathematics) Transduction (biophysics) Symbolic data analysis Boolean function Algorithm Boolean expression Mathematics

Metrics

Cited By

8.72

FWCI (Field Weighted Citation Impact)

Refs

0.94

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Gene Regulatory Network Analysis

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Microbial Metabolic Engineering and Bioproduction

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Protein Structure and Dynamics

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Computing Symbolic Steady States of Boolean Networks

Metrics

Citation History

Topics

Related Documents

Analysis of Discrete Bioregulatory Networks Using Symbolic Steady States

Symbolic dynamics of Boolean control networks

Computing preimages of Boolean networks

Symbolic Steady States and Dynamically Essential Subnetworks of Discrete Regulatory Networks

Steady-state analysis of probabilistic Boolean networks