Identification of amino acids involved in protein structural uniqueness: implication for de novo protein design

Structural uniqueness is characteristic of native proteins and is essential to express their biological functions. The major factors that bring about the uniqueness are specific interactions between hydrophobic residues and their unique packing in the protein core. To find the origin of the uniqueness in their amino acid sequences, we analyzed the distribution of the side chain rotational isomers (rotamers) of hydrophobic amino acids in protein tertiary structures and derived deltaS(contact), the conformational-entropy changes of side chains by residue-residue contacts in each secondary structure. The deltaS(contact) values indicate distinct tendencies of the residue pairs to restrict side chain conformation by inter-residue contacts. Of the hydrophobic residues in alpha-helices, aliphatic residues (Leu, Val, Ile) strongly restrict the side chain conformations of each other. In beta-sheets, Met is most strongly restricted by contact with Ile, whereas Leu, Val and Ile are less affected by other residues in contact than those in alpha-helices. In designed and native protein variants, deltaS(contact) was found to correlate with the folding-unfolding cooperativity. Thus, it can be used as a specificity parameter for designing artificial proteins with a unique structure.     

Topological determinants of protein unfolding rates

For proteins that fold by two-state kinetics, the folding and unfolding processes are believed to be closely related to their native structures. In particular, folding and unfolding rates are influenced by the native structures of proteins. Thus, we focus on finding important topological quantities from a protein structure that determine its unfolding rate. After constructing graphs from protein native structures, we investigate the relationships between unfolding rates and various topological quantities of the graphs. First, we find that the correlation between the unfolding rate and the contact order is not as prominent as in the case of the folding rate and the contact order. Next, we investigate the correlation between the unfolding rate and the clustering coefficient of the graph of a protein native structure, and observe no correlation between them. Finally, we find that a newly introduced quantity, the impact of edge removal per residue, has a good overall correlation with protein unfolding rates. The impact of edge removal is defined as the ratio of the change of the average path length to the edge removal probability. From these facts, we conclude that the protein unfolding process is closely related to the protein native structure.     

Universal partitioning of the hierarchical fold network of 50-residue segments in proteins

Background  

Several studies have demonstrated that protein fold space is structured hierarchically and that power-law statistics are satisfied in relation between the numbers of protein families and protein folds (or superfamilies). We examined the internal structure and statistics in the fold space of 50 amino-acid residue segments taken from various protein folds. We used inter-residue contact patterns to measure the tertiary structural similarity among segments. Using this similarity measure, the segments were classified into a number (K _c) of clusters. We examined various K _c values for the clustering. The special resolution to differentiate the segment tertiary structures increases with increasing K _c. Furthermore, we constructed networks by linking structurally similar clusters.     

Crystallographic and NMR spectroscopic protein structures: the inter-residue contacts

Inter-residue pair contacts have been analyzed in detail for the four pairs of protein structures determined both by X-ray analysis (X-ray) and nuclear magnetic resonance (NMR). At contact distances < or = 4.0 angstroms in the four NMR structures the overall number of pair contacts are less by 4-9% and pair contacts are in average shorter by 0.02-0.16 angstroms than those in corresponding X-ray structures. In each of four structure pairs 83-94% of common pair contacts are formed by the same residues in both structures and rest 6-17% ones are longer own pair contacts formed by the different residues in the NMR and X-ray structures. The amount of the longer own contacts is higher in the X-ray structure of the pair. In the each NMR structure there are three types of common pair contacts, which are shorter, longer or equal length in comparison with identical pair contacts in the X-ray structure of the same protein. The methodological different shortened common pair contacts predominate in the known distant dependence of the inter-residue contact densities of the 60-61 pair of the NMR/X-ray structure. Among four pairs analyzed the contact shortening proceeds upon the energy minimization of the crambin NMR structure and upon the resolving by the program X-PLOR with decreased atom van der Waals radius of the NMR structures of ubiquitin, hen lysozyme and monomeric hemoglobin. An extent of the NMR contact shortening decreased as the amount of NMR information upon the calculation of the NMR structures increased. Among 60-61 pairs of NMR/X-ray structures the main difference between alpha-helical and beta-structural proteins on the inter-residue distant dependence of the average contact densities arises from the strong alpha/beta difference in the local backbone geometry.     

Inter-residue interactions in protein folding and stability

During the process of protein folding, the amino acid residues along the polypeptide chain interact with each other in a cooperative manner to form the stable native structure. The knowledge about inter-residue interactions in protein structures is very helpful to understand the mechanism of protein folding and stability. In this review, we introduce the classification of inter-residue interactions into short, medium and long range based on a simple geometric approach. The features of these interactions in different structural classes of globular and membrane proteins, and in various folds have been delineated. The development of contact potentials and the application of inter-residue contacts for predicting the structural class and secondary structures of globular proteins, solvent accessibility, fold recognition and ab initio tertiary structure prediction have been evaluated. Further, the relationship between inter-residue contacts and protein-folding rates has been highlighted. Moreover, the importance of inter-residue interactions in protein-folding kinetics and for understanding the stability of proteins has been discussed. In essence, the information gained from the studies on inter-residue interactions provides valuable insights for understanding protein folding and de novo protein design.     

Contact rearrangements form coupled networks from local motions in allosteric proteins

Allosteric proteins bind an effector molecule at one site resulting in a functional change at a second site. We hypothesize that networks of contacts altered, formed, or broken are a significant contributor to allosteric communication in proteins. In this work, we identify which interactions change significantly between the residue-residue contact networks of two allosteric structures, and then organize these changes into graphs. We perform the analysis on 15 pairs of allosteric structures with effector and substrate each present in at least one of the two structures. Most proteins exhibit large, dense regions of contact rearrangement, and the graphs form connected paths between allosteric effector and substrate sites in five of these proteins. In the remaining 10 proteins, large-scale conformational changes such as rigid-body motions are likely required in addition to contact rearrangement networks to account for substrate-effector communication. On average, clusters which contain at least one substrate or effector molecule comprise 20% of the protein. These allosteric graphs are small worlds; that is, they typically have mean shortest path lengths comparable to those of corresponding random graphs and average clustering coefficients enhanced relative to those of random graphs. The networks capture 60-80% of known allostery-perturbing mutants in three proteins, and the metrics degree and closeness are statistically good discriminators of mutant residues from nonmutant residues within the networks in two of these three proteins. For two proteins, coevolving clusters of residues which have been hypothesized to be allosterically important differ from the regions with the most contact rearrangement. Residues and contacts which modulate normal mode fluctuations also often participate in the contact rearrangement networks. In summary, residue-residue contact rearrangement networks provide useful representations of the portions of allosteric pathways resulting from coupled local motions.     

Inter-residue interactions in protein structures exhibit power-law behavior

Inter-residue interactions play an essential role in driving protein folding, and analysis of these interactions increases our understanding of protein folding and stability and facilitates the development of tools for protein structure and function prediction. In this work, we systematically characterized the change of inter-residue interactions at various sequence separation cutoffs using two protein datasets. The first set included 100 diverse, nonredundant and high-resolution soluble protein structures, covering all four major structural classes, all-alpha, alpha/beta, alpha+beta, and all-beta; and the second set included 20 diverse, nonredundant and high-resolution membrane protein structures, representing 19 unique superfamilies. It was shown that the average number of inter-residue interactions in structures of both datasets displays the power-law behavior. Fitting parameters of the power-law function are directly related to the structural classes analyzed. These findings provided further insight into the distribution of short-, medium-, and long-range inter-residue interactions in both soluble and membrane proteins and could be used for protein structure prediction.     

Modularity in the evolution of yeast protein interaction network

Protein interaction networks are known to exhibit remarkable structures: scale-free and small-world and modular structures. To explain the evolutionary processes of protein interaction networks possessing scale-free and small-world structures, preferential attachment and duplication-divergence models have been proposed as mathematical models. Protein interaction networks are also known to exhibit another remarkable structural characteristic, modular structure. How the protein interaction networks became to exhibit modularity in their evolution? Here, we propose a hypothesis of modularity in the evolution of yeast protein interaction network based on molecular evolutionary evidence. We assigned yeast proteins into six evolutionary ages by constructing a phylogenetic profile. We found that all the almost half of hub proteins are evolutionarily new. Examining the evolutionary processes of protein complexes, functional modules and topological modules, we also found that member proteins of these modules tend to appear in one or two evolutionary ages. Moreover, proteins in protein complexes and topological modules show significantly low evolutionary rates than those not in these modules. Our results suggest a hypothesis of modularity in the evolution of yeast protein interaction network as systems evolution.     

Network analysis of intrinsic functional brain connectivity in Alzheimer's disease

Functional brain networks detected in task-free (“resting-state”) functional magnetic resonance imaging (fMRI) have a small-world architecture that reflects a robust functional organization of the brain. Here, we examined whether this functional organization is disrupted in Alzheimer's disease (AD). Task-free fMRI data from 21 AD subjects and 18 age-matched controls were obtained. Wavelet analysis was applied to the fMRI data to compute frequency-dependent correlation matrices. Correlation matrices were thresholded to create 90-node undirected-graphs of functional brain networks. Small-world metrics (characteristic path length and clustering coefficient) were computed using graph analytical methods. In the low frequency interval 0.01 to 0.05 Hz, functional brain networks in controls showed small-world organization of brain activity, characterized by a high clustering coefficient and a low characteristic path length. In contrast, functional brain networks in AD showed loss of small-world properties, characterized by a significantly lower clustering coefficient (p<0.01), indicative of disrupted local connectivity. Clustering coefficients for the left and right hippocampus were significantly lower (p<0.01) in the AD group compared to the control group. Furthermore, the clustering coefficient distinguished AD participants from the controls with a sensitivity of 72% and specificity of 78%. Our study provides new evidence that there is disrupted organization of functional brain networks in AD. Small-world metrics can characterize the functional organization of the brain in AD, and our findings further suggest that these network measures may be useful as an imaging-based biomarker to distinguish AD from healthy aging.     

Structural diversity of protein segments follows a power-law distribution

The local structures of protein segments were classified and their distribution was analyzed to explore the structural diversity of proteins. Representative proteins were divided into short segments using a sliding L-residue window. Each set of local structures consisting of consecutive 1-31 amino acids was classified using a single-pass clustering method. The results demonstrate that the local structures of proteins are very unevenly distributed in the protein universe. The distribution of local structures of relatively long segments shows a power-law behavior that is formulated well by Zipf's law, implying that a protein structure possesses recursive and fractal characteristics. The degree of effective conformational freedom per residue as well as the structure entropy per residue decreases gradually with an increasing value of L and then converges to constant values. This suggests that the number of protein conformations resides within the range between 1.2L and 1.5L and that 10- to 20-residue segments are already proteinlike in terms of their structural diversity.     

Small worlds in RNA structures

I consider conformational spaces of tRNA^phe defined by sets of suboptimal structures from the perspective of small-world networks. Herein, the influence of modifications on typical small-world network properties and the shape of energy landscapes is discussed. Results indicate that natural modifications influence the degree of local clustering and mean path lengths far more than random or no modifications. High frequencies in the thermodynamic ensemble coincide with high numbers of neighboring structures that one conformation can adopt by one elementary move. Conformation spaces indicate the existence of modular substructures. It can be shown that modifications leave the nature of small-world topology untouched albeit natural modifications have a reasonable enhancing and streamlining effect on the degree of clustering and therefore on the substructures of the conformational space.     

Toward an accurate prediction of inter-residue distances in proteins using 2D recursive neural networks

Background

Protein inter-residue contact maps provide a translation and rotation invariant topological representation of a protein. They can be used as an intermediary step in protein structure predictions. However, the prediction of contact maps represents an unbalanced problem as far fewer examples of contacts than non-contacts exist in a protein structure. In this study we explore the possibility of completely eliminating the unbalanced nature of the contact map prediction problem by predicting real-value distances between residues. Predicting full inter-residue distance maps and applying them in protein structure predictions has been relatively unexplored in the past.

Results

We initially demonstrate that the use of native-like distance maps is able to reproduce 3D structures almost identical to the targets, giving an average RMSD of 0.5Å. In addition, the corrupted physical maps with an introduced random error of ±6Å are able to reconstruct the targets within an average RMSD of 2Å. After demonstrating the reconstruction potential of distance maps, we develop two classes of predictors using two-dimensional recursive neural networks: an ab initio predictor that relies only on the protein sequence and evolutionary information, and a template-based predictor in which additional structural homology information is provided. We find that the ab initio predictor is able to reproduce distances with an RMSD of 6Å, regardless of the evolutionary content provided. Furthermore, we show that the template-based predictor exploits both sequence and structure information even in cases of dubious homology and outperforms the best template hit with a clear margin of up to 3.7Å. Lastly, we demonstrate the ability of the two predictors to reconstruct the CASP9 targets shorter than 200 residues producing the results similar to the state of the machine learning art approach implemented in the Distill server.

Conclusions

The methodology presented here, if complemented by more complex reconstruction protocols, can represent a possible path to improve machine learning algorithms for 3D protein structure prediction. Moreover, it can be used as an intermediary step in protein structure predictions either on its own or complemented by NMR restraints.     

Four-body contact potentials derived from two protein datasets to discriminate native structures from decoys

Two-body inter-residue contact potentials for proteins have often been extracted and extensively used for threading. Here, we have developed a new scheme to derive four-body contact potentials as a way to consider protein interactions in a more cooperative model. We use several datasets of protein native structures to demonstrate that around 500 chains are sufficient to provide a good estimate of these four-body contact potentials by obtaining convergent threading results. We also have deliberately chosen two sets of protein native structures differing in resolution, one with all chains' resolution better than 1.5 A and the other with 94.2% of the structures having a resolution worse than 1.5 A to investigate whether potentials from well-refined protein datasets perform better in threading. However, potentials from well-refined proteins did not generate statistically significant better threading results. Our four-body contact potentials can discriminate well between native structures and partially unfolded or deliberately misfolded structures. Compared with another set of four-body contact potentials derived by using a Delaunay tessellation algorithm, our four-body contact potentials appear to offer a better characterization of the interactions between backbones and side chains and provide better threading results, somewhat complementary to those found using other potentials.     

Graph theoretical model of a sensorimotor connectome in zebrafish

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.     

The impacts of network topology on disease spread

Individuals in a population susceptible to a disease may be represented as vertices in a network, with the edges that connect vertices representing social and/or spatial contact between individuals. Networks, which explicitly included six different patterns of connection between vertices, were created. Both scale-free networks and random graphs showed a different response in path level to increasing levels of clustering than regular lattices. Clustering promoted short path lengths in all network types, but randomly assembled networks displayed a logarithmic relationship between degree and path length; whereas this response was linear in regular lattices. In all cases, small-world models, generated by rewiring the connections of a regular lattice, displayed properties, which spanned the gap between random and regular networks.Simulation of a disease in these networks showed a strong response to connectance pattern, even when the number of edges and vertices were approximately equal. Epidemic spread was fastest, and reached the largest size, in scale-free networks, then in random graphs. Regular lattices were the slowest to be infected, and rewired lattices were intermediate between these two extremes. Scale-free networks displayed the capacity to produce an epidemic even at a likelihood of infection, which was too low to produce an epidemic for the other network types. The interaction between the statistical properties of the network and the results of epidemic spread provides a useful tool for assessing the risk of disease spread in more realistic networks.     

A parameterized algorithm for protein structure alignment.

This paper proposes a parameterized polynomial time approximation scheme (PTAS) for aligning two protein structures, in the case where one protein structure is represented by a contact map graph and the other by a contact map graph or a distance matrix. If the sequential order of alignment is not required, the time complexity is polynomial in the protein size and exponential with respect to two parameters D(u)/D(l) and D(c)/D(l), which usually can be treated as constants. In particular, D(u) is the distance threshold determining if two residues are in contact or not, D(c) is the maximally allowed distance between two matched residues after two proteins are superimposed, and D(l) is the minimum inter-residue distance in a typical protein. This result clearly demonstrates that the computational hardness of the contact map based protein structure alignment problem is related not to protein size but to several parameters modeling the problem. The result is achieved by decomposing the protein structure using tree decomposition and discretizing the rigid-body transformation space. Preliminary experimental results indicate that on a Linux PC, it takes from ten minutes to one hour to align two proteins with approximately 100 residues.     

Small-world networks decrease the speed of Muller's ratchet

Muller's ratchet is an evolutionary process that has been implicated in the extinction of asexual species, the evolution of non-recombining genomes, such as the mitochondria, the degeneration of the Y chromosome, and the evolution of sex and recombination. Here we study the speed of Muller's ratchet in a spatially structured population which is subdivided into many small populations (demes) connected by migration, and distributed on a graph. We studied different types of networks: regular networks (similar to the stepping-stone model), small-world networks and completely random graphs. We show that at the onset of the small-world network - which is characterized by high local connectivity among the demes but low average path length - the speed of the ratchet starts to decrease dramatically. This result is independent of the number of demes considered, but is more pronounced the larger the network and the stronger the deleterious effect of mutations. Furthermore, although the ratchet slows down with increasing migration between demes, the observed decrease in speed is smaller in the stepping-stone model than in small-world networks. As migration rate increases, the structured populations approach, but never reach, the result in the corresponding panmictic population with the same number of individuals. Since small-world networks have been shown to describe well the real contact networks among people, we discuss our results in the light of the evolution of microbes and disease epidemics.     

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.     

Altered small-world,functional brain networks in patients with lower back pain

In this study, we aimed to investigate the functional network changes that occur in patients with lower back pain(LBP). We also investigated the link between LBP and the small-world properties of functional networks within the brain. Functional MRI(fMRI) was performed on 20 individuals with LBP and 17 age and gender-matched normal controls during the resting state. The severity of the pain in the individuals with LBP ranged from 5 to 8 on a 0–10 scale, with 0 indicating no pain. Network-based statistics were performed to investigate the differences between the brain networks of individuals with LBP and those of normal controls. Several small-world parameters of brain networks were calculated, including the clustering coefficient, characteristic path length, local efficiency, and global efficiency. These criteria reflect the overall network efficiency. The brain networks in the individuals with LBP due to herniation of a lumbar disc demonstrated a significantly longer characteristic path length as well as a lower clustering coefficient, global efficiency, and local efficiency compared to those in control subjects. We found that LBP patients tended to have unstable and inefficient brain networks when compared with healthy controls. In addition, LBP individuals showed significantly decreased functional connectivity in the anterior cingulate cortex, middle cingulate cortex, post cingulate cortex, inferior frontal gyrus, middle temporal gyrus, occipital gyrus, postcentral gyrus, precentral gyrus, supplementary motor area, thalamus, fusiform, caudate, and cerebellum. We believe that these regions may be involved in the pathophysiology of lower back pain.     

Abnormal cortical networks in mild cognitive impairment and Alzheimer's disease

Recently, many researchers have used graph theory to study the aberrant brain structures in Alzheimer's disease (AD) and have made great progress. However, the characteristics of the cortical network in Mild Cognitive Impairment (MCI) are still largely unexplored. In this study, the gray matter volumes obtained from magnetic resonance imaging (MRI) for all brain regions except the cerebellum were parcellated into 90 areas using the automated anatomical labeling (AAL) template to construct cortical networks for 98 normal controls (NCs), 113 MCIs and 91 ADs. The measurements of the network properties were calculated for each of the three groups respectively. We found that all three cortical networks exhibited small-world properties and those strong interhemispheric correlations existed between bilaterally homologous regions. Among the three cortical networks, we found the greatest clustering coefficient and the longest absolute path length in AD, which might indicate that the organization of the cortical network was the least optimal in AD. The small-world measures of the MCI network exhibited intermediate values. This finding is logical given that MCI is considered to be the transitional stage between normal aging and AD. Out of all the between-group differences in the clustering coefficient and absolute path length, only the differences between the AD and normal control groups were statistically significant. Compared with the normal controls, the MCI and AD groups retained their hub regions in the frontal lobe but showed a loss of hub regions in the temporal lobe. In addition, altered interregional correlations were detected in the parahippocampus gyrus, medial temporal lobe, cingulum, fusiform, medial frontal lobe, and orbital frontal gyrus in groups with MCI and AD. Similar to previous studies of functional connectivity, we also revealed increased interregional correlations within the local brain lobes and disrupted long distance interregional correlations in groups with MCI and AD.