Reconstruction of Kauffman networks applying trees

DOI10.1016/j.laa.2006.01.024zbMath1099.37519OpenAlexW1974820091MaRDI QIDQ2497958

Lídia Rejtő, Gábor Tusnády

Publication date: 4 August 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.01.024

zbMATH Keywords

stabilityattractorsassignment problemdecision treesvertex cover problemregulatory networksregularity Lemmamicroarray measurementstierra

Mathematics Subject Classification ID

Trees (05C05) Dynamical systems in biology (37N25) Protein sequences, DNA sequences (92D20) Dynamical aspects of cellular automata (37B15) Neural nets and related approaches to inference from stochastic processes (62M45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical points for random Boolean networks
• Multi-criterion optimization for genetic network modeling
• On the ratio of optimal integral and fractional covers
• On learning gene regulatory networks under the Boolean network model
• Distribution of the eigenvalues of random block-matrices.
• The analysis of gene expression data. Methods and software
• Mathematical biology. Vol. 2: Spatial models and biomedical applications.
• Evolution, complexity, entropy and artificial reality
• Detecting autocatalytic, self-sustaining sets in chemical reaction systems
• Clustering methods in microarrays
• The degree sequence of a scale-free random graph process
• Superpolynomial Growth in the Number of Attractors in Kauffman Networks
• Emergence of Scaling in Random Networks
• Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
• Attractors in fully asymmetric neural networks
• Approximate Set Covering in Uniform Hypergraphs
• On the threshold of chaos in random boolean cellular automata
• The hypergraph regularity method and its applications