On learning gene regulatory networks under the Boolean network model

From MaRDI portal
Revision as of 17:00, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1402264


DOI10.1023/A:1023905711304zbMath1039.68162OpenAlexW1600339875WikidataQ58049516 ScholiaQ58049516MaRDI QIDQ1402264

Harri Lähdesmäki, Olli Yli-Harja, Ilya Shmulevich

Publication date: 20 August 2003

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023905711304



Related Items

Improved time complexities for learning Boolean networks, Inferring dynamic gene regulatory networks with low-order conditional independencies -- an evaluation of the method, The number and probability of canalizing functions, From Quantitative SBML Models to Boolean Networks, Modeling gene networks in \textit{Saccharomyces cerevisiae} based on gene expression profiles, An efficient top-down search algorithm for learning Boolean networks of gene expression, Stabilizability analysis of logical networks with switching signal and control input, The stabilization of random Boolean networks through edge immunization, Interpolative Boolean networks, Structural properties of continuous representations of Boolean functions for gene network modelling, Observability of periodically switched Boolean control networks, Differentiable learning of matricized DNFs and its application to Boolean networks, Controllability and set controllability of periodically switched Boolean control networks, Stability and bifurcation of delayed bidirectional gene regulatory networks with negative feedback loops, COMPUTATION BY ANNOTATION: MODELLING EPIGENETIC REGULATION, Attractors in Boolean networks: a tutorial, Inferring Boolean functions via higher-order correlations, Reconstruction of Kauffman networks applying trees, Generating probabilistic Boolean networks from a prescribed stationary distribution, Using extremal events to characterize noisy time series, Analyzing Boolean networks through unsupervised learning, Learning any memory-less discrete semantics for dynamical systems represented by logic programs


Uses Software