Abundance of connected motifs in transcriptional networks, a case study using random forests regression

Biological network topologies are known to be robust despite internal and external perturbances. Motifs such as feed-forward loop and bifan have been marked to contribute to structural and functional significance. While network characteristics such as network density, average shortest path, and centrality measures etc., have been well studied, modular characteristics have not been explored in similar detail. Motif connectivity might play a major role in regulation under high perturbations. Connected motif abundance can skew network robustness as well. To test this hypothesis, we study the significance of the two connected feed-forward loop motifs using random forest regression modeling. We define thirty eight network features, fifteen of which are static and dynamic features and the other twenty three are two feed-forward loop connected motif features. We identify significant features among these using random forests regression and create models that can be used to train and predict the robustness of the biological networks. The performance of these models is measured using coefficient of determination metric and the significance of the features themselves is characterized using feature importance. Our experiments reveal that connected feed-forward loop motifs do not contribute to the robustness of network when models are created with all 38 features. For models with only connected motif features, the performance of a specific rhombus motif under high loss stands out.

[1]  Sajal K. Das,et al.  Principles of genomic robustness inspire fault-tolerant WSN topologies: A network science based case study , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[2]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[3]  Dario Floreano,et al.  GeneNetWeaver: in silico benchmark generation and performance profiling of network inference methods , 2011, Bioinform..

[4]  Paolo Tieri,et al.  Network, degeneracy and bow tie. Integrating paradigms and architectures to grasp the complexity of the immune system , 2010, Theoretical Biology and Medical Modelling.

[5]  Preetam Ghosh,et al.  Feature ranking in transcriptional networks: Packet receipt as a dynamical metric , 2014, BICT.

[6]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[7]  Leo Breiman,et al.  Random Forests , 2001, Machine Learning.

[8]  Gaël Varoquaux,et al.  Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..

[9]  S. Mangan,et al.  Structure and function of the feed-forward loop network motif , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Sajal K. Das,et al.  Performance of wireless sensor topologies inspired by E. coli genetic networks , 2012, 2012 IEEE International Conference on Pervasive Computing and Communications Workshops.

[11]  Chih-Jen Lin,et al.  A Practical Guide to Support Vector Classication , 2008 .

[12]  J. A. Peña,et al.  Estimating the Estrada index , 2007 .

[13]  Guido van Rossum,et al.  Python Programming Language , 2007, USENIX Annual Technical Conference.

[14]  Preetam Ghosh,et al.  Dynamical impacts from structural redundancy of transcriptional motifs in gene-regulatory networks , 2014, BICT.

[15]  Hanghang Tong,et al.  Make It or Break It: Manipulating Robustness in Large Networks , 2014, SDM.

[16]  Sajal K. Das,et al.  Leveraging the robustness of genetic networks: a case study on bio-inspired wireless sensor network topologies , 2014, J. Ambient Intell. Humaniz. Comput..

[17]  Uri Alon,et al.  Evolution of Bow-Tie Architectures in Biology , 2014, PLoS Comput. Biol..

[18]  Michael R. Fellows,et al.  Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs , 2007, ICALP.