Large-scale inference and graph theoretical analysis of gene-regulatory networks in B. stubtilis
arXiv:q-bio/0607024 · doi:10.1016/j.physa.2006.04.118
Abstract
We present the methods and results of a two-stage modeling process that generates candidate gene-regulatory networks of the bacterium B. subtilis from experimentally obtained, yet mathematically underdetermined microchip array data. By employing a computational, linear correlative procedure to generate these networks, and by analyzing the networks from a graph theoretical perspective, we are able to verify the biological viability of our inferred networks, and we demonstrate that our networks' graph theoretical properties are remarkably similar to those of other biological systems. In addition, by comparing our inferred networks to those of a previous, noisier implementation of the linear inference process [17], we are able to identify trends in graph theoretical behavior that occur both in our networks as well as in their perturbed counterparts. These commonalities in behavior at multiple levels of complexity allow us to ascertain the level of complexity to which our process is robust to noise.
22 pages, 4 figures, accepted for publication in Physica A (2006)
References in corpus (9)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Efficient Behavior of Small-World Networks
- The large-scale organization of metabolic networks
- Random graphs with arbitrary degree distributions and their applications
- Economic Small-World Behavior in Weighted Networks
- The topological relationship between the large-scale attributes and local interaction patterns of complex networks
- Dynamic modeling of gene expression data
- Topological Generalizations of network motifs