Skip to main content
Log in

The Structural Role of Feed-Forward Loop Motif in Transcriptional Regulatory Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

We present multiple approaches to identify the significance of topological metrics that contribute to biological network robustness. We examine and compare the communication efficiency of transcriptional networks extracted from the bacterium Escherichia coli and the baker’s yeast Saccharomyces cerevisiae using discrete event simulation based in silico experiments. The packet receipt rate is used as a dynamical metric to understand information flow, while unsupervised machine learning techniques are used to examine underlying relationships inherent to the network topology. To this effect, we defined sixteen features based on structural/topological significance, such as transcriptional motifs, and other traditional metrics, such as network density and average shortest path, among others. Support vector classification is used with these features after parameters were identified using a cross-validation grid-search method. Feature ranking is performed using analysis of variance F-value metric. We found that feed-forward loop (FFL) based features consistently show up as significant in both the bacterial and yeast networks, even at different noise levels. We then use a supervised machine learning technique (random forests) to investigate the structural prominence of the FFL motif in information transmission using subnetworks (larger sample size compared to the unsupervised approach) extracted from Escherichia coli transcriptional regulatory network. Further, we study the role of FFLs in signal transduction within the complete Escherichia coli regulatory network. Although our work reveals a minimal role of FFLs in signal transduction, it highlights the structural role of FFLs in information transmission captured by random forest regression. This work paves the way to design specialized engineered systems, such as wireless sensor networks, that exploit topological properties of natural networks to attain maximum efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Notes

  1. For the figure to be legible, X and Y labels are displayed only once. This is done for Figs. 3a – 6.

  2. Similar figures for 26 embedded non-peripheral FFLs are not presented here

References

  1. Albert R, Jeong H, Barabasi A (2000) Error and attack tolerance of complex networks. Nature 406:378

    Article  Google Scholar 

  2. Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286(5439):509–512

    Article  MathSciNet  MATH  Google Scholar 

  3. Breiman L (2001) Random forests. Mach Learn 45(1):5–32

    Article  MathSciNet  MATH  Google Scholar 

  4. Friedlander T, Mayo AE, Tlusty T, Alon U (2015) Evolution of bow-tie architectures in biology. PLoS Comput Biol 11(3):e1004,055–e1004,055

    Article  Google Scholar 

  5. Ghosh P, Mayo M, Chaitankar V, Habib T, Perkins E, Das SK (2011) Principles of genomic robustness inspire fault-tolerant wsn topologies: a network science based case study. In: 2011 IEEE international conference on Pervasive computing and communications workshops (PERCOM workshops), pp 160–165. IEEE

  6. Ghosh S, Ghosh P, Basu K, Das SK (2005) Gama : an evolutionary algorithmic approach for the design of mesh-based radio access networks. In: 2005 IEEE international conference on Local computer networks, pp 374–381. IEEE

  7. Hearst MA, Dumais S, Osman E, Platt J, Scholkopf B (1998) Support vector machines. IEEE Intelligent Systems and their Applications 13(4):18–28

    Article  Google Scholar 

  8. Hsu CW, Chang CC, Lin CJ et al (2003) a practical guide to support vector classification

  9. Isalan M, Lemerle C, Michalodimitrakis K, Horn C, Beltrao P, Raineri E, Garriga-Canut M, Serrano L (2008) Evolvability and hierarchy in rewired bacterial gene networks. Nature 452:840

    Article  Google Scholar 

  10. Kamapantula BK, Abdelzaher A, Ghosh P, Mayo M, Perkins E, Das SK (2012) Performance of wireless sensor topologies inspired by e. coli genetic networks. In: 2012 IEEE international conference on Pervasive computing and communications workshops (PERCOM workshops), pp 302–307. IEEE

  11. Kamapantula BK, Abdelzaher A, Ghosh P, Mayo M, Perkins EJ, Das SK (2014) Leveraging the robustness of genetic networks: a case study on bio-inspired wireless sensor network topologies. Journal of Ambient Intelligence and Humanized Computing:1–17

  12. Kamapantula BK, Mayo M, Perkins E, Abdelzaher AF, Ghosh P (2014) Feature ranking in transcriptional networks: packet receipt as a dynamical metric. In: Proceedings of the 8th international conference on bioinspired information and communications technologies, pp 1–8. ICST

  13. Kamapantula BK, Mayo M, Perkins E, Ghosh P (2014) Dynamical impacts from structural redundancy of transcriptional motifs in gene-regulatory networks. In: Proceedings of the 8th international conference on bioinspired information and communications technologies, pp 199–206. ICST

  14. Kitano H (2007) Towards a theory of biological robustness, vol 3

  15. Liu YY, Slotine JJ, Barabási AL (2011) Controllability of complex networks. Nature 473(7346):167–173

    Article  Google Scholar 

  16. Mangan S, Alon U (2003) Structure and function of the feed-forward loop network motif. Proc Natl Acad Sci 100(21):11,980–11,985

    Article  Google Scholar 

  17. Mayo M, Abdelzaher A, Perkins EJ, Ghosh P (2012) Motif participation by genes in e. coli transcriptional networks. Front Physiol 3(00357). doi:10.3389/fphys.2012.00357

  18. McCanne S, Floyd S, Fall K, Varadhan K et al (1997) Network simulator ns-2. http://nsnam.sourceforge.net/wiki/index.php/Main_Page

  19. Pedregosa F, Varoquaux G, Gramfort A, Michel V, Thirion B, Grisel O, Blondel M, Prettenhofer P, Weiss R, Dubourg V, Vanderplas J, Passos A, Cournapeau D, Brucher M, Perrot M, Duchesnay E (2011) Scikit-learn: Machine learning in Python. J Mach Learn Res 12:2825–2830

    MathSciNet  MATH  Google Scholar 

  20. Prill RJ, Iglesias PA, Levchenko A (2005) Dynamic properties of network motifs contribute to biological network organization. PLoS Biol 3(11):e343

    Article  Google Scholar 

  21. Schaffter T, Marbach D, Floreano D (2011) Genenetweaver: in silico benchmark generation and performance profiling of network inference methods. Bioinformatics 27(16):2263– 2270

    Article  Google Scholar 

  22. Shen-Orr S, Milo R, Mangan S, Alon U (2002) Network motifs in the transcriptional regulation network of escherichia coli. Nat Genet 31(1):64–68

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially funded by the US Army’s Environmental Quality and Installations 6.1 basic research program. Opinions, interpretations, conclusions, and recommendations are those of the author(s) and are not necessarily endorsed by the U.S. Army. The work was also partially supported by the NSF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Preetam Ghosh.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kamapantula, B.K., Mayo, M.L., Perkins, E.J. et al. The Structural Role of Feed-Forward Loop Motif in Transcriptional Regulatory Networks. Mobile Netw Appl 21, 191–205 (2016). https://doi.org/10.1007/s11036-016-0708-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-016-0708-6

Keywords

Navigation