On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.
From MaRDI portal
Publication:5406930
Recommendations
- On construction of sparse probabilistic Boolean networks.
- Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
- Generating probabilistic Boolean networks from a prescribed stationary distribution
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- A matrix perturbation method for computing the steady-state probability distributions of probabilistic Boolean networks with gene perturbations
Cites work
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- A Mathematical Theory of Communication
- A matrix perturbation method for computing the steady-state probability distributions of probabilistic Boolean networks with gene perturbations
- Bioinformatics
- CONTROL OF STATIONARY BEHAVIOR IN PROBABILISTIC BOOLEAN NETWORKS BY MEANS OF STRUCTURAL INTERVENTION
- Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
- Generating probabilistic Boolean networks from a prescribed stationary distribution
- Information Theory and Statistical Mechanics
- Markov chains: models, algorithms and applications
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On computation of the steady-state probability distribution of probabilistic Boolean networks with gene perturbation
- On construction of sparse probabilistic Boolean networks.
- Probabilistic Boolean networks. The modeling and control of gene regulatory networks
Cited in
(5)- Generating probabilistic Boolean networks from a prescribed stationary distribution
- On construction of sparse probabilistic Boolean networks.
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
- Sparse probabilistic Boolean network problems: a partial proximal-type operator splitting method
This page was built for publication: On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406930)