Do scale-free regulatory networks allow more expression than random ones?
In this paper, we compile the network of software packages with regulatory interactions (dependences and conflicts) from Debian GNU/Linux operating system and use it as an analogy for a gene regulatory network. Using a trace-back algorithm we assemble networks from the pool of packages with both scal...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2007 |
| País: | España |
| Institución: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repositorio: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/51968 |
| Acceso en línea: | http://hdl.handle.net/10261/51968 |
| Access Level: | acceso abierto |
| Palabra clave: | Complex networks Gene networks Network assembly Regulatory interactions Transcriptional regulatory networks |
| Sumario: | In this paper, we compile the network of software packages with regulatory interactions (dependences and conflicts) from Debian GNU/Linux operating system and use it as an analogy for a gene regulatory network. Using a trace-back algorithm we assemble networks from the pool of packages with both scale-free (real data) and exponential (null model) topologies. We record the maximum number of packages that can be functionally installed in the system (i.e., the active network size). We show that scale-free regulatory networks allow a larger active network size than random ones. This result might have implications for the number of expressed genes at steady state. Small genomes with scale-free regulatory topologies could allow much more expression than large genomes with exponential topologies. This may have implications for the dynamics, robustness and evolution of genomes |
|---|