Reconstruction of Kauffman networks applying trees
From MaRDI portal
Publication:2497958
Recommendations
Cites work
- Approximate Set Covering in Uniform Hypergraphs
- Attractors in fully asymmetric neural networks
- Boolean dynamics with random couplings
- Clustering methods in microarrays
- Critical points for random Boolean networks
- Detecting autocatalytic, self-sustaining sets in chemical reaction systems
- Distribution of the eigenvalues of random block-matrices.
- Emergence of Scaling in Random Networks
- Evolution, complexity, entropy and artificial reality
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1959638 (Why is no real title available?)
- scientific article; zbMATH DE number 2066194 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 2202354 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3310577 (Why is no real title available?)
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- Mathematical biology. Vol. 2: Spatial models and biomedical applications.
- Multi-criterion optimization for genetic network modeling
- On learning gene regulatory networks under the Boolean network model
- On the ratio of optimal integral and fractional covers
- On the threshold of chaos in random boolean cellular automata
- Superpolynomial growth in the number of attractors in Kauffman networks
- The analysis of gene expression data. Methods and software
- The degree sequence of a scale-free random graph process
- The hypergraph regularity method and its applications
Cited in
(2)
This page was built for publication: Reconstruction of Kauffman networks applying trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2497958)