Are scale-free regulatory networks larger than random ones?
Miguel A. Fortuna, Carlos J. Melian
Abstract
Network of packages with regulatory interactions (dependences and conflicts) from Debian GNU/Linux operating system is compiled and used as analogy of a gene regulatory network. Using a trace-back algorithm we assembly networks from the potential pool of packages for both scale-free and exponential topology from real and a null model data, respectively. We calculate 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. Small genomes with scale-free regulatory topology could allow much more functionality than large genomes with an exponential one, with implications on its dynamics, robustness and evolution.
Create a lesson
Related papers
Visualization and Characterization of Gene Group Distribution Patterns Across Genomes
Yanying Wu
BEND 2.0: Benchmarking the Capabilities Needed to Design DNA
Andreas Bjerregaard, Rachael DeVries, Dionysia Danai Brilli et al.
Pin and Replay, or Refuse: Conditional Exactness and Probabilistic Validation Across Reference Releases
Joshua Terranova, Jiapeng Zhang
Evolutionary characterization of whole-genome doubling across human cancers
Yangyang Zhang, Haiming Li, Xiaoyu Zhao et al.
An auditable agentic pipeline for variant-to-gene prioritisation, validated against orthogonal functional evidence
Shakuntala Baichoo, Sohail, Sarkar et al.
pyTransRate: reference-free quality assessment of de novo transcriptome assemblies with current aligners and quantifiers
Matthew MacManes