On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution

DOI10.4208/eajam.191012.221112azbMath1284.92033OpenAlexW2128403879MaRDI QIDQ5406930

Yushan Qiu, Wai-Ki Ching, Xi Chen, Hao Jiang

Publication date: 4 April 2014

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/eajam.191012.221112a

zbMATH Keywords

entropytransition probability matrixBoolean networkssparsitygenetic regulatory networksprobabilistic Boolean networksstationary probability distribution

Mathematics Subject Classification ID

Systems biology, networks (92C42)

Cites Work

• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• On computation of the steady-state probability distribution of probabilistic Boolean networks with gene perturbation
• A matrix perturbation method for computing the steady-state probability distributions of probabilistic Boolean networks with gene perturbations
• Markov chains: models, algorithms and applications
• Generating probabilistic Boolean networks from a prescribed stationary distribution
• Information Theory and Statistical Mechanics
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach
• On Construction of Sparse Probabilistic Boolean Networks
• CONTROL OF STATIONARY BEHAVIOR IN PROBABILISTIC BOOLEAN NETWORKS BY MEANS OF STRUCTURAL INTERVENTION
• Bioinformatics

This page was built for publication: On Generating Optimal Sparse Probabilistic Boolean Networks with Maximum Entropy from a Positive Stationary Distribution