Optimal contact definition for reconstruction of Contact Maps
© Duarte et al; licensee BioMed Central Ltd. 2010
Received: 8 December 2009
Accepted: 27 May 2010
Published: 27 May 2010
Contact maps have been extensively used as a simplified representation of protein structures. They capture most important features of a protein's fold, being preferred by a number of researchers for the description and study of protein structures. Inspired by the model's simplicity many groups have dedicated a considerable amount of effort towards contact prediction as a proxy for protein structure prediction. However a contact map's biological interest is subject to the availability of reliable methods for the 3-dimensional reconstruction of the structure.
We use an implementation of the well-known distance geometry protocol to build realistic protein 3-dimensional models from contact maps, performing an extensive exploration of many of the parameters involved in the reconstruction process. We try to address the questions: a) to what accuracy does a contact map represent its corresponding 3D structure, b) what is the best contact map representation with regard to reconstructability and c) what is the effect of partial or inaccurate contact information on the 3D structure recovery. Our results suggest that contact maps derived from the application of a distance cutoff of 9 to 11Å around the C β atoms constitute the most accurate representation of the 3D structure. The reconstruction process does not provide a single solution to the problem but rather an ensemble of conformations that are within 2Å RMSD of the crystal structure and with lower values for the pairwise average ensemble RMSD. Interestingly it is still possible to recover a structure with partial contact information, although wrong contacts can lead to dramatic loss in reconstruction fidelity.
Thus contact maps represent a valid approximation to the structures with an accuracy comparable to that of experimental methods. The optimal contact definitions constitute key guidelines for methods based on contact maps such as structure prediction through contacts and structural alignments based on maximum contact map overlap.
For over 30 years [1, 2] contact maps have been used as an alternative representation of protein structures. A contact map is a 2-dimensional representation of the residue interactions in a protein structure. This 2-dimensional representation takes the form of a binary matrix. A given cell (i, j) of the matrix can only take two values, 1 if the residues i and j are in contact or 0 otherwise. The definition of interaction varies but it is usually based on some cut-off distance between the atoms of the two residues. One can also see this description from another perspective as a residue interaction graph (RIG) with residues as nodes and the contacts as edges. In this view the binary matrix is no more than the adjacency matrix representing the graph.
Although they constitute a simple 2-dimensional representation of the molecule, contact maps still capture all important features of a protein fold. As such they are an invaluable tool for the analysis of biological macromolecules. They provide a computationally tractable representation of an otherwise complex problem, with the important advantage of being structural descriptors independent of the coordinate frame. Thus providing a sort of internal coordinates description, rotationally and translationally independent. However the simplified representation loses on accuracy as compared to the original 3-dimensional model. Multiple applications can be found in the literature that make use of the concept. Contact maps have been used for development of structural alignment algorithms [3, 4], for automatic domain identification [5, 6], in structural modelling by the extraction of contact-based empirical potentials [7–10] or for the identification of residues critical for folding , stability  and function . Furthermore they have been used as a proxy for 3-dimensional structure prediction by means of machine learning techniques in order to predict residue contacts from sequence information [14–18].
Several methods have been proposed in the past for the reconstruction of contact maps. Most of them develop around the common mathematical theory of distance geometry first applied to chemistry by Blumenthal . The theory took really off when Crippen and Havel  applied it to the problem of protein structure determination by NMR methods. In a typical NMR experiment distances between spatially close Hydrogen atoms can be determined for a protein in solution through the detection of the Nuclear Overhausser Effect (NOE) . The NOE data can be seen then as a set of distance ranges between some pairs of Hydrogen atoms. Distance geometry deals with distances between points and their embedding in 3-dimensional space. In principle given a proper metric matrix with all exact distances among a set of points an analytical solution to the embedding can be found easily. The problem becomes more complicated when not all distances are given (sparse distance map) and when only distance ranges rather than exact distances are known. This is the case of the NMR experiments and equivalently of contact maps: we know some distance ranges between pairs of atoms for which we would like to find 3-dimensional coordinates. A heuristic algorithm (named EMBED) to solve the problem was proposed by Crippen and Havel and has been applied extensively ever since. Other algorithms have been proposed such as the alternating projection algorithm by Glunt et al.  or the geometric build-up algorithm by Wu and Wu .
However the problem of reconstructability of protein contact maps has not been fully addressed in the literature. A few studies [24–26] have tried to evaluate the accuracy of the existing methods but they all lack in completeness of the test set and thorough assessment of the different parameters or do not provide fully realistic protein models but only C α traces.
Results and Discussion
We studied the reconstructability of a set of representative native PDB protein structures (see Methods). Firstly we decomposed the native proteins into contact maps with different contact type definitions and for several distance cut-offs. Then we used our reconstruction software to recreate the 3D structures based solely in the information supplied by the contact maps.
To measure the accuracy we then proceed by evaluating the RMSD of the generated models with the original structure. We measured the RMSD on the C α atoms over all residues, independent of whether the reconstructions were based on C α contact maps or not. This seems to be a well-established way of measuring the similarity between two structures especially when they are closely related and should facilitate the comparison to other published work. Another well-established method for structure comparison, GDT , was not deemed to be appropriate here as it is most useful in comparing structures over a broader range of dissimilarity as is the case in the CASP experiment.
The range of cut-offs chosen was based on values previously used in the literature keeping them within a biochemically sensible range: the minimum cut-off was 6Å as values below result in too sparse contact maps. At the other end we chose 15Å since beyond that the contact map starts to lose in information content becoming fully connected.
Our RMSD vs distance cut-off plots show no further improvement in accuracy beyond the optimal cut-off region. This is in clear disagreement with  where the reconstruction quality is reported to further increase for cut-off values as big as 18Å. This can be explained by the fundamentally different procedure of computing the reconstructed models: in our case an all atom approach with realistic regularization of the coordinates through a restraint-only harmonic potential was used for the construction of the models.
Vassura et al. on the other hand uses a simpler C α trace model, without a final refinement phase. Optimal threshold values found here are in agreement to some of the reported optimal values found in other studies. There has been many attempts in the past to find an optimal contact map definition with respect to both distance cut-off and interaction centre. The optimizations were based in different criteria according to what the focus was in the particular study.
Some authors like Gromiha et al.  studied the correlation of relative contact order with folding rate, finding that from several cut-offs 8Å gave the best correlations for the C α contact type when considering long range interactions only.
Karchin et al.  found that residue burial expressed as contact counts performs best at fold recognition for C β contact type with a cut-off of 14Å. Similarly Benkert et al.  used the same residue burial measure and surprisingly found that a cut-off of 9Å was optimal, possibly due to differences in normalisation procedures. Quite a few studies tried to find an optimal contact definition based on the discriminatory power of contact-based empirical potentials in distinguishing decoys from native structures. Bolser et al.  found that the best performing two-body potential was that derived from C β contact definition with a 12Å cut-off. Vendruscolo et al.  found that for the C α contact type the best cut-off was at 8.5Å for a two-body contact potential.
As contact maps are only meaningful in the context of obtaining 3D protein models the reconstructability criterium should not be neglected when considering a contact definition for instance in the prediction of contacts. Contacts containing more geometrical information will be more valuable when building 3-dimensional models. This is of special importance if we consider that the reconstruction of contact maps seems to be possible even with sparser contact maps (see [30, 31]), which means that contacts even at optimal definitions still seem to contain redundant information.
Optimal interaction centre
Comparing the accuracy values between the C α , C β and C α + C β cases (see Figure 2) it is apparent that C α + C β performs better across the whole range of cut-offs tested, with C β alone doing also better than C α . Figure 4 shows again this comparison for proteins divided into their respective SCOP classes. The trend holds within each of the SCOP classes.
Melo et al.  studying distance dependent empirical potentials explored several interaction centres concluding that the C β atom was the best performing atom centre. This seems to be a widely accepted result as indicates the use of the C β contact type for the contact prediction category at the Critical Assessment of protein Structure Prediction (CASP) experiment .
Our study, purely based on the 3D geometrical information content of the contacts, confirms the preference for C β as the interaction centre of choice. It seems natural that C β is better in order to derive empirical potentials as it spans both the backbone and the side-chain. But also it is a superior point of choice for embedding a 3D structure from interatomic distance restraints. The interaction centre is able to capture geometrical information for the backbone positioning as well as for the orientation of the side-chain leading to a more precise 3D description.
Also of interest is the fact that the combination of both C α and C β contacts leads still to better reconstruction performance, indicating that there is some more backbone information not contained in the C β restraints. This suggests an approach in the homology modelling of proteins based on distance restraints (see [33–35]): using two atoms per residue to restrain the geometry will lead to more precise models. We also obtained better accuracy results (data not shown) by choosing a backbone atom and a side-chain atom farther away from the C β .
Reconstructions for different SCOP classes
We then address the question of whether the reconstruction process is dependant of the type of protein. In order to do so we separate our 60 proteins into the four SCOP classes to which they belong to, each of the classes containing 15 structures. Figure 4 shows the accuracy values for each of these four classes. The results hold for other cutoffs. It is striking that the accuracy and spread of the all-β group is significantly better than that of the other three. Interestingly the median values are not very far away for the 4 classes but the variances are hugely different especially for the all-beta case. Contrary to this result, in a similar study Saitoh et al.  stated that they did not encounter a dependency of the accuracy of reconstruction based on the SCOP class. This might be explained by the much smaller test set used in that study, 11 proteins in total and only 2 in the all-β class. Vassura et al.  did find some differences across different classes especially a lower accuracy for the all-a class, which we also observe here.
Variability of the reconstruction ensembles
RMSD of reconstruction ensembles.
Ensemble's average RMSD
α + β
α + β
α + β
As seen in Figure 1 the reconstruction ensemble is reminiscent of an NMR structure ensemble, not surprisingly as both are based on fitting 3D coordinates to distance restraints. This shows another advantage of the contact map representation, namely that the conformational flexibility of the molecules is implicit in the model.
Comparison to previous studies
For completeness of this work we compare our results to those of two previously published reconstruction methods [26, 25]. In Figure 5 we present our results (black) for the set of 17 proteins used by Vendruscolo et al. and subsequently by Vassura et al. together with their results (red and green respectively). Our RMSD values are higher in most cases. Remarkably the values of Vassura et al. are a lot lower. However caution should be taken in this comparison as they do not report on the variability (error) of the result. As their algorithm (like the others) is stochastic the evaluation of the variability across different runs is important to consider. Another important issue to take into account is that these two previous studies are using a simpler representation of proteins, namely one based on only the C α atoms. In contrast here we are constructing full atom protein chains with realistic bonds and angles. This leads to higher RMSD values as more geometrical constraints need to be fulfilled.
Tolerance to missing contacts and noise
As a final part of the study we then address the question of reconstruction of contact maps in the more realistic scenario of incomplete or noisy maps, which is likely to be the case when the input is a predicted set of contacts. To do this instead of using real predictions, for instance from homology or machine learning methods, we simulate incomplete and noisy contact maps to thoroughly explore the effect of noise in the process of reconstruction.
Interestingly enough there seems to be a non-linear relationship in the information redundancy with respect to cut-off. Figure 6b represents as before the reconstruction RMSD versus the deletion of contacts but this time only for contact type C β and different cut-offs. The loss of accuracy with lower percentage sampled subsets seems to decrease with higher cut-offs. Thus for the same percentage deletion one can recreate the original structure better with contact maps of higher cut-offs, i.e. the redundancy is higher. The second test that we perform intends to asses the robustness of the 3D recovery process with respect to the presence of noise, the case of a more realistic prediction with false positives. Figure 6c represents the reconstruction accuracy versus the percentage of noise added. The behaviour here is totally different than before. An addition of only 2% of random contacts severely affects the 3D recovery process. The C β definition behaves better at all levels of noise.
An existing application  is reported to perform better with noisy contact maps, but this seems to be due to their pre-filtering based on finding well connected nodes, equivalent to finding contact clusters. As the test is against randomly added contacts this is not a very realistic filtering. In a real scenario a) one would not have all well-connected real contacts of the native map and b) the false positives would be very different from random noise. Thus we argue that the filtering used in FT-COMAR based in common neighbours is not realistic and so the reported tolerance to noise could not be extended to real situations. In our case we have tested the robustness of the algorithm still against random noise (which in principle would have a different distribution than predicted false positives) but we do not perform any pre-filtering. We believe this to constitute a more realistic benchmark.
The tests performed here are based on randomly generated inaccurate contact maps which in principle differ significantly from ab-initio predictions. However from our results here we could conclude that with adequately precise ab-initio contact predictions one could produce reasonable models. In fact we applied successfully some of these ideas in the CASP8 community-wide experiment for structure prediction . In that case we used template-based contact maps that led to 3D models comparable to those of established methods. The non-random noise of the template-based maps did not seem to affect significantly the 3D recovery.
In this work we have studied the viability of computing 3D protein models from contact maps. We assessed the performance of a reconstruction procedure based on the well known distance geometry protocol used extensively in NMR protein structure determination.
We perform a comprehensive evaluation covering a representative set of the PDB spanning the 4 SCOP classes. We then explore several possible contact map definitions and evaluate the accuracy of the reconstructions based on RMSD to the available native structure.
We found that contacts based on the C β atoms are a better description of the 3-dimensional model than those based on C α , confirming other studies that used one-body and two-body empirical contact-based potentials for fold recognition to find this optimum. Reconstruction accuracy can be further improved by using the two contact definitions together C α + C β .
With regards to contact cut-offs we found that the optimal lies in the region from 9 to 11Å. We do not observe, contrary to previous studies  that the accuracy improves for higher cut-offs. Because of the increasing amount of contacts that higher cut-off contact maps yield, we preferred as an optimal threshold the lower end of the optimal range. A contact map based on a 9Å cut-off achieves maximal geometrical information per contact.
Interestingly the accuracy of the reconstruction seems to be different for different classes of proteins. Particularly the all-β SCOP class yields very good accuracies across all its members as compare to the other classes, leading to the conclusion that some topologies are more amenable to be described in terms of single atom distance restraints.
These results are particularly valuable for the contact prediction community. As contact prediction ultimately aims at obtaining 3-dimensional models of protein structures the usage of our optimal contact definition findings should contribute to better accuracies of the predictions. At the same time the results can be useful in the structural alignment of proteins through contact map overlap . These methods seek a 3D alignment by optimising a contact map overlap measure. Clearly contacts that contain better 3-dimensional information should lead to improved results in the final alignments.
Further our 3D recovery procedure seems to perform also very well even if only a partial subset of the contacts is available. With as little as 40% of the contacts reasonably good models can be produced. On the contrary the method is very sensible to the presence of non-real contacts. The introduction of restraints at random points in the chain is simply fatal for the recovery of the original structure. This indicates that contact predictions should focus on accuracy rather than coverage.
This study is based on the TINKER molecular dynamics package , available at http://dasher.wustl.edu/tinker. In particular the distgeom  program was used for the generation of 3-dimensional protein models from distance restraints which is at the core of the contact map reconstruction procedure.
An interface to the TINKER package was developed (Java) providing a single command line executable as a one stop solution for contact map reconstruction, taking contact maps as input and outputting PDB files. The software is multiplatform (Linux, Windows and Mac) and only requires a working copy of the TINKER package locally installed.
We have made our program freely available under the terms of the GPL v.2 at http://www.molgen.mpg.de/~lappe/reconstruct.
We generated distance restraints from the contact maps in the form of lower and upper bounds restraints for pairs of atoms (with standard value of 100.0 kcal/Å2 for the force constant). The restraints were then fed into distgeom to generate a total of 30 models per structure using simulated annealing for refinement. The extensive study performed required a substantial amount of computation as we had 60 proteins, 3 contact-type definitions and 19 cutoff bins from 6 to 15 with 0.5 step. This gave a total of 3420 contact maps, for each of them we computed 30 structures in order to have a statistically meaningful sampling of the reconstruction space, resulting in a total of 102,600 models. The computations were carried out in a distributed fashion on a Linux cluster with over 100 CPUs.
The conformations found through the distance geometry protocol can not distinguish between the 2 enantiomers of the molecule, as chirality information is simply not present in the contact map. We overcome this problem by comparing to the native molecule through RMSD. The RMSD values for the conformation ensemble are found to be distributed bimodally, by simply choosing the lowest third of models as ranked by RMSD we are sure not to be falling into the wrong enantiomer.
Contact maps and distance restraints
We used two definitions of contact maps in this study: C α and C β . Two atoms were considered to constitute a contact when their euclidean distances where below the given cut-off. In the C α model the backbone C α atom for each residue is chosen, whilst for the C β model the C β atom of the side chain of each residue is taken, except for Glycine where we use the C α atom.
For the reconstruction procedure we then need the contacts to be translated into distance restraints. Restraints were generated only for pairs of atoms corresponding to the contacts: C α atoms or C β atoms for each of the cases above. As upper bound of the restraint we used directly the distance cut-off, while for the lower bound value we used distance statistics derived from the PDB database. We proceeded by plotting the distance distribution for all C α or C β atoms and then choosing as our lower cutoff the value of the 90th percentile of the distribution.
The distance geometry procedure in TINKER is an implementation of the established distance geometry algorithms used for NMR protein structure determination, see . Crippen and Havel proposed the EMBED algorithm consisting of three steps: bounds smoothing, embedding and regularization (coordinate refinement). The bounds smoothing is the procedure by which the initial sparse set of distance restraints is extended to obtain a full set of distance ranges for all pairs of atoms. This is achieved by means of the triangle inequality starting from the distances of known pairs. Once distance restraints are found for all pairs one only needs to select at random a particular value from within the restraints. There are several strategies for this selection , the most effective one is metrization. To perform metrization one proceeds starting at a random atom, choosing distances for it and then readjusting the whole matrix through the triangle inequality procedure. By doing this for all atoms the result is a sampled distance matrix where the triangle inequality is fulfilled or in other words a metric matrix. Once we have a distance matrix of exact distances for all pair of atoms a very good approximation of the 3-dimensional embedding can be obtained through the 3 largest eigenvalues of a certain transformation of the distance matrix. The result of the embedding is a good solution to the given distance restraints, however the geometry of the molecule is still not good enough especially with regards to the bond distances and angles. Thus the need for a final regularization step consisting in the minimization of an error function of the restraint violations usually done through simulated annealing.
In the selection of the data set we aimed at covering a diverse set of structures to ensure generality of the results obtained. We used a non-redundant PDB dataset of 60 proteins selected from SCOP release 1.73 . Only monomeric, monodomain proteins from the four main SCOP classes and from highly populated folds are chosen. All proteins have resolutions better than 3.0Å, R-factor lower than 0.3 as well as no missing or ambiguous conformational data. A subset of 12 proteins, three per SCOP class, is selected from the dataset as used by Sathyapriya et al. . From each group of 3 proteins, two fall in the size range of 100 - 120 amino acids and the third is three times as big as the other two. The PDB codes of the subset of proteins are given in Table 1.
The authors would like to thank Dan Bolser for stimulating and fruitful discussions about the project.
- Phillips DC: The development of crystallographic enzymology. Biochem Soc Symp 1970, 30: 11–28.PubMedGoogle Scholar
- Nishikawa K, Ooi T, Isogai Y, Saito N: Tertiary Structure of Proteins. I. Representation and Computation of the Conformations. Journal of the Physical Society of Japan 1972, 32: 1331–1337. 10.1143/JPSJ.32.1331View ArticleGoogle Scholar
- Caprara A, Carr R, Istrail S, Lancia G, Walenz B: 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap. J Comput Biol 2004, 11: 27–52. 10.1089/106652704773416876View ArticlePubMedGoogle Scholar
- Holm L, Sander C: Protein structure comparison by alignment of distance matrices. J Mol Biol 1993, 233: 123–138. 10.1006/jmbi.1993.1489View ArticlePubMedGoogle Scholar
- Alexandrov N, Shindyalov I: PDP: protein domain parser. Bioinformatics 2003, 19(3):429–430. 10.1093/bioinformatics/btg006View ArticlePubMedGoogle Scholar
- Emmert-Streib F, Mushegian A: A topological algorithm for identification of structural domains of proteins. BMC Bioinformatics 2007, 8: 237. 10.1186/1471-2105-8-237View ArticlePubMedPubMed CentralGoogle Scholar
- Karchin R, Cline M, Karplus K: Evaluation of local structure alphabets based on residue burial. Proteins 2004, 55(3):508–518. 10.1002/prot.20008View ArticlePubMedGoogle Scholar
- Benkert P, Tosatto SCE, Schomburg D: QMEAN: A comprehensive scoring function for model quality assessment. Proteins 2008, 71: 261–277. 10.1002/prot.21715View ArticlePubMedGoogle Scholar
- Bolser DM, Filippis I, Stehr H, Duarte J, Lappe M: Residue contact-count potentials are as effective as residue-residue contact-type potentials for ranking protein decoys. BMC Struct Biol 2008, 8: 53. 10.1186/1472-6807-8-53View ArticlePubMedPubMed CentralGoogle Scholar
- Melo F, Sánchez R, Sali A: Statistical potentials for fold assessment. Protein Sci 2002, 11(2):430–448. 10.1110/ps.25502View ArticlePubMedPubMed CentralGoogle Scholar
- Heringa J, Argos P: Side-chain clusters in protein structures and their role in protein folding. J Mol Biol 1991, 220: 151–171. 10.1016/0022-2836(91)90388-MView ArticlePubMedGoogle Scholar
- Capriotti E, Fariselli P, Rossi I, Casadio R: A three-state prediction of single point mutations on protein stability changes. BMC Bioinformatics 2008, (9 Suppl 2):S6. 10.1186/1471-2105-9-S2-S6Google Scholar
- Sathyapriya R, Vijayabaskar MS, Vishveshwara S: Insights into protein-DNA interactions through structure network analysis. PLoS Comput Biol 2008, 4(9):e1000170. 10.1371/journal.pcbi.1000170View ArticlePubMedPubMed CentralGoogle Scholar
- Punta M, Rost B: PROFcon: novel prediction of long-range contacts. Bioinformatics 2005, 21(13):2960–2968. 10.1093/bioinformatics/bti454View ArticlePubMedGoogle 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-113View ArticlePubMedPubMed CentralGoogle 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 Suppl 1):S62-S70.Google Scholar
- Fariselli P, Casadio R: A neural network based predictor of residue contacts in proteins. Protein Eng 1999, 12: 15–21. 10.1093/protein/12.1.15View ArticlePubMedGoogle Scholar
- Bartoli L, Capriotti E, Fariselli P, Martelli PL, Casadio R: The pros and cons of predicting protein contact maps. Methods Mol Biol 2008, 413: 199–217. full_textPubMedGoogle Scholar
- Blumenthal LM: Theory and Applications of Distance Geometry. Oxford University Press, Oxford; 1953.Google Scholar
- Crippen GHHT: Distance Geometry and Molecular Conformation. John Wiley & Sons, New York; 1988.Google Scholar
- Wüthrich K: Protein structure determination in solution by nuclear magnetic resonance spectroscopy. Science 1989, 243(4887):45–50. 10.1126/science.2911719View ArticlePubMedGoogle Scholar
- Glunt W, Hayden TL, Raydan M: Molecular conformations from distance matrices. J Comput Chem 1993, 14: 114–120. 10.1002/jcc.540140115View ArticleGoogle Scholar
- Wu D, Wu Z: An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data. J of Global Optimization 2007, 37(4):661–673. 10.1007/s10898-006-9080-6View ArticleGoogle Scholar
- Saitoh S, Nakai T, Nishikawa K: A geometrical constraint approach for reproducing the native backbone conformation of a protein. Proteins 1993, 15(2):191–204. 10.1002/prot.340150209View ArticlePubMedGoogle Scholar
- Vendruscolo M, Kussell E, Domany E: Recovery of protein structure from contact maps. Fold Des 1997, 2(5):295–306. 10.1016/S1359-0278(97)00041-2View ArticlePubMedGoogle 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. 10.1109/TCBB.2008.27View ArticlePubMedGoogle Scholar
- Zemla A, Venclovas C, Moult J, Fidelis K: Processing and analysis of CASP3 protein structure predictions. Proteins 1999, (Suppl 3):22–29. 10.1002/(SICI)1097-0134(1999)37:3+<22::AID-PROT5>3.0.CO;2-WGoogle Scholar
- Gromiha MM, Selvaraj S: Comparison between long-range interactions and contact order in determining the folding rate of two-state proteins: application of long-range order to folding rate prediction. J Mol Biol 2001, 310: 27–32. 10.1006/jmbi.2001.4775View ArticlePubMedGoogle Scholar
- Vendruscolo M, Najmanovich R, Domany E: Can a pairwise contact potential stabilize native protein folds against decoys obtained by threading? Proteins 2000, 38(2):134–148. 10.1002/(SICI)1097-0134(20000201)38:2<134::AID-PROT3>3.0.CO;2-AView ArticlePubMedGoogle Scholar
- Sathyapriya R, Duarte JM, Stehr H, Filippis I, Lappe M: Defining an Essence of Structure Determining Residue Contacts in Proteins. PLoS Comput Biol 2009, 5(12):e1000584. 10.1371/journal.pcbi.1000584View ArticlePubMedPubMed CentralGoogle Scholar
- Chen Y, Ding F, Dokholyan NV: Fidelity of the protein structure reconstruction from inter-residue proximity constraints. J Phys Chem B 2007, 111(25):7432–7438. 10.1021/jp068963tView ArticlePubMedGoogle Scholar
- Graña O, Baker D, MacCallum RM, Meiler J, Punta M, Rost B, Tress ML, Valencia A: CASP6 assessment of contact prediction. Proteins 2005, (61 Suppl 7):214–224. 10.1002/prot.20739Google Scholar
- Havel TF, Snow ME: A new method for building protein conformations from sequence alignments with homologues of known structure. J Mol Biol 1991, 217: 1–7. 10.1016/0022-2836(91)90603-4View ArticlePubMedGoogle Scholar
- Aszódi A, Taylor WR: Homology modelling by distance geometry. Fold Des 1996, 1(5):325–334. 10.1016/S1359-0278(96)00048-XView ArticlePubMedGoogle Scholar
- Sali A, Blundell TL: Comparative protein modelling by satisfaction of spatial restraints. J Mol Biol 1993, 234(3):779–815. 10.1006/jmbi.1993.1626View ArticlePubMedGoogle Scholar
- Vassura M, Margara L, Lena PD, Medri F, Fariselli P, Casadio R: FT-COMAR: fault tolerant three-dimensional structure reconstruction from protein contact maps. Bioinformatics 2008, 24(10):1313–1315. 10.1093/bioinformatics/btn115View ArticlePubMedGoogle Scholar
- Stehr B, Duarte J, Filippis I, Rajagopal S, Syal K, Risbud S, Holm L, Lappe M: StruPPi: comparative modeling using consensus information from multiple templates and physics-based refinement. In Abstracts book, 8th Community Wide Experiment on the Critical Assessment of Techniques for Protein Structure Prediction Edited by: Moult J, Fidelis K, Kryshtafovych A, Rost B, Tramontano A. 2008.Google Scholar
- Ponder JW: TINKER - Software tools for molecular design, User's Guide for Version 4.2. Washington University School of Medicine; 2004.Google Scholar
- Hodsdon ME, Ponder JW, Cistola DP: The NMR solution structure of intestinal fatty acid-binding protein complexed with palmitate: application of a novel distance geometry algorithm. J Mol Biol 1996, 264(3):585–602. 10.1006/jmbi.1996.0663View ArticlePubMedGoogle Scholar
- Kuszewski J, Nilges M, Brnger AT: Sampling and efficiency of metric matrix distance geometry: a novel partial metrization algorithm. J Biomol NMR 1992, 2: 33–56. 10.1007/BF02192799View ArticlePubMedGoogle Scholar
- Murzin AG, Brenner SE, Hubbard T, Chothia C: SCOP: a structural classification of proteins database for the investigation of sequences and structures. J Mol Biol 1995, 247(4):536–540.PubMedGoogle 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.