On Construction of Sparse Probabilistic Boolean Networks (Q5406906): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains: models, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Probabilistic Boolean Networks from a Prescribed Transition Probability Matrix: A Maximum Entropy Rate Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating probabilistic Boolean networks from a prescribed stationary distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coefficient of determination in nonlinear signal processing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling the complexity of genetic networks: Understanding multigenic and pleiotropic regulation. / rank
 
Normal rank

Latest revision as of 14:12, 7 July 2024

scientific article; zbMATH DE number 6279671
Language Label Description Also known as
English
On Construction of Sparse Probabilistic Boolean Networks
scientific article; zbMATH DE number 6279671

    Statements

    On Construction of Sparse Probabilistic Boolean Networks (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2014
    0 references
    0 references
    probabilistic Boolean networks
    0 references
    entropy
    0 references
    stationary distribution
    0 references
    sparsity
    0 references
    transition probability matrix
    0 references
    0 references