Virtual identification of essential proteins within the protein interaction network of yeast

Topological analysis of large scale protein-protein interaction networks (PINs) is important for understanding the organizational and functional principles of individual proteins. The number of interactions that a protein has in a PIN has been observed to be correlated with its indispensability. Essential proteins generally have more interactions than the nonessential ones. We show here that the lethality associated with removal of a protein from the yeast proteome correlates with different centrality measures of the nodes in the PIN, such as the closeness of a protein to many other proteins, or the number of pairs of proteins which need a specific protein as an intermediary in their communications, or the participation of a protein in different protein clusters in the PIN. These measures are significantly better than random selection in identifying essential proteins in a PIN. Centrality measures based on graph spectral properties of the network, in particular the subgraph centrality, show the best performance in identifying essential proteins in the yeast PIN. Subgraph centrality gives important structural information about the role of individual proteins, and permits the selection of possible targets for rational drug discovery through the identification of essential proteins in the PIN.     

Identification of domains and domain interface residues in multidomain proteins from graph spectral method

We present a novel method for the identification of structural domains and domain interface residues in proteins by graph spectral method. This method converts the three-dimensional structure of the protein into a graph by using atomic coordinates from the PDB file. Domain definitions are obtained by constructing either a protein backbone graph or a protein side-chain graph. The graph is constructed based on the interactions between amino acid residues in the three-dimensional structure of the proteins. The spectral parameters of such a graph contain information regarding the domains and subdomains in the protein structure. This is based on the fact that the interactions among amino acids are higher within a domain than across domains. This is evident in the spectra of the protein backbone and the side-chain graphs, thus differentiating the structural domains from one another. Further, residues that occur at the interface of two domains can also be easily identified from the spectra. This method is simple, elegant, and robust. Moreover, a single numeric computation yields both the domain definitions and the interface residues.     

Proteomic traces of speciation

Recent work has shown that the network of structural similarity between protein domains exhibits a power-law distribution of edges per node. The scale-free nature of this graph, termed the protein domain universe graph or PDUG, may be reproduced via a divergent model of structural evolution. The performance of this model, however, does not preclude the existence of a successful convergent model. To further resolve the issue of protein structural evolution, we explore the predictions of both convergent and divergent models directly. We show that when nodes from the PDUG are partitioned into subgraphs on the basis of their occurrence in the proteomes of particular organisms, these subgraphs exhibit a scale-free nature as well. We explore a simple convergent model of structural evolution and find that the implications of this model are inconsistent with features of these organismal subgraphs. Importantly, we find that biased convergent models are inconsistent with our data. We find that when speciation mechanisms are added to a simple divergent model, subgraphs similar to the organismal subgraphs are produced, demonstrating that dynamic models can easily explain the distributions of structural similarity that exist within proteomes. We show that speciation events must be included in a divergent model of structural evolution to account for the non-random overlap of structural proteomes. These findings have implications for the long-standing debate over convergent and divergent models of protein structural evolution, and for the study of the evolution of organisms as a whole.     

Structural distance and evolutionary relationship of networks

Exploring common features and universal qualities shared by a particular class of networks in biological and other domains is one of the important aspects of evolutionary study. In an evolving system, evolutionary mechanism can cause functional changes that forces the system to adapt to new configurations of interaction pattern between the components of that system (e.g. gene duplication and mutation play a vital role for changing the connectivity structure in many biological networks. The evolutionary relation between two systems can be retraced by their structural differences). The eigenvalues of the normalized graph Laplacian not only capture the global properties of a network, but also local structures that are produced by graph evolutions (like motif duplication or joining). The spectrum of this operator carries many qualitative aspects of a graph. Given two networks of different sizes, we propose a method to quantify the topological distance between them based on the contrasting spectrum of normalized graph Laplacian. We find that network architectures are more similar within the same class compared to between classes. We also show that the evolutionary relationships can be retraced by the structural differences using our method. We analyze 43 metabolic networks from different species and mark the prominent separation of three groups: Bacteria, Archaea and Eukarya. This phenomenon is well captured in our findings that support the other cladistic results based on gene content and ribosomal RNA sequences. Our measure to quantify the structural distance between two networks is useful to elucidate evolutionary relationships.     

Network representation of protein interactions: Theory of graph description and analysis

A methodological framework is presented for the graph theoretical interpretation of NMR data of protein interactions. The proposed analysis generalizes the idea of network representations of protein structures by expanding it to protein interactions. This approach is based on regularization of residue‐resolved NMR relaxation times and chemical shift data and subsequent construction of an adjacency matrix that represents the underlying protein interaction as a graph or network. The network nodes represent protein residues. Two nodes are connected if two residues are functionally correlated during the protein interaction event. The analysis of the resulting network enables the quantification of the importance of each amino acid of a protein for its interactions. Furthermore, the determination of the pattern of correlations between residues yields insights into the functional architecture of an interaction. This is of special interest for intrinsically disordered proteins, since the structural (three‐dimensional) architecture of these proteins and their complexes is difficult to determine. The power of the proposed methodology is demonstrated at the example of the interaction between the intrinsically disordered protein osteopontin and its natural ligand heparin.     

Sex‐specific graphs: Relating group‐specific topology to demographic and landscape data

Sex‐specific genetic structure is a commonly observed pattern among vertebrate species. Facing differential selective pressures, individuals may adopt sex‐specific life history traits that ultimately shape genetic variation among populations. Although differential dispersal dynamics are commonly detected in the literature, few studies have used genetic structure to investigate sex‐specific functional connectivity. The recent use of graph theoretic approaches in landscape genetics has demonstrated network capacities to describe complex system behaviours where network topology represents genetic interaction among subunits. Here, we partition the overall genetic structure into sex‐specific graphs, revealing different male and female dispersal dynamics of a fisher (Pekania [Martes] pennanti) metapopulation in southern Ontario. Our analyses based on network topologies supported the hypothesis of male‐biased dispersal. Furthermore, we demonstrated that the effect of the landscape, identified at the population level, could be partitioned among sex‐specific strata. We found that female connectivity was negatively correlated with snow depth, whereas connectivity among males was not. Our findings underscore the potential of conducting sex‐specific analysis by identifying landscape elements or configuration that differentially promotes or impedes functional connectivity between sexes, revealing processes that may otherwise remain cryptic. We propose that the sex‐specific graph approach would be applicable to other vagile species where differential sex‐specific processes are expected to occur.     

Optimized Null Model for Protein Structure Networks

Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by comparing various RIG definitions against a series of network models.     

Edge-count probabilities for the identification of local protein communities and their organization

We present a computational approach based on a local search strategy that discovers sets of proteins that preferentially interact with each other. Such sets are referred to as protein communities and are likely to represent functional modules. Preferential interaction between module members is quantified via an analytical framework based on a network null model known as the random graph with given expected degrees. Based on this framework, the concept of local protein community is generalized to that of community of communities. Protein communities and higher-level structures are extracted from two yeast protein interaction data sets and a network of published interactions between human proteins. The high level structures obtained with the human network correspond to broad biological concepts such as signal transduction, regulation of gene expression, and intercellular communication. Many of the obtained human communities are enriched, in a statistically significant way, for proteins having no clear orthologs in lower organisms. This indicates that the extracted modules are quite coherent in terms of function.     

Chimeragenesis of distantly‐related proteins by noncontiguous recombination

We introduce a method for identifying elements of a protein structure that can be shuffled to make chimeric proteins from two or more homologous parents. Formulating recombination as a graph‐partitioning problem allows us to identify noncontiguous segments of the sequence that should be inherited together in the progeny proteins. We demonstrate this noncontiguous recombination approach by constructing a chimera of β‐glucosidases from two different kingdoms of life. Although the protein's alpha–beta barrel fold has no obvious subdomains for recombination, noncontiguous SCHEMA recombination generated a functional chimera that takes approximately half its structure from each parent. The X‐ray crystal structure shows that the structural blocks that make up the chimera maintain the backbone conformations found in their respective parental structures. Although the chimera has lower β‐glucosidase activity than the parent enzymes, the activity was easily recovered by directed evolution. This simple method, which does not rely on detailed atomic models, can be used to design chimeras that take structural, and functional, elements from distantly‐related proteins.     

Graph identification of proteins in tomograms (GRIP-Tomo)

In this study, we present a method of pattern mining based on network theory that enables the identification of protein structures or complexes from synthetic volume densities, without the knowledge of predefined templates or human biases for refinement. We hypothesized that the topological connectivity of protein structures is invariant, and they are distinctive for the purpose of protein identification from distorted data presented in volume densities. Three-dimensional densities of a protein or a complex from simulated tomographic volumes were transformed into mathematical graphs as observables. We systematically introduced data distortion or defects such as missing fullness of data, the tumbling effect, and the missing wedge effect into the simulated volumes, and varied the distance cutoffs in pixels to capture the varying connectivity between the density cluster centroids in the presence of defects. A similarity score between the graphs from the simulated volumes and the graphs transformed from the physical protein structures in point data was calculated by comparing their network theory order parameters including node degrees, betweenness centrality, and graph densities. By capturing the essential topological features defining the heterogeneous morphologies of a network, we were able to accurately identify proteins and homo-multimeric complexes from 10 topologically distinctive samples without realistic noise added. Our approach empowers future developments of tomogram processing by providing pattern mining with interpretability, to enable the classification of single-domain protein native topologies as well as distinct single-domain proteins from multimeric complexes within noisy volumes.     

Evolution and similarity evaluation of protein structures in contact map space

Prediction of fold from amino acid sequence of a protein has been an active area of research in the past few years, but the limited accuracy of existing techniques emphasizes the need to develop newer approaches to tackle this task. In this study, we use contact map prediction as an intermediate step in fold prediction from sequence. Contact map is a reduced graph-theoretic representation of proteins that models the local and global inter-residue contacts in the structure. We start with a population of random contact maps for the protein sequence and "evolve" the population to a "high-feasibility" configuration using a genetic algorithm. A neural network is employed to assess the feasibility of contact maps based on their 4 physically relevant properties. We also introduce 5 parameters, based on algebraic graph theory and physical considerations, that can be used to judge the structural similarity between proteins through contact maps. To predict the fold of a given amino acid sequence, we predict a contact map that will sufficiently approximate the structure of the corresponding protein. Then we assess the similarity of this contact map with the representative contact map of each fold; the fold that corresponds to the closest match is our predicted fold for the input sequence. We have found that our feasibility measure is able to differentiate between feasible and infeasible contact maps. Further, this novel approach is able to predict the folds from sequences significantly better than a random predictor.     

Automatic domain decomposition of proteins by a Gaussian Network Model

Proteins are often comprised of domains of apparently independent folding units. These domains can be defined in various ways, but one useful definition divides the protein into substructures that seem to move more or less independently. The same methods that allow fairly accurate calculation of motion can be used to help classify these substructures. We show how the Gaussian Network Model (GNM), commonly used for determining motion, can also be adapted to automatically classify domains in proteins. Parallels between this physical network model and graph theory implementation are apparent. The method is applied to a nonredundant set of 55 proteins, and the results are compared to the visual assignments by crystallographers. Apart from decomposing proteins into structural domains, the algorithm can generally be applied to any large macromolecular system to decompose it into motionally decoupled sub-systems.     

A unified representation of multiprotein complex data for modeling interaction networks

The protein interaction network presents one perspective for understanding cellular processes. Recent experiments employing high-throughput mass spectrometric characterizations have resulted in large data sets of physiologically relevant multiprotein complexes. We present a unified representation of such data sets based on an underlying bipartite graph model that is an advance over existing models of the network. Our unified representation allows for weighting of connections between proteins shared in more than one complex, as well as addressing the higher level organization that occurs when the network is viewed as consisting of protein complexes that share components. This representation also allows for the application of the rigorous MinMaxCut graph clustering algorithm for the determination of relevant protein modules in the networks. Statistically significant annotations of clusters in the protein-protein and complex-complex networks using terms from the Gene Ontology indicate that this method will be useful for posing hypotheses about uncharacterized components of protein complexes or uncharacterized relationships between protein complexes.     

From individual Wnt pathways towards a Wnt signalling network

Wnt proteins play important roles during vertebrate and invertebrate development. They obviously have the ability to activate different intracellular signalling pathways. Based on the characteristic intracellular mediators used, these are commonly described as the Wnt/beta-catenin, the Wnt/calcium and the Wnt/Jun N-terminal kinase pathways (also called planar cell polarity pathway). In the past, these different signalling events were mainly described as individual and independent signalling branches. Here, we discuss the possibility that Wnt proteins activate a complex intracellular signalling network rather than individual pathways and suggest a graph representation of this network. Furthermore, we discuss different ways of how to predict the specific outcome of an activation of this network in a particular cell type, which will require the use of mathematical models. We point out that the use of deterministic approaches via the application of differential equations is suitable to model only small aspects of the whole network and that more qualitative approaches are possibly a suitable starting point for the prediction of the global behaviour of such large protein interaction networks.     

Alpha-Helical Protein Networks Are Self-Protective and Flaw-Tolerant

Alpha-helix based protein networks as they appear in intermediate filaments in the cell’s cytoskeleton and the nuclear membrane robustly withstand large deformation of up to several hundred percent strain, despite the presence of structural imperfections or flaws. This performance is not achieved by most synthetic materials, which typically fail at much smaller deformation and show a great sensitivity to the existence of structural flaws. Here we report a series of molecular dynamics simulations with a simple coarse-grained multi-scale model of alpha-helical protein domains, explaining the structural and mechanistic basis for this observed behavior. We find that the characteristic properties of alpha-helix based protein networks are due to the particular nanomechanical properties of their protein constituents, enabling the formation of large dissipative yield regions around structural flaws, effectively protecting the protein network against catastrophic failure. We show that the key for these self protecting properties is a geometric transformation of the crack shape that significantly reduces the stress concentration at corners. Specifically, our analysis demonstrates that the failure strain of alpha-helix based protein networks is insensitive to the presence of structural flaws in the protein network, only marginally affecting their overall strength. Our findings may help to explain the ability of cells to undergo large deformation without catastrophic failure while providing significant mechanical resistance.     

Interaction energy based protein structure networks

The three-dimensional structure of a protein is formed and maintained by the noncovalent interactions among the amino-acid residues of the polypeptide chain. These interactions can be represented collectively in the form of a network. So far, such networks have been investigated by considering the connections based on distances between the amino-acid residues. Here we present a method of constructing the structure network based on interaction energies among the amino-acid residues in the protein. We have investigated the properties of such protein energy-based networks (PENs) and have shown correlations to protein structural features such as the clusters of residues involved in stability, formation of secondary and super-secondary structural units. Further we demonstrate that the analysis of PENs in terms of parameters such as hubs and shortest paths can provide a variety of biologically important information, such as the residues crucial for stabilizing the folded units and the paths of communication between distal residues in the protein. Finally, the energy regimes for different levels of stabilization in the protein structure have clearly emerged from the PEN analysis.     

Review of uses of network and graph theory concepts within proteomics

The size and nature of data collected on gene and protein interactions has led to a rapid growth of interest in graph theory and modern techniques for describing, characterizing and comparing networks. Simultaneously, this is a field of growth within mathematics and theoretical physics, where the global properties, and emergent behavior of networks, as a function of the local properties has long been studied. In this review, a number of approaches for exploiting modern network theory to help describe and analyze different data sets and problems associated with proteomic data are considered. This review aims to help biologists find their way towards useful ideas and references, yet may also help scientists from a mathematics and physics background to understand where they may apply their expertise.     

Comparative genomics and protein domain graph analyses link ubiquitination and RNA metabolism

The human gene parkin, known to cause familial Parkinson disease, as well as several other genes, likely involved in other neurodegenerative diseases or in cancer, encode proteins of the RBR family of ubiquitin ligases. Here, we describe the structural diversity of the RBR family in order to infer their functional roles. Of particular interest is a relationship detected between RBR-mediated ubiquitination and RNA metabolism: a few RBR proteins contain RNA binding domains and DEAH-box RNA helicase domains. Global protein domain graph analyses demonstrate that this connection is not RBR-specific, but instead many other proteins contain both ubiquitination and RNA-related domains. These proteins are present in animals, plants and fungi, suggesting that the link between these two cellular processes is ancient. Our results show that global bioinformatic approaches, involving comparative genomics and domain network analyses, may unearth novel functional relationships involving well-known and thoroughly studied groups of proteins.