Reconstructing gene regulatory networks: from random to scale-free connectivity

2006 ◽  
Vol 153 (4) ◽  
pp. 247 ◽  
Author(s):  
J. Wildenhain ◽  
E.J. Crampin
2008 ◽  
Vol 19 (02) ◽  
pp. 283-290 ◽  
Author(s):  
M. ANDRECUT ◽  
S. A. KAUFFMAN ◽  
A. M. MADNI

We report the reconstruction of the topology of gene regulatory network in human tissues. The results show that the connectivity of the regulatory gene network is characterized by a scale-free distribution. This result supports the hypothesis that scale-free networks may represent the common blueprint for gene regulatory networks.


2020 ◽  
Vol 17 (163) ◽  
pp. 20190845
Author(s):  
Pablo Villegas ◽  
Miguel A. Muñoz ◽  
Juan A. Bonachela

Biological networks exhibit intricate architectures deemed to be crucial for their functionality. In particular, gene regulatory networks, which play a key role in information processing in the cell, display non-trivial architectural features such as scale-free degree distributions, high modularity and low average distance between connected genes. Such networks result from complex evolutionary and adaptive processes difficult to track down empirically. On the other hand, there exists detailed information on the developmental (or evolutionary) stages of open-software networks that result from self-organized growth across versions. Here, we study the evolution of the Debian GNU/Linux software network, focusing on the changes of key structural and statistical features over time. Our results show that evolution has led to a network structure in which the out-degree distribution is scale-free and the in-degree distribution is a stretched exponential. In addition, while modularity, directionality of information flow, and average distance between elements grew, vulnerability decreased over time. These features resemble closely those currently shown by gene regulatory networks, suggesting the existence of common adaptive pathways for the architectural design of information-processing networks. Differences in other hierarchical aspects point to system-specific solutions to similar evolutionary challenges.


Author(s):  
Raphael R. Campos ◽  
Ricardo Ferreira ◽  
Julio C. Goldner Vendramini ◽  
F´bio Cerqueira ◽  
Marcelo Lobato Martins

BMC Genomics ◽  
2020 ◽  
Vol 21 (1) ◽  
Author(s):  
Ming Shi ◽  
Sheng Tan ◽  
Xin-Ping Xie ◽  
Ao Li ◽  
Wulin Yang ◽  
...  

Abstract Background Genes are regulated by various types of regulators and most of them are still unknown or unobserved. Current gene regulatory networks (GRNs) reverse engineering methods often neglect the unknown regulators and infer regulatory relationships in a local and sub-optimal manner. Results This paper proposes a global GRNs inference framework based on dictionary learning, named dlGRN. The method intends to learn atomic regulators (ARs) from gene expression data using a modified dictionary learning (DL) algorithm, which reflects the whole gene regulatory system, and predicts the regulation between a known regulator and a target gene in a global regression way. The modified DL algorithm fits the scale-free property of biological network, rendering dlGRN intrinsically discern direct and indirect regulations. Conclusions Extensive experimental results on simulation and real-world data demonstrate the effectiveness and efficiency of dlGRN in reverse engineering GRNs. A novel predicted transcription regulation between a TF TFAP2C and an oncogene EGFR was experimentally verified in lung cancer cells. Furthermore, the real application reveals the prevalence of DNA methylation regulation in gene regulatory system. dlGRN can be a standalone tool for GRN inference for its globalization and robustness.


Sign in / Sign up

Export Citation Format

Share Document