Arun Krishnan

The architectural organization of protein structures has been the focus of intense research since it can hopefully lead to an understanding of how proteins fold. In earlier works we had attempted to identify the inherent structural organization in proteins through a study of protein topology. We obtained a modular partitioning of protein structures with the modules correlating well with experimental evidence of early folding units or “foldons”. Residues that connect different modules were shown to be those that were protected during the transition phase of folding. In this work, we follow the topological path of ubiquitin through molecular dynamics unfolding simulations. We observed that the use of recurrence quantification analysis (RQA) could lead to the identification of the transition state during unfolding. Additionally, our earlier contention that the modules uncovered through our graph partitioning approach correlated well with early folding units was vindicated through our simulations. Moreover, residues identified from native structure as connector hubs and which had been shown to be those that were protected during the transition phase of folding were indeed more stable (less flexible) well beyond the transition state. Further analysis of the topological pathway suggests that the all pairs shortest path in a protein is minimized during folding. We observed that treating a protein native structure as a network by having amino acid residues as nodes and the non-covalent interactions among them as links allows for the rationalization of many aspects of the folding process. The possibility to derive this information directly from 3D structure opens the way to the prediction of important residues in proteins, while the confirmation of the minimization of APSP for folding allows for the establishment of a potentially useful proxy for kinetic optimality in the validation of sequence-structure predictions.

The structural architecture of proteins continues to be an area of active research. Despite the difference in models dealing with the way proteins fold into their tertiary structures, it is recognized that small regions of proteins tend to fold independently and are then stabilized by interactions between these distinct subunits. However, there are a number of different definitions of what comprises an independent subunit. In the belief that an unequivocal definition of a domain must be based on the most fundamental property of protein 3D structure, namely, the adjacency matrix of inter-residues contact, we adopt a network representation of the protein. In this work, we used a well-established, global method for identifying modules in networks, without any specific reference to the kind of network being analyzed. The algorithm converges toward the maximization of the modularity of the given protein network and, in doing so, allows the representation of the residues of the protein in terms of their intramodule degree, z, and participation coefficient, P. We demonstrate that the labeling of residues in terms of these invariants allows for information-rich representations of the studied proteins as well as to sketch a new way to link sequence, structure, and the dynamical properties of proteins. We discovered a strong invariant character of protein molecules in terms of P/z characterization, pointing to a common topological design of all protein structures. This invariant representation, applied to different protein systems, enabled us to identify the possible functional role of high P/z residues during the folding process. Additionally, we observe a hierarchical behavior of protein structural organization that provides a sequence-secondary-tertiary structure link. The discovery of similar and repeatable scaling laws at different level of definitions going from hydrophobicity patterning along the sequence up to the size of an autonomous folding unit (AFU) and general contact distribution of the entire molecule suggest a hierarchical-like behavior of protein architecture. This implies the possibility to select different privileged scales of observation for deriving useful information on protein systems. Keywords: proton topology • protein networks • autonomous folding units • protein folding • residue centrality • modules • protein structure graphs

Gene Regulatory Networks (GRNs) have become a major focus of interest in recent years. A number of reverse engineering approaches have been developed to help uncover the regulatory networks giving rise to the observed gene expression profiles. However, this is an overspecified problem due to the fact that more than one genotype (network wiring) can give rise to the same phenotype. We refer to this phenomenon as “gene elasticity.” In this work, we study the effect of this particular problem on the pure, data-driven inference of gene regulatory networks. We simulated a four-gene network in order to produce “data” (protein levels) that we use in lieu of real experimental data. We then optimized the network connections between the four genes with a view to obtain the original network that gave rise to the data. We did this for two different cases: one in which only the network connections were optimized and the other in which both the network connections as well as the kinetic parameters (given as reaction probabilities in our case) were estimated. We observed that multiple genotypes gave rise to very similar protein levels. Statistical experimentation indicates that it is impossible to differentiate between the different networks on the basis of both equilibrium as well as dynamic data. We show explicitly that reverse engineering of GRNs from pure expression data is an indeterminate problem. Our results suggest the unsuitability of an inferential, purely data-driven approach for the reverse engineering transcriptional networks in the case of gene regulatory networks displaying a certain level of complexity.