Abstract

BackgroundIn gene regulatory networks, transcription factors often function as co-regulators to synergistically induce or inhibit expression of their target genes. However, most existing module-finding algorithms can only identify densely connected genes but not co-regulators in regulatory networks.MethodsWe have developed a new computational method, CoReg, to identify transcription co-regulators in large-scale regulatory networks. CoReg calculates gene similarities based on number of common neighbors of any two genes. Using simulated and real networks, we compared the performance of different similarity indices and existing module-finding algorithms and we found CoReg outperforms other published methods in identifying co-regulatory genes. We applied CoReg to a large-scale network of Arabidopsis with more than 2.8 million edges and we analyzed more than 2,300 published gene expression profiles to charaterize co-expression patterns of gene moduled identified by CoReg.ResultsWe identified three types of modules in the Arabidopsis network: regulator modules, target modules and intermediate modules. Regulator modules include genes with more than 90% edges as out-going edges; Target modules include genes with more than 90% edges as incoming edges. Other modules are classified as intermediate modules. We found that genes in target modules tend to be highly co-expressed under abiotic stress conditions, suggesting this network struture is robust against perturbation.ConclusionsOur analysis shows that the CoReg is an accurate method in identifying co-regulatory genes in large-scale networks. We provide CoReg as an R package, which can be applied in finding co-regulators in any organisms with genome-scale regulatory network data.

Highlights

  • In gene regulatory networks, transcription factors often function as co-regulators to synergistically induce or inhibit expression of their target genes

  • Walk Trap (WT) [17] calculates the distance between nodes and groups nodes based on pairwise similarity matrices; Edge Betweenness (EB) [18] builds hierarchical relationship between the nodes and partitions the network into modules; Label Propagation (LP) [19] performs simulation on the network by propagating cluster labels

  • The generated modules will have a stronger co-regulation pattern, characterized by nodes in co-regulatory modules connecting to a small group of nodes rather than random targets in the network (Additional file 1: Figure S1)

Read more

Summary

Introduction

Transcription factors often function as co-regulators to synergistically induce or inhibit expression of their target genes. Most existing module-finding algorithms can only identify densely connected genes but not co-regulators in regulatory networks. A key challenge is how to use these large-scale networks to identify functional information for both TFs and their target genes. Other examples include leading eigenvectors [20] and spin-glass [18] These algorithms can be applied to either undirected networks [17,18,19,20] or directed networks [15] and, in many cases, performed well in finding groups of densely connected nodes.

Methods
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call