Protein structure prediction: combining de novo modeling with sparse experimental data

Neighborhood Preference of Amino Acids in Protein Structures and its Applications in Protein Structure Assessment

Amino acids form protein 3D structures in unique manners such that the folded structure is stable and functional under physiological conditions. Non-specific and non-covalent interactions between amino acids exhibit neighborhood preferences. Based on structural information from the protein data bank, a statistical energy function was derived to quantify amino acid neighborhood preferences. The neighborhood of one amino acid is defined by its contacting residues, and the energy function is determined by the neighboring residue types and relative positions. The neighborhood preference of amino acids was exploited to facilitate structural quality assessment, which was implemented in the neighborhood preference program NEPRE. The source codes are available via https://github.com/LiuLab-CSRC/NePre.

A review of ligand-based virtual screening web tools and screening algorithms in large molecular databases in the age of big data

Virtual screening has become a widely used technique for helping in drug discovery processes. The key to this success is its ability to aid in the identification of novel bioactive compounds by screening large molecular databases. Several web servers have emerged in the last few years supplying platforms to guide users in screening publicly accessible chemical databases in a reasonable time. In this review, we discuss a representative set of online virtual screening servers and their underlying similarity algorithms. Other related topics, such as molecular representation or freely accessible databases are also treated. The most relevant contributions to this review arise from critical discussions concerning the pros and cons of servers and algorithms, and the challenges that future works must solve in a virtual screening framework.

Finding the needle in the haystack: towards solving the protein-folding problem computationally

Prediction of protein tertiary structures from amino acid sequence and understanding the mechanisms of how proteins fold, collectively known as "the protein folding problem," has been a grand challenge in molecular biology for over half a century. Theories have been developed that provide us with an unprecedented understanding of protein folding mechanisms. However, computational simulation of protein folding is still difficult, and prediction of protein tertiary structure from amino acid sequence is an unsolved problem. Progress toward a satisfying solution has been slow due to challenges in sampling the vast conformational space and deriving sufficiently accurate energy functions. Nevertheless, several techniques and algorithms have been adopted to overcome these challenges, and the last two decades have seen exciting advances in enhanced sampling algorithms, computational power and tertiary structure prediction methodologies. This review aims at summarizing these computational techniques, specifically conformational sampling algorithms and energy approximations that have been frequently used to study protein-folding mechanisms or to de novo predict protein tertiary structures. We hope that this review can serve as an overview on how the protein-folding problem can be studied computationally and, in cases where experimental approaches are prohibitive, help the researcher choose the most relevant computational approach for the problem at hand. We conclude with a summary of current challenges faced and an outlook on potential future directions.

Predictive and Experimental Approaches for Elucidating Protein-Protein Interactions and Quaternary Structures

The elucidation of protein-protein interactions is vital for determining the function and action of quaternary protein structures. Here, we discuss the difficulty and importance of establishing protein quaternary structure and review in vitro and in silico methods for doing so. Determining the interacting partner proteins of predicted protein structures is very time-consuming when using in vitro methods, this can be somewhat alleviated by use of predictive methods. However, developing reliably accurate predictive tools has proved to be difficult. We review the current state of the art in predictive protein interaction software and discuss the problem of scoring and therefore ranking predictions. Current community-based predictive exercises are discussed in relation to the growth of protein interaction prediction as an area within these exercises. We suggest a fusion of experimental and predictive methods that make use of sparse experimental data to determine higher resolution predicted protein interactions as being necessary to drive forward development.

Computational methods in drug discovery

The process for drug discovery and development is challenging, time consuming and expensive. Computer-aided drug discovery (CADD) tools can act as a virtual shortcut, assisting in the expedition of this long process and potentially reducing the cost of research and development. Today CADD has become an effective and indispensable tool in therapeutic development. The human genome project has made available a substantial amount of sequence data that can be used in various drug discovery projects. Additionally, increasing knowledge of biological structures, as well as increasing computer power have made it possible to use computational methods effectively in various phases of the drug discovery and development pipeline. The importance of in silico tools is greater than ever before and has advanced pharmaceutical research. Here we present an overview of computational methods used in different facets of drug discovery and highlight some of the recent successes. In this review, both structure-based and ligand-based drug discovery methods are discussed. Advances in virtual high-throughput screening, protein structure prediction methods, protein-ligand docking, pharmacophore modeling and QSAR techniques are reviewed.

GDFuzz3D: a method for protein 3D structure reconstruction from contact maps, based on a non-Euclidean distance function

MOTIVATION

To date, only a few distinct successful approaches have been introduced to reconstruct a protein 3D structure from a map of contacts between its amino acid residues (a 2D contact map). Current algorithms can infer structures from information-rich contact maps that contain a limited fraction of erroneous predictions. However, it is difficult to reconstruct 3D structures from predicted contact maps that usually contain a high fraction of false contacts.

RESULTS

We describe a new, multi-step protocol that predicts protein 3D structures from the predicted contact maps. The method is based on a novel distance function acting on a fuzzy residue proximity graph, which predicts a 2D distance map from a 2D predicted contact map. The application of a Multi-Dimensional Scaling algorithm transforms that predicted 2D distance map into a coarse 3D model, which is further refined by typical modeling programs into an all-atom representation. We tested our approach on contact maps predicted de novo by MULTICOM, the top contact map predictor according to CASP10. We show that our method outperforms FT-COMAR, the state-of-the-art method for 3D structure reconstruction from 2D maps. For all predicted 2D contact maps of relatively low sensitivity (60-84%), GDFuzz3D generates more accurate 3D models, with the average improvement of 4.87 Å in terms of RMSD.

AVAILABILITY AND IMPLEMENTATION

GDFuzz3D server and standalone version are freely available at http://iimcb.genesilico.pl/gdserver/GDFuzz3D/.

CONTACT

iamb@genesilico.pl

SUPPLEMENTARY INFORMATION

Supplementary data are available at Bioinformatics online.

Computational modeling of membrane proteins

The determination of membrane protein (MP) structures has always trailed that of soluble proteins due to difficulties in their overexpression, reconstitution into membrane mimetics, and subsequent structure determination. The percentage of MP structures in the protein databank (PDB) has been at a constant 1-2% for the last decade. In contrast, over half of all drugs target MPs, only highlighting how little we understand about drug-specific effects in the human body. To reduce this gap, researchers have attempted to predict structural features of MPs even before the first structure was experimentally elucidated. In this review, we present current computational methods to predict MP structure, starting with secondary structure prediction, prediction of trans-membrane spans, and topology. Even though these methods generate reliable predictions, challenges such as predicting kinks or precise beginnings and ends of secondary structure elements are still waiting to be addressed. We describe recent developments in the prediction of 3D structures of both α-helical MPs as well as β-barrels using comparative modeling techniques, de novo methods, and molecular dynamics (MD) simulations. The increase of MP structures has (1) facilitated comparative modeling due to availability of more and better templates, and (2) improved the statistics for knowledge-based scoring functions. Moreover, de novo methods have benefited from the use of correlated mutations as restraints. Finally, we outline current advances that will likely shape the field in the forthcoming decade.

Correlation between protein sequence similarity and crystallization reagents in the biological macromolecule crystallization database

The protein structural entries grew far slower than the sequence entries. This is partly due to the bottleneck in obtaining diffraction quality protein crystals for structural determination using X-ray crystallography. The first step to achieve protein crystallization is to find out suitable chemical reagents. However, it is not an easy task. Exhausting trial and error tests of numerous combinations of different reagents mixed with the protein solution are usually necessary to screen out the pursuing crystallization conditions. Therefore, any attempts to help find suitable reagents for protein crystallization are helpful. In this paper, an analysis of the relationship between the protein sequence similarity and the crystallization reagents according to the information from the existing databases is presented. We extracted information of reagents and sequences from the Biological Macromolecule Crystallization Database (BMCD) and the Protein Data Bank (PDB) database, classified the proteins into different clusters according to the sequence similarity, and statistically analyzed the relationship between the sequence similarity and the crystallization reagents. The results showed that there is a pronounced positive correlation between them. Therefore, according to the correlation, prediction of feasible chemical reagents that are suitable to be used in crystallization screens for a specific protein is possible.

Elucidating the higher-order structure of biopolymers by structural probing and mass spectrometry: MS3D

Chemical probing represents a very versatile alternative for studying the structure and dynamics of substrates that are intractable by established high-resolution techniques. The implementation of MS-based strategies for the characterization of probing products has not only extended the range of applicability to virtually all types of biopolymers but has also paved the way for the introduction of new reagents that would not have been viable with traditional analytical platforms. As the availability of probing data is steadily increasing on the wings of the development of dedicated interpretation aids, powerful computational approaches have been explored to enable the effective utilization of such information to generate valid molecular models. This combination of factors has contributed to making the possibility of obtaining actual 3D structures by MS-based technologies (MS3D) a reality. Although approaches for achieving structure determination of unknown targets or assessing the dynamics of known structures may share similar reagents and development trajectories, they clearly involve distinctive experimental strategies, analytical concerns and interpretation paradigms. This Perspective offers a commentary on methods aimed at obtaining distance constraints for the modeling of full-fledged structures while highlighting common elements, salient distinctions and complementary capabilities exhibited by methods used in dynamics studies. We discuss critical factors to be addressed for completing effective structural determinations and expose possible pitfalls of chemical methods. We survey programs developed for facilitating the interpretation of experimental data and discuss possible computational strategies for translating sparse spatial constraints into all-atom models. Examples are provided to illustrate how the concerted application of very diverse probing techniques can lead to the solution of actual biological systems.

Study of a structurally similar kappa opioid receptor agonist and antagonist pair by molecular dynamics simulations

Among the structurally similar guanidinonaltrindole (GNTI) compounds, 5'-GNTI is an antagonist while 6'-GNTI is an agonist of the kappaOR opioid receptor. To explore how a subtle alteration of the ligand structure influences the receptor activity, we investigated two concurrent processes: the final steps of ligand binding at the receptor binding site and the initial steps of receptor activation. To trace these early activation steps, the membranous part of the receptor was built on an inactive receptor template while the extracellular loops were built using the ab initio CABS method. We used the simulated annealing procedure for ligand docking and all-atom molecular dynamics simulations to determine the immediate changes in the structure of the ligand-receptor complex. The binding of an agonist, in contrast to an antagonist, induced the breakage of the "3-7 lock" between helices TM3 and TM7. We also observed an action of the extended rotamer toggle switch which suggests that those two switches are interdependent.

Protein structure calculation with data imputation: the use of substitute restraints

The amount of experimental restraints e.g., NOEs is often too small for calculating high quality three-dimensional structures by restrained molecular dynamics. Considering this as a typical missing value problem we propose here a model based data imputation technique that should lead to an improved estimation of the correct structure. The novel automated method implemented in AUREMOL makes a more efficient use of the experimental information to obtain NMR structures with higher accuracy. It creates a large set of substitute restraints that are used either alone or together with the experimental restraints. The new approach was successfully tested on three examples: firstly, the Ras-binding domain of Byr2 from Schizosaccharomyces pombe, the mutant HPr (H15A) from Staphylococcus aureus, and a X-ray structure of human ubiquitin. In all three examples, the quality of the resulting final bundles was improved considerably by the use of additional substitute restraints, as assessed quantitatively by the calculation of RMSD values to the "true" structure and NMR R-factors directly calculated from the original NOESY spectra or the published diffraction data.

Contact prediction in protein modeling: scoring, folding and refinement of coarse-grained models

BACKGROUND

Several different methods for contact prediction succeeded within the Sixth Critical Assessment of Techniques for Protein Structure Prediction (CASP6). The most relevant were non-local contact predictions for targets from the most difficult categories: fold recognition-analogy and new fold. Such contacts could provide valuable structural information in case a template structure cannot be found in the PDB.

RESULTS

We described comprehensive tests of the effectiveness of contact data in various aspects of de novo modeling with CABS, an algorithm which was used successfully in CASP6 by the Kolinski-Bujnicki group. We used the predicted contacts in a simple scoring function for the post-simulation ranking of protein models and as a soft bias in the folding simulations and in the fold-refinement procedure. The latter approach turned out to be the most successful. The CABS force field used in the Replica Exchange Monte Carlo simulations cooperated with the true contacts and discriminated the false ones, which resulted in an improvement of the majority of Kolinski-Bujnicki's protein models. In the modeling we tested different sets of predicted contact data submitted to the CASP6 server. According to our results, the best performing were the contacts with the accuracy balanced with the coverage, obtained either from the best two predictors only or by a consensus from as many predictors as possible.

CONCLUSION

Our tests have shown that theoretically predicted contacts can be very beneficial for protein structure prediction. Depending on the protein modeling method, a contact data set applied should be prepared with differently balanced coverage and accuracy of predicted contacts. Namely, high coverage of contact data is important for the model ranking and high accuracy for the folding simulations.

A comparative study of the reported performance of ab initio protein structure prediction algorithms

Protein structure prediction is one of the major challenges in bioinformatics today. Throughout the past five decades, many different algorithmic approaches have been attempted, and although progress has been made the problem remains unsolvable even for many small proteins. While the general objective is to predict the three-dimensional structure from primary sequence, our current knowledge and computational power are simply insufficient to solve a problem of such high complexity. Some prediction algorithms do, however, appear to perform better than others, although it is not always obvious which ones they are and it is perhaps even less obvious why that is. In this review, the reported performance results from 18 different recently published prediction algorithms are compared. Furthermore, the general algorithmic settings most likely responsible for the difference in the reported performance are identified, and the specific settings of each of the 18 prediction algorithms are also compared. The average normalized r.m.s.d. scores reported range from 11.17 to 3.48. With a performance measure including both r.m.s.d. scores and CPU time, the currently best-performing prediction algorithm is identified to be the I-TASSER algorithm. Two of the algorithmic settings--protein representation and fragment assembly--were found to have definite positive influence on the running time and the predicted structures, respectively. There thus appears to be a clear benefit from incorporating this knowledge in the design of new prediction algorithms.