Motifs Enable Communication Efficiency and Fault-Tolerance in Transcriptional Networks

Analysis of the topology of transcriptional regulatory networks (TRNs) is an effective way to study the regulatory interactions between the transcription factors (TFs) and the target genes. TRNs are characterized by the abundance of motifs such as feed forward loops (FFLs), which contribute to their structural and functional properties. In this paper, we focus on the role of motifs (specifically, FFLs) in signal propagation in TRNs and the organization of the TRN topology with FFLs as building blocks. To this end, we classify nodes participating in FFLs (termed motif central nodes) into three distinct roles (namely, roles A, B and C), and contrast them with TRN nodes having high connectivity on the basis of their potential for information dissemination, using metrics such as network efficiency, path enumeration, epidemic models and standard graph centrality measures. We also present the notion of a three tier architecture and how it can help study the structural properties of TRN based on connectivity and clustering tendency of motif central nodes. Finally, we motivate the potential implication of the structural properties of motif centrality in design of efficient protocols of information routing in communication networks as well as their functional properties in global regulation and stress response to study specific disease conditions and identification of drug targets

Control of complex networks requires both structure and dynamics

The study of network structure has uncovered signatures of the organization of complex systems. However, there is also a need to understand how to control them; for example, identifying strategies to revert a diseased cell to a healthy state, or a mature cell to a pluripotent state. Two recent methodologies suggest that the controllability of complex systems can be predicted solely from the graph of interactions between variables, without considering their dynamics: structural controllability and minimum dominating sets. We demonstrate that such structure-only methods fail to characterize controllability when dynamics are introduced. We study Boolean network ensembles of network motifs as well as three models of biochemical regulation: the segment polarity network in Drosophila melanogaster, the cell cycle of budding yeast Saccharomyces cerevisiae, and the floral organ arrangement in Arabidopsis thaliana. We demonstrate that structure-only methods both undershoot and overshoot the number and which sets of critical variables best control the dynamics of these models, highlighting the importance of the actual system dynamics in determining control. Our analysis further shows that the logic of automata transition functions, namely how canalizing they are, plays an important role in the extent to which structure predicts dynamics.Comment: 15 pages, 6 figure

Computational identification of transcriptional regulatory elements in DNA sequence

Identification and annotation of all the functional elements in the genome, including genes and the regulatory sequences, is a fundamental challenge in genomics and computational biology. Since regulatory elements are frequently short and variable, their identification and discovery using computational algorithms is difficult. However, significant advances have been made in the computational methods for modeling and detection of DNA regulatory elements. The availability of complete genome sequence from multiple organisms, as well as mRNA profiling and high-throughput experimental methods for mapping protein-binding sites in DNA, have contributed to the development of methods that utilize these auxiliary data to inform the detection of transcriptional regulatory elements. Progress is also being made in the identification of cis-regulatory modules and higher order structures of the regulatory sequences, which is essential to the understanding of transcription regulation in the metazoan genomes. This article reviews the computational approaches for modeling and identification of genomic regulatory elements, with an emphasis on the recent developments, and current challenges

Systematic prediction of feedback regulatory network motifs

Comprendre le câblage complexe de la régulation cellulaire reste un défi des plus redoutables.Les connaissances fondamentales sur le câblage et le fonctionnement du réseau d’homéostasiedes protéines aideront à mieux comprendre comment l’homéostasie des protéines échouedans les maladies et comment les modèles de régulation du réseau d’homéostasie desprotéines peuvent être ciblés pour une intervention thérapeutique. L’étude vise à développeret à appliquer une nouvelle méthodologie de calcul pour l’identification systématique etla caractérisation des systèmes de rétroaction en homéostasie des protéines. La rechercheproposée combine des idées et des approches issues de la science des protéines, de la biologiedes systèmes de levure, de la biologie computationnelle et de la biologie des réseaux.La difficulté dans la tâche d’incorporer des données multi-plateformes multi-omiques estamplifiée par le vaste réseau de gènes, protéines et métabolites interconnectés qui seréunissent pour remplir une fonction spécifique. Pour ma thèse de maîtrise, j’ai développéun algorithme PBPF (Path-Based Pattern Finding), qui recherche et énumère les motifsde réseau de la topologie requise. Il s’agit d’un algorithme basé sur la théorie des graphesqui utilise la combinaison d’une méthode transversale de profondeur et d’une méthodede recherche par largeur ensuite pour identifier les topologies de sous-graphes de réseaurequises. En outre, le fonctionnement de l’algorithme a été démontré dans les domainesde l’homéostasie des protéines chezSaccharomyces cerevisiae. Une approche systématiqued’intégration des données de la biologie des systèmes a été orchestrée, qui montre l’iden-tification systématique de motifs de rétroaction régulatrice connus dans l’homéostasie desprotéines. Il revendique fortement la capacité d’identifier de nouveaux motifs de rétroactionréglementaire envahissants. L’application de l’algorithme peut être étendue à d’autressystèmes biologiques, par exemple, pour identifier des motifs de rétroaction spécifiques àl’état cellulaire dans le cas de cellules souches.Understanding the intricate wiring of cellular regulation remains a most formidable chal-lenge. The fundamental insights into the wiring and functioning of the protein homeostasisnetwork will help to better understand how protein homeostasis fails in diseases and howthe regulatory patterns of protein homeostasis network can be targeted for therapeuticintervention. The study aims at developing and applying novel computational methodologyfor the systematic identification and characterization of feedback systems in proteinhomeostasis. The proposed research combines ideas and approaches from protein science,yeast systems biology, computational biology, as well as network biology. The difficultyin the task of incorporating multi-platform multi-omics data is amplified by the largenetwork of inter-connected genes, proteins and metabolites that come together to perform aspecific function. For my master’s thesis, I developed a path-based pattern finding (PBPF)algorithm, which searches and enumerates network motifs of required topology. It is a graphtheory based algorithm which utilizes the combination of depth-first transverse method andbreadth-first search method to identify the required network sub-graph topologies. Further,the functioning of the algorithm has been demonstrated in the realms of protein homeostasisinSaccharomyces cerevisiae. A systematic approach of integration of systems biologydata has been orchestrated, which shows the systematic identification of known regulatoryfeedback motifs in protein homeostasis. It claims the unique ability to identify novelpervasive regulatory feedback motifs. The application of the algorithm can be extended toother biological systems, for example, to identify cell-state specific feedback motifs in caseof stem-cells

GBNet: Deciphering regulatory rules in the co-regulated genes using a Gibbs sampler enhanced Bayesian network approach

<p>Abstract</p> <p>Background</p> <p>Combinatorial regulation of transcription factors (TFs) is important in determining the complex gene expression patterns particularly in higher organisms. Deciphering regulatory rules between cooperative TFs is a critical step towards understanding the mechanisms of combinatorial regulation.</p> <p>Results</p> <p>We present here a Bayesian network approach called GBNet to search for DNA motifs that may be cooperative in transcriptional regulation and the sequence constraints that these motifs may satisfy. We showed that GBNet outperformed the other available methods in the simulated and the yeast data. We also demonstrated the usefulness of GBNet on learning regulatory rules between YY1, a human TF, and its co-factors. Most of the rules learned by GBNet on YY1 and co-factors were supported by literature. In addition, a spacing constraint between YY1 and E2F was also supported by independent TF binding experiments.</p> <p>Conclusion</p> <p>We thus conclude that GBNet is a useful tool for deciphering the "grammar" of transcriptional regulation.</p