Toward an accurate prediction of inter-residue distances in proteins using 2D recursive neural networks
© Kukic et al.; licensee BioMed Central Ltd. 2014
Received: 28 January 2013
Accepted: 20 December 2013
Published: 10 January 2014
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.
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.
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.
KeywordsDistance map Recursive neural network ab initio predictor Template-based predictor
The ability to correlate the function of a protein and its three-dimensional (3D) structure is a challenge of fundamental importance in computational biology. However, deciphering this structure-function relationship requires the availability of much more structural data than experimental methods can currently provide. The lack of structural data, in contrast to the wealth of existing proteins sequences [1–3], has been addressed in the last three decades by constructing different computational models for predicting protein 3D structures from primary amino acid sequence information.
Existing structure prediction models are typically divided into two broad categories: template-based and ab initio. Template-based models utilize sequence and structure similarity between an unknown protein, the so-called ‘target’ , and known structures, termed ‘templates’ , fathomed to be homologous to the target. This category of models has become increasingly accurate in predicting the structures of globular proteins over the last years [4–6]. However, the accuracy of template-based models strongly relies on the degree of similarity between the target and its templates, thus preventing its application to a significant fraction of unannotated proteins. On the contrary, the ab initio models are usually employed for proteins that have no detectable homology to proteins of known structure and therefore these models are not nearly as accurate as their template-based counterparts [4–6]. However, the most prevalent ab initio models still utilize known protein structures to some degree, i.e. small structural fragments with the strong sequence-structure relationship . As such, structural fragments are used as building blocks in reconstructing the complete structure of the target protein. This process is typically governed by the use of statistical constraints , force fields  and/or NMR spectra . Only recently, models that use only evolutionary constraints have emerged [10, 11].
In the absence of a reliable solution to the protein structure prediction problem, some research groups have focused on solving simplified problems such as the prediction of protein structural features [12–14]. The most frequently predicted structural features are: protein secondary structure, relative solvent accessibility, contact density and contact maps. Once these protein features have been obtained, they can be used to guide the reconstruction process implemented by a simple geometric-based algorithm . Among protein structural features, contact maps have been proposed as an intermediate step in assembling the unknown protein 3D structure from its amino acid sequence [16–22]. Contact maps are usually predicted in binary form, i.e. they contain information about the mutual contact/non-contact between a pair of residues or atoms, where a contact is defined according to some distance cut-off criterion. Even though contact maps do not contain all information about a protein, such as chirality, they do provide a good overall topology of the protein structure. In fact, it has been argued that a contact map with an adequate threshold for a contact provides sufficient information to reconstruct native or near-native structure . Beyond the prediction of protein structures, protein contact maps have been also used in a number of other structural tasks, for instance as protein fingerprints for rapid prediction of protein structures similarity [23–25], in the prediction of protein folding rates , protein disorder  and inter-domain contact regions .
The prediction of contact maps represents an unbalanced problem as far fewer examples of contacts than non-contacts exist in a protein structure. Therefore, it is not surprising that the prediction accuracy of contact maps is still low despite years of attempts . To mitigate the unbalanced nature of contact/non-contact predictions, a method that predicts 4-class distance maps has recently been introduced . The 4-class distance map has been shown to improve both the residue contact prediction and the Cα-trace reconstruction compared to its binary counterpart .
In this study we explore the possibility of completely eliminating the unbalanced nature of the contact map prediction problem by predicting real-value distances rather than contacts. In particular, we predict an inter-residue distance map, i.e. a 2D symmetric matrix whose entry (i, j) represents the distance between residues i and j along the protein sequence. Unlike binary and multi-class contact maps where classifying distances into a few states is somewhat arbitrary, a distance map contains real distances between protein residues. As a consequence, not only is the unbalanced nature of the contact prediction eliminated, but also the poor approximation of those distances in the vicinity of the class boundaries.
The possibility of predicting inter-residue distances has been relatively unexplored in the past. To our knowledge, only a few studies concerning inter-residue distances exist in the literature where a limited number of distance restraints have been predicted [31, 32] or only an inter-residue distance distribution has been studied [33, 34]. Here, for the first time, we explore the possibility of predicting full inter-residue distance maps. In the first part of this study, we examine the ability of native distance maps to reconstruct near native protein structures. We show that native distance maps give rise to more accurate Cα-traces than native multi-class and binary contact maps even when a random error of 6Å is added to the maps. Then, we describe two classes of predictors developed here that are based on two-dimensional recursive neural networks (2D RNN): an ab initio predictor, which relies only on the protein sequence and evolutionary information, and a template-based predictor in which additional structural homology information is provided. In addition, we report on the average RMSD between the native and predicted distance maps obtained as outputs of the ab initio and template-based predictors. In the final part of this study, we test the two predictors in reconstructing protein structures of the CASP9 targets and briefly gauge the quality of the reconstructed traces.
Reconstruction of Cα-traces using native contact and distance maps
Our first question in this study is concerned with the ability of distance maps to adequately reconstruct Cα-traces. With this in mind, we use native maps extracted from 93 solved 3D structures of the CASP7 targets. The CASP7 targets represent an ideal dataset for this purpose due to their intermediate length (the average number of residues per structure of 192 with 85% of structures consisting of 100 to 300 residues) and the variety of protein structural motifs they include. As a reconstruction protocol we use a simple procedure described in detail within the Methods section. Using this reconstruction procedure we only enforce the constraints encoded in the map and very basic geometrical rules, such as the distances between neighbouring Cα atoms, the geometry of α-helices and β-strand lengths. As a corollary, any improvement in reconstruction results using distance over coarse maps derive from the wealth of structural constraints encoded in the distance maps compared to their coarse counterparts.
In the following, we compare the quality of reconstructions based on binary, 4-class and distance maps when experimental constraints are known, that is the maps are native. Binary contact maps are provided with a distance cut-off of 12Å between a contact and a non-contact. Even though a threshold of 8Å is commonly used in the CASP experiments , the results of a 12Å threshold are presented here, as this threshold leads to more accurate reconstructions in our tests, in agreement with the conclusions from in [30, 36]. The 4-class maps are identical to those in  and include three threshold values: 8Å, 13Å and 19Å.
Reconstruction of C α -traces from native and non-native maps
4.38 (0.90, 14.98)
0.72 (0.42, 0.96)
0.77 (0.29, 0.97)
Binary ± 3Å
4.05 (1.50, 12.44)
0.64 (0.36, 0.82)
0.74 (0.42, 0.90)
Binary ± 6Å
4.26 (2.54, 9.78)
0.53 (0.32, 0.67)
0.64 (0.29, 0.78)
1.04 (0.47, 6.90)
0.94 (0.73, 1.00)
0.95 (0.79, 0.98)
4-Class ± 3Å
1.41 (0.88, 6.80)
0.85 (0.67, 0.93)
0.90 (0.72, 0.96)
4-Class ± 6Å
2.25 (1.53, 4.08)
0.70 (0.56, 0.81)
0.81 (0.57, 0.88)
0.48 (0.22, 0.87)
0.99 (0.94, 1.00)
0.99 (0.94, 0.998)
Distance ± 3Å
0.96 (0.66, 1.46)
0.92 (0.85, 0.98)
0.94 (0.73, 0.99)
Distance ± 6Å
1.62 (1.03, 4.20)
0.81 (0.57, 0.88)
0.87 (0.48, 0.96)
If more distance constraints are provided to the simple reconstruction algorithm, it is expected that more accurate structural predictions would follow. Therefore, it is not surprising that the reconstruction based on the native binary maps produces structures of the lowest quality, with an average RMSD of 4.38Å, a GDT_TS of 72% and a TM-score of 0.77 (Table 1). Native 4-class maps include more distance constraints than their binary counterparts and lead to structures with an average RMSD of 1.04Å, a GDT_TS of 94% and a TM-score of 0.95. Finally, the reconstruction based on the native distance maps that encode the real-value inter-residue distances is able to reproduce even more accurate structures having an average RMSD of only 0.48Å, a GDT_TS of 99% and a TM-score of 0.99. The main problem experienced by the binary and 4-class contact maps in reconstructing the near-native structures is observed in the proteins with structurally disordered segments, e.g. the long coils in a 250-residue structure of the T0381 target, PDB ID: 2I2A (RMSD4-class = 6.9Å, RMSDbinary = 14.6Å) and a 100-residue structure of the T0309 target, PDB ID: 2H4O (RMSD4-class = 2.5Å, RMSDbinary = 12.0Å). On the other hand, the reconstruction protocol with distance maps is able to reproduce the two structures with an RMSD of 0.5Å and 0.4Å, respectively. Furthermore, the reconstruction protocol and the distance maps of all other structures give consistent results with an RMSD being in the narrow range between 0.22Å and 0.87Å.
A non-native distance map conveys more structural information than its coarse counterparts and, thus, is expected to convey more errors at the same time. Therefore, in the following we set out to investigate the impact of distance constraints with various degrees of errors on the used geometric reconstruction protocol. To this end we generate binary, 4-class and distance native maps with a random error of ±3Å and ±6Å for the same CASP7 targets, and further use them in the reconstruction protocol (Table 1). When an error of ±3Å is added to the maps, the accuracy of the reproduced structures decreases slightly using all of the three map types. Distance maps still produce the best reconstruction results (RMSD = 0.96Å, GDT_TS = 92%, TM-score = 0.94), followed by 4-class maps (RMSD =1.41Å, GDT_TS = 85%, TM-score = 0.9) and binary maps (RMSD = 4.05Å, GDT_TS = 64%, TM-score = 0.74). Here, it is interesting to point out that the lowest RMSD in the dataset always deteriorates when the error is included in the maps, whereas the largest RMSD value in the dataset and the mean RMSD can even improve. On the other hand, the corresponding values of GDT_TS and TM-score (max, min and mean values) almost always deteriorate with an increase of the error. This confirms that for low accuracy models RMSD is no longer a meaningful measure of the quality of the models and GDT_TS and TM-score should therefore be given precedence.
Finally, we increase a random error to ±6Å and calculate the accuracy of the reconstructions. As expected, the accuracy of the reconstructed structures decreases further, but the folds in most structures remain essentially the same. Even with an error as large as ±6Å, distance maps still yield more accurate structures than 4-class and binary maps. Specifically, distance maps produce structures with an average RMSD of 1.62Å, a GDT_TS of 81% and a TM-score of 0.87; 4-class maps produce structures with an average RMSD of 2.25Å, a GDT_TS of 70% and a TM-score of 0.81; binary maps produce structures with an average RMSD of 4.26Å, a GDT_TS of 53% and a TM-score of 0.64. Even though distance maps and 4-class maps with a ±6Å error are still able to reproduce accurate folds for the proteins, the possible application of these models in structural studies is more limited beyond this level of error.
Distance map prediction
We construct here two classes of models, a template-based and an ab initio model. To dissect the importance of evolutionary information on preserving inter-residue distances in homologous proteins, we also compare ab initio models that utilize various types of amino acid information. In particular, we compare performances of the ‘classical’ model which encodes the common 20 types of amino acids, the ‘complementarity’ model restricted only to seven classes of amino acids playing a crucial role in the stability of a protein fold (Methods), and the ‘correlation’ model where amino acid information is augmented by the correlated mutation signal extracted from multiple sequence alignments (MSAs). The correlation model provides the most informative statistics among the three ab initio models, and therefore it is expected to outperform the other two. The template-based model is expected to perform substantially better than the ab initio models when reliable templates are available, i.e. templates with more than 25-30% sequence identity to the query. All models are trained using a dataset containing 3,645 proteins shorter than 200 residues, described in detail in the Methods section. The models are then tested using a 5-fold cross validation and results obtained are listed in the following.
Performance of the distance map algorithm
Seq. id [%]
If one focuses on the value of RMSD between native and predicted distances averaged for all residue pairs in the test dataset (given in brackets in Table 2) and the value of RMSD averaged on a protein level (given without brackets in Table 2), it is obvious that distance-based RMSDs are slightly higher than the corresponding protein-based RMSDs for all levels of sequence identity. This is a consequence of the fact that the prediction capability of the algorithm deteriorates when the length of the protein sequence increases.
We also report in Table 2 the performances of the three ab initio models with different contents of leveraged evolutionary information: the classical, the complementarity and the correlation models. According to Table 2, the performances of all three models are undistinguishable and produce an average RMSD of: 5.85Å, 5.85Å and 5.90Å, respectively. Furthermore, the models are also tied for every level of sequence similarity implying that the evolutionary information in terms of classes of amino acids with different physicochemical properties provides sufficient information in predicting inter-residue distances using this machine learning approach.
According to Figures 3a-c it is evident that distances between neighbouring residues in sequence are predicted more accurately than distances between residues far away in the sequence. In particular, the ab initio model produces an overall RMSD of 3.9Å for residues with sequence separation between 6 and 11, an overall RMSD of 5.9Å for residues with sequence separation between 12 and 23, and an overall RMSD of 7.3Å for residues separated by more than 24 amino acids in the sequence. The template-based model improves overall RMSD down to 2.6Å for residues with sequence separation between 6 and 11, to 4.3Å for residues with sequence separation between 12 and 23, and to 6.0Å for residues separated by more than 24 amino acids in the sequence. Moreover, if we compare the performances of the models depending on the sequence identity to the best template, then it is evident that the template-based model outperforms its ab initio counterpart for almost all sequence identity ranges and sequence separations. The results between the models are only comparable when the sequence identity to a query is [0, 10%) with the residues being 6 to 11 positions apart, and when the sequence identity to a query is [10, 20%) with the residues more than 24 positions apart in the sequence.
The template-based model
Performance for non-template regions
Seq. id [%]
Performance for template-covered regions
Seq. id [%]
According to Table 4, the overall RMSD obtained using the template-based prediction of distances is 3.7Å, and represents a 1.4Å (0.4Å) improvement over to the best template (the weighted baseline) model. If the available best template is of a high quality (more than 50% of sequence identity), then the predictions between the models become comparable, with the baseline model performing slightly better by increasing the sequence identity. On the other hand, in both the so-called twilight [20, 30%) and midnight zone [0, 20%) of sequence identity, where it is particularly hard to extract information from the templates, the template-based model outperforms the best template hit with a clear margin of up to 3.7Å, and the weighted average model with a clear margin of up to 1.2Å.
Modelling protein structures using distance maps and CASP9 targets
In the final part of this study we examine the possible application of the template-based and the ab initio models of distance maps in the reconstruction of 3D protein structures. To this end, we incorporate the procedure for distance map prediction into a structure prediction pipeline given in Figure 1. The prediction pipeline is modular and includes three steps. In the first step evolutionary information leveraged from the MSA is used to predict several structural features and to generate PDB templates. Among the structural features secondary structure classes (α-helix, β-strand, coil), relative solvent accessibility (surface exposed, buried residue) and reside contacts are predicted. Predictors of the structural features are based on the class of neural networks called bidirectional recurrent neural networks (BRNNs), explained elsewhere [13, 41–45]. In the second step, the template-based and the ab initio predictor developed in this study are implemented. The predicted distance map output from this step represents a topological representation of the protein 3D structure. Finally, in the last step the actual 3D coordinates of the protein atoms are reconstructed using the restraints provided by the distance map and the basic geometrical rules .
Reconstruction of CASP 9 targets
0.61 (0.11, 0.97)
0.66 (0.18, 0.98)
4-Class (ab initio)
0.22 (0.09, 0.43)
0.23 (0.12, 0.31)
0.54 (0.11, 0.91)
0.62 (0.15, 0.91)
Distance (ab initio)
0.22 (0.07, 0.44)
0.24 (0.12, 0.43)
According to Additional file 1: Table S3 and Table 5 the reconstruction algorithm that uses distance maps predicted by the template-base predictor reproduces the CASP 9 targets with an average GDT_TS of 53.8% and a TM-score of 0.62. The corresponding 4-class-based predictor produces the structures with an average GDT_TS of 60.9% and a TM-score of 0.66. The results obtained show that the distance map-based reconstruction produces the structures whose quality slightly degrades compared to the corresponding structures obtained by the 4-class map approach. The reported GDT_TS score decreases by 7.1% on average, whereas the TM-score decrease by 0.04 on average. The main reason for the slight decrease in the performance of the distance-based algorithm results from its inability to accurately reproduce structures longer than 200 residues. When targets with sequence length below 200 amino acids are considered, the final results of the two methods become comparable with an average TM-score of 0.56 and 0.55 for the 4-class based predictor and distance-map predictor, respectively (Additional file 1: Table S5).
When the reconstruction algorithm uses distance maps predicted by the ab initio predictor, the performance of the model significantly drops as expected (Additional file 1: Table S3 and Table 5). Both the distance-based and the 4-class-based reconstruction protocols give similarly low performances: GDT_TS = 22%, TM-score = 0.24 when distance maps are used; and GDT_TS = 22%, TM-score = 0.23 when 4-class maps are used. These results show that the current distance/contact map machine learning approach is not able to reliably reproduce protein structures using only protein sequence information coupled with basic geometrical rules, and should be complemented in the future by more complex reconstruction protocol.
We have explored the possibility of predicting protein inter-residue distances using amino-acid information on its own, or complemented by structural templates. The prediction of inter-residue distances and other continuous structural features in proteins in general has been avoided in the past due to complexity of the problem in comparison to the traditional methods that predict their discrete counterparts. Only recently, have new models that successfully predict continuous backbone torsion angles emerged [47, 48]. These models have shown that the accurate prediction of continuous backbone torsion angles can be obtained and hence more accurate sampling of the protein conformational space can be achieved. In light of this, we have developed a novel machine learning pipeline for high-throughput prediction of protein distance maps, based on the similar machine learning approach previously developed for contact map predictions .
We show that when a physically realizable distance map is used as target, even a simple geometry-based reconstruction algorithm is able to reproduce a 3D structure that is almost identical to the target. In contrast, a full set of discrete restraints, in terms of binary and 4-class distance maps, used with the same reconstruction protocol yield a 3D structure with considerably lower resolution. When non-physical target maps are used, the quality of the reconstructed structure gets degraded when the amount of noise in the map increases. However, the distance map has been shown to be more resistant to noise than initially envisioned. Even when a random error of ±6Å is introduced into the distance map, the reconstructed protein structure is more accurate than the corresponding structures reconstructed from the binary and 4-class map, giving an average RMSD to the target below 2Å.
We have presented two systems for the prediction of distance maps: the ab initio and the template-based system trained on protein sequences with less than 200 residues. The ab initio system was implemented using various degrees of evolutionary content: 7 classes of amino acids with different physicochemical properties, 20 common amino acid, and 20 common amino acids complemented with correlated mutations in the MSA. The performances of all three ab initio models are comparable implying that the evolutionary information in terms of 7 classes of amino acids with different physicochemical properties provides sufficient information in predicting inter-residue distances using this machine learning approach. Furthermore, the template-based system was capable of exploiting both sequence and structure information even in cases of dubious homology. In both twilight [20, 30%) and midnight zone [0, 20%) of sequence identity, where it is particularly hard to extract information from the templates, the template-based model outperforms the best template hit with a clear margin of up to 3.7Å, and outperforms the weighted average model with a clear margin of up to 1.2Å
Finally, we have shown that predicted real-value distances do not lack the ability to reconstruct near-native structures compared to the predicted contacts. When distance maps were tested on the CASP9 targets sequences, the performance of the distance-based algorithm was comparable to the performance of the 4-class-based approach, implemented in the Distill server, for targets shorter than 200 residues. However, in the current implementation this approach is not suitable for the targets longer than 200 residues. This is expected as distance maps encode more structural information than their discrete counterparts, and their complexity precludes their application on long sequences.
The methodology presented here in its current implementation is not as accurate as the existing techniques that utilize complex force field functions, statistical constraints or additional NMR spectra. However, it is important to note here that the presented method does not aim to replace the existing state of the art models. Instead, our goal was to explore the possibility of predicting protein continuous features, as inter-residue distances, using an efficient machine learning approach. Information on inter-residue and inter-atomic distances in proteins represents valuable information in structural biology, best exemplified by the shown direct dependence of NMR chemical shifts on inter-atomic distances . Therefore, possible application of this method is aimed not only in structure prediction protocols, but also as an additional tool to complement experimental data.
In this work we explore the possibility of predicting protein inter-residue distances and further using them as constraints in the protein reconstruction procedure. The distance map representation of protein topology can tolerate a large amount of noise and still lead to correct 3D structures even when a simple reconstruction protocol is employed. Therefore, the methodology we presented, if complemented by more complex reconstruction protocols, may represent a possible path to improve machine-learning algorithms for 3D protein structure prediction.
Distance map prediction using 2D-Recursive Neural Network
The artificial neural networks we used for predicting distance maps are based on the general-purpose 2D-RNN adaptive architecture previously described in [17, 39] and further outlined here in SI. A description of the architecture of the 2D-RNN together with details on the learning algorithm we employ is also provided in SI. 2D-RNN-based models are used for mapping 2D matrices of variable size into matrices of the same size. Here, the output of the model O represents the distance map itself, whereas the input I encodes a set of pairwise properties of the residues in the protein (Additional file 1: Figure S1).
The input vector I j,k associated with the jth and kth residue pair contains evolutionary information, secondary structure, solvent accessibility and contact density information. The frequencies of amino acids observed in the two columns, j and k, of the MSA are used as an evolutionary input to the network, therefore, representing two 20-dimensional probability vectors. Structural information in the form of standard secondary structure classes (α-helix, β-sheet, random coil) is encoded using two 3-dimensional vectors, whereas relative solvent accessibility (2 classes: buried, 0-25%; and exposed, 25-100%) and contact density (4 classes) are encoded using two 2-dimensional and two 4-dimensional vectors, respectively. In total, a vector of 58 units is used as an input to the ab initio model of the distance map prediction.
The model that encodes 20 common types of amino acids is termed the ‘classical’ model here. In addition to this classical model, two additional models with different evolutionary contents are created. The first, so-called “complementarity” model restricts the input to seven classes of amino acids that are expected to be relevant to the stability of the fold. The complementarity model clusters 20 amino acids into 7 classes based on their structural and physicochemical properties: (i) hydrophobic (A, F, I, L, M, V), (ii) polar (N, Q, S, T, W, Y), (iii) negatively charged (D, E), (iv) positively charged (H, K, R), (v) cysteine (C), (vi) glycine (G) and (vii) proline (P). In the second model, so called “correlation” model, amino acid information is augmented by the correlated mutation signal (1 unit) extracted from the MSA. Correlated mutations are calculated using the PAM70 substitution matrix and Göbel’s algorithm , in which completely conserved positions and the positions with > 20% gaps are discarded from the analysis.
Taking into account the cube of the sequence identity between the query and the template in Equation 3 allows us to favour those distances extracted from good templates over the distances calculated from low-similarity templates.
where c p represents the coverage of the query by the template, i.e. the fractions of the non-gaps in the alignment. The template-based vector defined this way performed better than the number of alternatives in the preliminary testing (data not shown) and is used in the template-based models of distance maps.
The input vector provided to the filtering NN contains the predicted distance d jk obtained from the previous 2D-RNN network (1 unit), sequence separation between residues j and k (1 unit), the protein sequence length (1 unit) and global information extracted from the predicted distance map (15 units). The global information contains the average distance between all pairs of amino acid (m, n) within the segments j − 5 ≤ m ≤ j + 5 and k − 5 ≤ n ≤ k + 5 In addition to the average distance of this 11×11 residue patch positioned around the (j, k) residue pair, the average distances of 14 additional patches are also provided to the network by keeping the same separation between the pairs of residues, as in .
Learning and initialization
The 2D-RNNs composing the distance map predictors are trained by minimizing the squared error between the output and the target distances. To avoid large plateaux in the error function at the beginning of the training, a modified form of the gradient-descent algorithm is used. This algorithm employs a piecewise linear function in three different ranges for the network update weights, and is discussed in detail in . The transfer functions in all network units are implemented using the tanh function. We adopt a hybrid between on-line and batch training with 1,450 batch blocks per training set, i.e. two proteins per a batch. That is, the weights of all networks are updated based on the gradient computed on groups of two proteins. To prevent the error to decrease monotonically, the training set is shuffled at the beginning of each epoch. If the error does not decrease for 50 consecutive epochs, the learning rate is divided by 2. Prior to learning, the weights in each unit in all neural networks are randomly initialized. Their standard deviations are controlled in a flexible way, so as to avoid any bias and ensure that the expected total input into each unit remains approximately in the same range.
Due to the large number of training instances and limited computational power/time, all systems are trained in 5-fold cross validation. Each of the five networks is trained for 1000 epochs by saving the parameters every 5 epochs. For each network the last three saved models are combined in the single predictor. Finally, all 5 networks are combined in a single system. This is known to slightly improve the performance over individual models .
The reconstruction algorithm of protein C α -traces is organized into two sequential phases, as described in detail in . Shortly, in the first phase a random structure is generated by adding C α positions until the whole backbone is produced. The bonds of adjacent C α atoms in this phase are added in a random direction with the lengths restricted to lie in the interval 3.803±0.07 Å using uniform distribution. The positions of the C α atoms belonging to a helix structure are modelled using the coordinates of the ideal helix with random orientation. In the last phase, the algorithm refines the initial structure by optimizing the pseudo-energy function using local moves and simulating annealing . The moves we adopt displace a single residue at a time, and keep its distances to its neighbours constant.
In all the experiments, we run the annealing protocol for 10,000 × protein length iterations, in each of which the perturbation of a single residue is attempted. Pseudo-energy parameters are set to, α0 = 0.2 α1 = 0.025 (distance penalty), α2 = 0.5 (clashes) and α3 = 2.0 (strand length), so that the conformational search is biased towards the generation of compact, clash-free structures with the recommended length of β-strands and with C∝ distances approaching to distances provided by the distance map.
A distance map contains no information about chirality. When an overall structure is reconstructed, the mirror-image structure is equally legitimate, having the same distance map. Therefore, in the final step we generate the mirror image of the reconstructed structure and refine it for additional 5,000 iterations. The choice of the final reconstructed structure depends on the pseudo-energy penalty needed for the original and mirror image reconstructed 3D structure (Equation 6).
In addition to this simple geometry-based reconstruction algorithm, we use a fragment-based reconstruction to predict the structures of CASP9 targets from non-native 4-class maps and distance maps. In the fragment-based reconstruction  implemented here, for each protein segment of length 9, 50 candidate structures in the PDB are identified using the fold recognition algorithm described in . A move consists in swapping a segment at a random position with another (random) one in the list. Since segment lengths are generally not the same, mutual distances between any two residues in the protein are affected by a move. Moves are accepted or rejected based on the same pseudo-energy function as in the previous protocol (Equation 6) and the simulating annealing protocol for 20,000 iterations. Lastly, the mirror image of the reconstructed structure is generated, a brief further reconstruction is attempted and its fitness is assessed. Given that segments from the PDB incorporate chirality information, we observe that, in the majority of cases, the correct mirror image is selected directly based on fitness.
The dataset used to train and test the predictors is extracted from the October 2009 25% pdb_select list containing 4,818 proteins . Since the training is computationally demanding (and its complexity quadratic in the protein length) we created a reduced version of the dataset by excluding proteins longer than 200 residues. The final dataset contains 3,645 proteins with 360,971 residues and 21,918,875 residue pairs (Additional file 1: Table S2). All systems are trained in 5-fold cross validation by splitting the dataset into 5 approximately equal folds. Inter-residue distances used for training are measured between Cα atoms, and their distribution is plotted in Additional file 1: Figure S2. If we include only the distances between residues separated by at least 2 amino acids in the sequence, then, it becomes clear from Additional file 1: Figure S2 that the majority of data (76%) are distributed in the range [10Å, 30Å] with a mean value of 20.7Å.
Secondary structure and relative solvent accessibility of each residue are assigned using DSSP , whereas contact density is calculated as in . True structural information is used for training of both the ab initio and the template-based models. For testing purposes, we use predictions from in-house servers [42, 44, 45] to predict secondary structure, solvent accessibility and contact density, respectively.
Evolutionary information in the form of amino acid probability vectors, amino acid classes and correlated mutations are calculated from MSAs. The alignments for the proteins in the training/test dataset are extracted from the non-redundant (NR) database. The alignments are generated by three runs of position specific iterative BLAST (PSI-BLAST)  with parameters b=3,000, e =10 -3 and h=10 -10 .
To generate the structural templates for a protein, we run PSI-BLAST against the PDB (available on April 30th 2008) using the position specific scoring matrix (PSSM) generated during the alignment process. We deliberately use a high expectation parameter (e=10) to include hits that are beyond the usual comparative modelling scope (e<0.01). Finally, in order to avoid perfect templates coming from PDB resubmissions of the same structure and close homologues, we exclude those templates whose sequence similarity exceeds 95% over the whole query.
The distribution of the sequence identity to the average/best template identity is given in Additional file 1: Figure S3. The average identity for all templates, not surprisingly, is generally low with a median of 20% identity. Although the distribution is not uniform, all identity intervals are adequately represented: 37% of all proteins have the best hit with less than 20% sequence identity (midnight zone), the best hit of 21% proteins is between 20-30% sequence identity (twilight zone), and for the rest of 42%, close homologues can be found with sequence identity in the interval 30-95%.
This work was supported by The Irish Research Council for Science Engineering and Technology (IRCSET) Graduate Research Education Programme (GREP) scholarship.
- Lander E, Linton L, Birren B, Nusbaum C, Zody M, Baldwin J, Devon K: Initial sequencing and analysis of the human genome. Nature. 2001, 409: 860-921. 10.1038/35057062.View ArticlePubMedGoogle Scholar
- Venter C, Adams M, Myers E, Li P, Mural R, Sutton G, Smith H, Yandell M: The sequence of the human genome. Science. 2001, 291 (5507): 1304-1351. 10.1126/science.1058040.View ArticlePubMedGoogle Scholar
- Yooseph S, Sutton G, Rusch D, Halpern A, Williamson S, Remington K: The Sorcerer II Global Ocean Sampling Expedition: Expanding the Universe of Protein Families. PLoS Biol. 2007, 5 (3): 432-466.View ArticleGoogle Scholar
- Cheng J: A multi-template combination algorithm for protein comparative modeling. BMC Struct Biol. 2008, 8: 18-10.1186/1472-6807-8-18.View ArticlePubMed CentralPubMedGoogle Scholar
- Zhou H, Pandit S, Lee S, Borreguero J, Chen H, Wroblewska L, Skolnick J: Analysis of TASSER-based CASP7 protein structure prediction results. Proteins: Structure, Function, and Bioinformatics. 2007, 69: 90-97. 10.1002/prot.21649.View ArticleGoogle Scholar
- Krieger E, Joo K, Lee J, Lee J, Raman S, Thompson J, Tyka M, Baker D, Karplus K: Improving physical realism, stereochemistry, and side-chain accuracy in homology modeling: Four approaches that performed well in CASP8. Proteins: Structure, Function, and Bioinformatics. 2009, 77: 114-122. 10.1002/prot.22570.View ArticleGoogle Scholar
- Simons K, Kooperberg C, Huang E, Baker D: Assembly of protein tertiary structures from fragments with similar local sequences using simulated annealing and bayesian scoring functions. J Mol Biol. 1997, 268 (1): 209-225. 10.1006/jmbi.1997.0959.View ArticlePubMedGoogle Scholar
- Robustelli P, Kohlhoff K, Cavalli A, Vendruscolo M: Using NMR Chemical Shifts as Structural Restraints in Molecular Dynamics Simulations of Proteins. Structure. 2010, 18: 923-933. 10.1016/j.str.2010.04.016.View ArticlePubMedGoogle Scholar
- Shen Y, Vernon R, Baker D, Bax A: De novo protein structure generation from incomplete chemical shift assignments. J Biomol NMR. 2009, 43 (2): 63-78. 10.1007/s10858-008-9288-5.View ArticlePubMed CentralPubMedGoogle Scholar
- Marks D, Colwell L, Sheridan R, Hopf T, Pagnani A, Zecchina R, Sander C: Protein 3D Structure Computed from Evolutionary Sequence Variation. PLoS One. 2011, 6 (12): e28766-10.1371/journal.pone.0028766.View ArticlePubMed CentralPubMedGoogle Scholar
- Hopf T, Colwell L, Sheridan R, Rost B, Sander C, Marks D: Three-dimensional structures of membrane proteins from genomic sequencing. Cell. 2012, 149: 1607-1621. 10.1016/j.cell.2012.04.012.View ArticlePubMed CentralPubMedGoogle Scholar
- Qian N, Sejnowski T: Predicting the secondary structure of globular proteins using neural network models. J Mol Biol. 1988, 202 (4): 865-884. 10.1016/0022-2836(88)90564-5.View ArticlePubMedGoogle Scholar
- Pollastri G, Baldi P, Fariselli P, Casadio R: Prediction of coordination number and relative solvent accessibility in proteins. Proteins: Structure, Function, and Bioinformatics. 2002, 47 (2): 142-153. 10.1002/prot.10069.View ArticleGoogle Scholar
- Rost B, Sander C: Prediction of protein secondary structure at better than 70% accuracy. J Mol Biol. 1993, 232 (2): 584-599. 10.1006/jmbi.1993.1413.View ArticlePubMedGoogle Scholar
- Vendruscolo M, Kussell E, Domany E: Recovery of protein structure from contact maps. Folding and Design. 1997, 2 (5): 295-306. 10.1016/S1359-0278(97)00041-2.View ArticlePubMedGoogle Scholar
- Fariselli P, Casadio R: A neural network based predictor of residue contacts in proteins. Protein Eng. 1999, 12 (1): 15-21. 10.1093/protein/12.1.15.View ArticlePubMedGoogle Scholar
- Pollastri G, Baldi P: Prediction of contact maps by GIOHMMs and recurrent neural networks using lateral propagation from all four cardinal corners. Bioinformatics. 2002, 18: 62-70. 10.1093/bioinformatics/18.suppl_1.S62.View ArticleGoogle Scholar
- Punta M, Rost B: PROFcon: novel prediction of long-range contacts. Bioinformatics. 2005, 21 (13): 2960-2968. 10.1093/bioinformatics/bti454.View ArticlePubMedGoogle Scholar
- Shao Y, Bystroff C: Predicting interresidue contacts using templates and pathways. Proteins: Structure, Function, and Bioinformatics. 2003, 53: 497-502. 10.1002/prot.10539.View ArticleGoogle Scholar
- Cheng J, Baldi P: Improved residue contact prediction using support vector machines and a large feature set. BMC Bioinformatics. 2007, 8: 113-10.1186/1471-2105-8-113.View ArticlePubMed CentralPubMedGoogle Scholar
- Shackelford G, Karplus K: Contact prediction using mutual information and neural nets. Proteins: Structure, Function, and Bioinformatics. 2007, 69: 159-164. 10.1002/prot.21791.View ArticleGoogle Scholar
- Jones D, Buchan D, Cozzetto D, Pontil M: PSICOV: precise structural contact prediction using sparse inverse covariance estimation on large multiple sequence alignments. Bioinformatics. 2012, 28 (2): 184-190. 10.1093/bioinformatics/btr638.View ArticlePubMedGoogle Scholar
- Godzika A, Kolinskia A, Skolnick J: Topology fingerprint approach to the inverse protein folding problem. J Mol Biol. 1992, 227 (1): 227-238. 10.1016/0022-2836(92)90693-E.View ArticleGoogle Scholar
- Pelta D, Gonzalez J, Vega M: A simple and fast heuristic for protein structure comparison. BMC Bioinformatics. 2008, 9: 161-10.1186/1471-2105-9-161.View ArticlePubMed CentralPubMedGoogle Scholar
- Pietal M, Tuszynska I, Bujnicki J: PROTMAP2D: visualization, comparison and analysis of 2D maps of protein structure. Bioinformatics. 2007, 23 (11): 1429-1430. 10.1093/bioinformatics/btm124.View ArticlePubMedGoogle Scholar
- Punta M, Rost B: Protein folding rates estimated from contact predictions. J Mol Biol. 2005, 348 (3): 507-512. 10.1016/j.jmb.2005.02.068.View ArticlePubMedGoogle Scholar
- Schlessinger A, Punta M, Rost B: Natively unstructured regions in proteins identified from contact predictions. Bioinformatics. 2007, 23 (18): 2376-2384. 10.1093/bioinformatics/btm349.View ArticlePubMedGoogle Scholar
- Pazos F, Helmer-Citterich M, Ausiello G, Valencia A: Correlated mutations contain information about protein-protein interaction. J Mol Biol. 1997, 271 (4): 511-523. 10.1006/jmbi.1997.1198.View ArticlePubMedGoogle Scholar
- Ezkurdia I, Grana O, Izarzugaza J, Tress M: Assessment of domain boundary predictions and the prediction of intramolecular contacts in CASP8. Proteins: Structure, Function, and Bioinformatics. 2009, 77: 196-209. 10.1002/prot.22554.View ArticleGoogle Scholar
- Walsh I, Bau D, Martin A, Mooney C, Vullo A, PollastrI G: Ab initio and template-based prediction of multi-class distance maps by two-dimensional recursive neural networks. BMC Struct Biol. 2009, 9: 5-10.1186/1472-6807-9-5.View ArticlePubMed CentralPubMedGoogle Scholar
- Aszodi A, Gradwell M, Taylor W: Global fold determination from a small number of distance restraints. J Mol Biol. 1995, 251 (2): 308-326. 10.1006/jmbi.1995.0436.View ArticlePubMedGoogle Scholar
- Aszodi A, Taylor W: Homology modelling by distance geometry. Folding and Design. 1996, 1 (5): 325-334. 10.1016/S1359-0278(96)00048-X.View ArticlePubMedGoogle Scholar
- Gorodkin J, Lund O, Andersen C, Brunak S: Using sequence motifs for enhanced neural network prediction of protein distance constraints. Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology (ISMB99). 1999, La Jolla, CA: AAAI Press, Menlo Park, CA, 95-105.Google Scholar
- Lund O, Frimand K, Gorodkin J, Bohr H, Bohr J, Hansen J, Brunak S: Protein distance constraints predicted by neural networks and probability density functions. Protein Eng. 1997, 10 (11): 1241-1248. 10.1093/protein/10.11.1241.View ArticlePubMedGoogle Scholar
- Izarzugaza J, Grana O, Tress M, Valencia A, Clarke N: Assessment of intramolecular contact predictions for CASP7. Proteins: Structure, Function, and Bioinformatics. 2009, 69: 152-158.View ArticleGoogle Scholar
- Vassura M, Margara L, Di Lena P, Medri F, Fariselli P, Casadio R: Reconstruction of 3D structures from protein contact maps. IEEE/ACM Trans Comput Biol Bioinform. 2008, 5 (3): 357-367.View ArticlePubMedGoogle Scholar
- Zemla A: LGA: a method for finding 3D similarities in protein structures. Nucleic Acids Res. 2003, 31 (13): 3370-3374. 10.1093/nar/gkg571.View ArticlePubMed CentralPubMedGoogle Scholar
- Zhang Y, Skolnick J: Scoring function for automated assessment of protein structure template quality. Proteins: Structure, Function, and Bioinformatics. 2004, 57: 702-710. 10.1002/prot.20264.View ArticleGoogle Scholar
- Baldi P, Pollastri G: The Principled Design of Large-Scale Recursive Neural Network Architectures-DAG-RNNs and the Protein Structure Prediction Problem. J Mach Learn Res. 2003, 4: 575-602.Google Scholar
- Reese M, Lund O, Bohr J, Bohr H, Hansen J, Brunak S: Distance distributions in proteins: a six-parameter representation. Protein Eng. 1999, 9 (9): 733-740.View ArticleGoogle Scholar
- Baldi P, Brunak S, Frasconi P, Soda G, Pollastri G: Exploiting the past and the future in protein secondary structure prediction. Bioinformatics. 1999, 15 (11): 937-946. 10.1093/bioinformatics/15.11.937.View ArticlePubMedGoogle Scholar
- Pollastri G, McLysaght A: Porter: a new, accurate server for protein secondary structure prediction. Bioinformatics. 2005, 21 (8): 1719-1720. 10.1093/bioinformatics/bti203.View ArticlePubMedGoogle Scholar
- Pollastri G, Przybylski D, Rost B, Baldi P: Improving the prediction of protein secondary structure in three and eight classes using recurrent neural networks and profiles. Protein Struct Funct Genet. 2002, 47: 228-235. 10.1002/prot.10082.View ArticleGoogle Scholar
- Vullo A, Walsh I, Pollastri G: A two-stage approach for improved prediction of residue contact maps. BMC Bioinformatics. 2006, 7: 180-10.1186/1471-2105-7-180.View ArticlePubMed CentralPubMedGoogle Scholar
- Pollastri G, Martin A, Mooney C, Vullo A: Accurate prediction of protein secondary structure and solvent accessibility by consensus combiners of sequence and structure information. BMC Bioinformatics. 2007, 8: 201-10.1186/1471-2105-8-201.View ArticlePubMed CentralPubMedGoogle Scholar
- Kryshtafovych A, Fidelis K, Moult J: CASP9 results compared to those of previous casp experiments. Proteins: Structure, Function, and Bioinformatics. 2011, 79 (S10): 196-207. 10.1002/prot.23182.View ArticleGoogle Scholar
- Xue B, Dor O, Faraggi E, Zhou Y: Real-value prediction of backbone torsion angles. Proteins: Structure, Function, and Bioinformatics. 2008, 72 (1): 427-433. 10.1002/prot.21940.View ArticleGoogle Scholar
- Boomsma W, Mardia K, Taylor C, Ferkinghoff-Borg J, Krogh A, Hamelryck T: A generative, probabilistic model of local protein structure. Proc Natl Acad Sci U S A. 2008, 105 (26): 8932-8937. 10.1073/pnas.0801715105.View ArticlePubMed CentralPubMedGoogle Scholar
- Kohlhoff K, Robustelli P, Cavalli A, Salvatella X, Vendruscolo M: Fast and accurate predictions of protein NMR chemical shifts from interatomic distances. J Am Chem Soc. 2009, 131: 13894-13895. 10.1021/ja903772t.View ArticlePubMedGoogle Scholar
- Göbel U, Sander C, Schneider R, Valencia A: Correlated mutations and residue contacts in proteins. Proteins: Structure, Function, and Bioinformatics. 1994, 18 (4): 309-317. 10.1002/prot.340180402.View ArticleGoogle Scholar
- Hobohm U, Sander C: Enlarged representative set of protein structures. Protein Sci. 1994, 3 (3): 522-524.View ArticlePubMed CentralPubMedGoogle Scholar
- Martin A, Bau D, Vullo A, Walsh I, Pollastri G: Long-range information and physicality constraints improve predicted protein contact maps. J Bioinform Comput Biol. 2008, 6 (5): 1001-1020. 10.1142/S0219720008003783.View ArticlePubMedGoogle Scholar
- Bau D, Pollastri G, Vullo A: Distill: a machine learning approach to ab initio protein structure prediction. Analysis of biological data: a soft computing approach, Volume 3. Edited by: Bandyopadhyay S, Maulik U, Wang J. 2007, Singapore: World Scientific Publishing Co, 153-178.Google Scholar
- Han K, Baker D: Recurring Local Sequence Motifs in Proteins. J Mol Biol. 1995, 251: 176-187. 10.1006/jmbi.1995.0424.View ArticlePubMedGoogle Scholar
- Mooney C, Pollastri G: Beyond the twilight zone: automated prediction of structural properties of proteins by recursive neural networks and remote homology information. Proteins: Structure, Function, and Bioinformatics. 2009, 77 (1): 181-190. 10.1002/prot.22429.View ArticleGoogle Scholar
- Griep S, Hobohm U: PDBselect 1992–2009 and PDBfilter-select. Nucl Acids Res. 2010, 38: 318-319. 10.1093/nar/gkp786.View ArticleGoogle Scholar
- Kabsch W, Sander C: Dictionary of protein secondary structure: pattern recognition of hydrogen-bonded and geometrical features. Biopolymers. 1983, 22 (12): 2577-2637. 10.1002/bip.360221211.View ArticlePubMedGoogle Scholar
- Altschul S, Madden T, Schaffer A, Zhang J, Zhang Z, Miller W, Lipman D: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucl Acids Res. 1997, 25 (17): 3389-3402. 10.1093/nar/25.17.3389.View ArticlePubMed CentralPubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.