On construction of sparse probabilistic Boolean networks.
From MaRDI portal
Publication:5406906
Recommendations
- On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.
- Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- Generating probabilistic Boolean networks from a prescribed stationary distribution
- Distributional observability of probabilistic Boolean networks
Cites work
- scientific article; zbMATH DE number 1950552 (Why is no real title available?)
- A Mathematical Theory of Communication
- Coefficient of determination in nonlinear signal processing.
- 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
- Markov chains: models, algorithms and applications
- Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation.
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Trust Region Methods
Cited in
(7)- A modified orthogonal matching pursuit for construction of sparse probabilistic Boolean networks
- Bayesian selection probability estimation for probabilistic Boolean networks
- Construction of probabilistic Boolean networks from a prescribed transition probability matrix: a maximum entropy rate approach.
- On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.
- Sparse probabilistic Boolean network problems: a partial proximal-type operator splitting method
- Sparse solution of nonnegative least squares problems with applications in the construction of probabilistic Boolean networks.
- A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
This page was built for publication: On construction of sparse probabilistic Boolean networks.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5406906)