On generating optimal sparse probabilistic Boolean networks with maximum entropy from a positive stationary distribution.

DOI10.4208/EAJAM.191012.221112AzbMATH Open1284.92033OpenAlexW2128403879MaRDI QIDQ5406930FDOQ5406930

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

Publication date: 4 April 2014

Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)

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

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

zbMATH Keywords

entropysparsitygenetic regulatory networksBoolean networksprobabilistic Boolean networkstransition probability matrixstationary probability distribution

Mathematics Subject Classification ID

Systems biology, networks (92C42)

Cites Work

• Title not available (Why is that?)
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• A Mathematical Theory of Communication
• Information Theory and Statistical Mechanics
• Markov chains: models, algorithms and applications
• Probabilistic Boolean networks. The modeling and control of gene regulatory networks
• On computation of the steady-state probability distribution of probabilistic Boolean networks with gene perturbation
• CONTROL OF STATIONARY BEHAVIOR IN PROBABILISTIC BOOLEAN NETWORKS BY MEANS OF STRUCTURAL INTERVENTION
• A matrix perturbation method for computing the steady-state probability distributions of probabilistic Boolean networks with gene perturbations
• 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
• On construction of sparse probabilistic Boolean networks.
• Bioinformatics

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)