scholarly journals A Constraint Solver for Flexible Protein Model

2013 ◽  
Vol 48 ◽  
pp. 953-1000 ◽  
Author(s):  
F. Campeotto ◽  
A. Dal Palù ◽  
A. Dovier ◽  
F. Fioretto ◽  
E. Pontelli
Keyword(s):  
Structure Prediction ◽  
Dimensional Space ◽  
Protein Structures ◽  
Empirical Evaluation ◽  
Geometric Constraints ◽  
Conformational Space ◽  
Loop Modeling ◽  
Geometric Properties ◽  
Constraint Solver ◽  
Multi Body

This paper proposes the formalization and implementation of a novel class of constraints aimed at modeling problems related to placement of multi-body systems in the 3-dimensional space. Each multi-body is a system composed of body elements, connected by joint relationships and constrained by geometric properties. The emphasis of this investigation is the use of multi-body systems to model native conformations of protein structures---where each body represents an entity of the protein (e.g., an amino acid, a small peptide) and the geometric constraints are related to the spatial properties of the composing atoms. The paper explores the use of the proposed class of constraints to support a variety of different structural analysis of proteins, such as loop modeling and structure prediction. The declarative nature of a constraint-based encoding provides elaboration tolerance and the ability to make use of any additional knowledge in the analysis studies. The filtering capabilities of the proposed constraints also allow to control the number of representative solutions that are withdrawn from the conformational space of the protein, by means of criteria driven by uniform distribution sampling principles. In this scenario it is possible to select the desired degree of precision and/or number of solutions. The filtering component automatically excludes configurations that violate the spatial and geometric properties of the composing multi-body system. The paper illustrates the implementation of a constraint solver based on the multi-body perspective and its empirical evaluation on protein structure analysis problems.

Improved Sampling Strategies for Protein Model Refinement based on Molecular Dynamics Simulation

2020 ◽  
Author(s):  
Lim Heo ◽  
Collin Arbour ◽  
Michael Feig
Keyword(s):  
Molecular Dynamics ◽  
Molecular Dynamics Simulation ◽  
Structure Prediction ◽  
Protein Structures ◽  
Conformational Space ◽  
Dynamics Simulation ◽  
Model Refinement ◽  
Protein Model ◽  
Lower Accuracy ◽  
Simulation Based

Protein structures provide valuable information for understanding biological processes. Protein structures can be determined by experimental methods such as X-ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, or cryogenic electron microscopy. As an alternative, in silico methods can be used to predict protein structures. Those methods utilize protein structure databases for structure prediction via template-based modeling or for training machine-learning models to generate predictions. Structure prediction for proteins distant from proteins with known structures often results in lower accuracy with respect to the true physiological structures. Physics-based protein model refinement methods can be applied to improve model accuracy in the predicted models. Refinement methods rely on conformational sampling around the predicted structures, and if structures closer to the native states are sampled, improvements in the model quality become possible. Molecular dynamics simulations have been especially successful for improving model qualities but although consistent refinement can be achieved, the improvements in model qualities are still moderate. To extend the refinement performance of a simulation-based protocol, we explored new schemes that focus on an optimized use of biasing functions and the application of increased simulation temperatures. In addition, we tested the use of alternative initial models so that the simulations can explore conformational space more broadly. Based on the insight of this analysis we are proposing a new refinement protocol that significantly outperformed previous state-of-the-art molecular dynamics simulation-based protocols in the benchmark tests described here. <br>

KORP: knowledge-based 6D potential for fast protein and loop modeling

2019 ◽  
Vol 35 (17) ◽  
pp. 3013-3019 ◽  
Author(s):  
José Ramón López-Blanco ◽  
Pablo Chacón
Keyword(s):  
Structure Prediction ◽  
Protein Structures ◽  
Joint Probability ◽  
Protein Modeling ◽  
Supplementary Information ◽  
Joint Probability Distribution ◽  
Loop Modeling ◽  
Statistical Potentials ◽  
Knowledge Based ◽  
Backbone Atoms

Abstract Motivation Knowledge-based statistical potentials constitute a simpler and easier alternative to physics-based potentials in many applications, including folding, docking and protein modeling. Here, to improve the effectiveness of the current approximations, we attempt to capture the six-dimensional nature of residue–residue interactions from known protein structures using a simple backbone-based representation. Results We have developed KORP, a knowledge-based pairwise potential for proteins that depends on the relative position and orientation between residues. Using a minimalist representation of only three backbone atoms per residue, KORP utilizes a six-dimensional joint probability distribution to outperform state-of-the-art statistical potentials for native structure recognition and best model selection in recent critical assessment of protein structure prediction and loop-modeling benchmarks. Compared with the existing methods, our side-chain independent potential has a lower complexity and better efficiency. The superior accuracy and robustness of KORP represent a promising advance for protein modeling and refinement applications that require a fast but highly discriminative energy function. Availability and implementation http://chaconlab.org/modeling/korp. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Developing a Fully-glycosylated Full-length SARS-CoV-2 Spike Protein Model in a Viral Membrane

2020 ◽  
Author(s):  
Hyeonuk Woo ◽  
Sang-Jun Park ◽  
Yeol Kyo Choi ◽  
Taeyong Park ◽  
Maham Tanveer ◽  
...  
Keyword(s):  
Modeling And Simulation ◽  
Structure Prediction ◽  
De Novo ◽  
Protein Structures ◽  
Full Length ◽  
Loop Modeling ◽  
S Protein ◽  
Viral Membrane ◽  
Protein Model ◽  
Dynamics Simulations

ABSTRACTThis technical study describes all-atom modeling and simulation of a fully-glycosylated full-length SARS-CoV-2 spike (S) protein in a viral membrane. First, starting from PDB:6VSB and 6VXX, full-length S protein structures were modeled using template-based modeling, de-novo protein structure prediction, and loop modeling techniques in GALAXY modeling suite. Then, using the recently-determined most occupied glycoforms, 22 N-glycans and 1 O-glycan of each monomer were modeled using Glycan Reader & Modeler in CHARMM-GUI. These fully-glycosylated full-length S protein model structures were assessed and further refined against the low-resolution data in their respective experimental maps using ISOLDE. We then used CHARMM-GUI Membrane Builder to place the S proteins in a viral membrane and performed all-atom molecular dynamics simulations. All structures are available in CHARMM-GUI COVID-19 Archive (http://www.charmm-gui.org/docs/archive/covid19), so researchers can use these models to carry out innovative and novel modeling and simulation research for the prevention and treatment of COVID-19.

scholarly journals A distance geometry-based description and validation of protein main-chain conformation

IUCrJ ◽  
2017 ◽  
Vol 4 (5) ◽  
pp. 657-670 ◽  
Author(s):  
Joana Pereira ◽  
Victor S. Lamzin
Keyword(s):  
Main Chain ◽  
Dimensional Space ◽  
Distance Geometry ◽  
Protein Structures ◽  
Three Dimensional ◽  
Principal Component ◽  
Data Bank ◽  
Conformational Space ◽  
Protein Backbone ◽  
Space Forms

Understanding the protein main-chain conformational space forms the basis for the modelling of protein structures and for the validation of models derived from structural biology techniques. Presented here is a novel idea for a three-dimensional distance geometry-based metric to account for the fine details of protein backbone conformations. The metrics are computed for dipeptide units, defined as blocks of Cαi−1—Oi−1—Cαi—Oi—Cαi+1atoms, by obtaining the eigenvalues of their Euclidean distance matrices. These were computed for ∼1.3 million dipeptide units collected from nonredundant good-quality structures in the Protein Data Bank and subjected to principal component analysis. The resulting new Euclidean orthogonal three-dimensional space (DipSpace) allows a probabilistic description of protein backbone geometry. The three axes of the DipSpace describe the local extension of the dipeptide unit structure, its twist and its bend. By using a higher-dimensional metric, the method is efficient for the identification of Cαatoms in an unlikely or unusual geometrical environment, and its use for both local and overall validation of protein models is demonstrated. It is also shown, for the example of trypsin proteases, that the detection of unusual conformations that are conserved among the structures of this protein family may indicate geometrically strained residues of potentially functional importance.

Improved Sampling Strategies for Protein Model Refinement based on Molecular Dynamics Simulation

2020 ◽  
Author(s):  
Lim Heo ◽  
Collin Arbour ◽  
Michael Feig
Keyword(s):  
Molecular Dynamics ◽  
Molecular Dynamics Simulation ◽  
Structure Prediction ◽  
Protein Structures ◽  
Conformational Space ◽  
Dynamics Simulation ◽  
Model Refinement ◽  
Protein Model ◽  
Lower Accuracy ◽  
Simulation Based

Protein structures provide valuable information for understanding biological processes. Protein structures can be determined by experimental methods such as X-ray crystallography, nuclear magnetic resonance (NMR) spectroscopy, or cryogenic electron microscopy. As an alternative, in silico methods can be used to predict protein structures. Those methods utilize protein structure databases for structure prediction via template-based modeling or for training machine-learning models to generate predictions. Structure prediction for proteins distant from proteins with known structures often results in lower accuracy with respect to the true physiological structures. Physics-based protein model refinement methods can be applied to improve model accuracy in the predicted models. Refinement methods rely on conformational sampling around the predicted structures, and if structures closer to the native states are sampled, improvements in the model quality become possible. Molecular dynamics simulations have been especially successful for improving model qualities but although consistent refinement can be achieved, the improvements in model qualities are still moderate. To extend the refinement performance of a simulation-based protocol, we explored new schemes that focus on an optimized use of biasing functions and the application of increased simulation temperatures. In addition, we tested the use of alternative initial models so that the simulations can explore conformational space more broadly. Based on the insight of this analysis we are proposing a new refinement protocol that significantly outperformed previous state-of-the-art molecular dynamics simulation-based protocols in the benchmark tests described here. <br>

scholarly journals Including Functional Annotations and Extending the Collection of Structural Classifications of Protein Loops (ArchDB)

2007 ◽  
Vol 1 ◽  
pp. 117793220700100 ◽  
Author(s):  
Antoni Hermoso ◽  
Jordi Espadaler ◽  
E Enrique Querol ◽  
Francesc X. Aviles ◽  
Michael J.E. Sternberg ◽  
...  
Keyword(s):  
Protein Function ◽  
Structure Prediction ◽  
Sequence Similarity ◽  
Protein Structures ◽  
Fold Increase ◽  
Loop Structure ◽  
Biological Databases ◽  
Loop Modeling ◽  
And Function

Loops represent an important part of protein structures. The study of loop is critical for two main reasons: First, loops are often involved in protein function, stability and folding. Second, despite improvements in experimental and computational structure prediction methods, modeling the conformation of loops remains problematic. Here, we present a structural classification of loops, ArchDB, a mine of information with application in both mentioned fields: loop structure prediction and function prediction. ArchDB ( http://sbi.imim.es/archdb ) is a database of classified protein loop motifs. The current database provides four different classification sets tailored for different purposes. ArchDB-40, a loop classification derived from SCOP40, well suited for modeling common loop motifs. Since features relevant to loop structure or function can be more easily determined on well-populated clusters, we have developed ArchDB-95, a loop classification derived from SCOP95. This new classification set shows a ~40% increase in the number of subclasses, and a large 7-fold increase in the number of putative structure/function-related subclasses. We also present ArchDB-EC, a classification of loop motifs from enzymes, and ArchDB-KI, a manually annotated classification of loop motifs from kinases. Information about ligand contacts and PDB sites has been included in all classification sets. Improvements in our classification scheme are described, as well as several new database features, such as the ability to query by conserved annotations, sequence similarity, or uploading 3D coordinates of a protein. The lengths of classified loops range between 0 and 36 residues long. ArchDB offers an exhaustive sampling of loop structures. Functional information about loops and links with related biological databases are also provided. All this information and the possibility to browse/query the database through a web-server outline an useful tool with application in the comparative study of loops, the analysis of loops involved in protein function and to obtain templates for loop modeling.

An Approach to a 2D/3D Geometric Constraint Solver

2000 ◽  
Author(s):  
Chen Liping ◽  
Peng Xiaobo ◽  
Wang Boxing ◽  
Zhou Fanli
Keyword(s):  
Directed Graph ◽  
Algebraic Structure ◽  
Geometric Constraints ◽  
Graph Representation ◽  
System Component ◽  
Design Phase ◽  
Body System ◽  
Constraint Solver ◽  
Constraint System ◽  
Multi Body

Abstract With the Euler parameter expression in multi-body system, component expressions of constraint relations are presented. Based on directed graph representation of geometry constraint system and decomposition technology of sparse algebraic structure, a modeling method of 2D/3D geometric constraints is advanced. Finally, an optimal decomposition of general underconstrained geometric system which is common especially in primary design phase is realized.

Are distance-dependent statistical potentials considering three interacting bodies superior to two-body statistical potentials for protein structure prediction?

2014 ◽  
Vol 12 (05) ◽  
pp. 1450022 ◽  
Author(s):  
Hamed Tabatabaei Ghomi ◽  
Jared J. Thompson ◽  
Markus A. Lill
Keyword(s):  
Free Energy ◽  
Protein Structure ◽  
Protein Structure Prediction ◽  
Structure Prediction ◽  
Protein Structures ◽  
Coarse Grained ◽  
Scoring Functions ◽  
Statistical Potentials ◽  
Three Body ◽  
Multi Body

Distance-based statistical potentials have long been used to model condensed matter systems, e.g. as scoring functions in differentiating native-like protein structures from decoys. These scoring functions are based on the assumption that the total free energy of the protein can be calculated as the sum of pairwise free energy contributions derived from a statistical analysis of pair-distribution functions. However, this fundamental assumption has been challenged theoretically. In fact the free energy of a system with N particles is only exactly related to the N-body distribution function. Based on this argument coarse-grained multi-body statistical potentials have been developed to capture higher-order interactions. Having a coarse representation of the protein and using geometric contacts instead of pairwise interaction distances renders these models insufficient in modeling details of multi-body effects. In this study, we investigated if extending distance-dependent pairwise atomistic statistical potentials to corresponding interaction functions that are conditional on a third interacting body, defined as quasi-three-body statistical potentials, could model details of three-body interactions. We also tested if this approach could improve the predictive capabilities of statistical scoring functions for protein structure prediction. We analyzed the statistical dependency between two simultaneous pairwise interactions and showed that there is surprisingly little if any dependency of a third interacting site on pairwise atomistic statistical potentials. Also the protein structure prediction performance of these quasi-three-body potentials is comparable with their corresponding two-body counterparts. The scoring functions developed in this study showed better or comparable performances compared to some widely used scoring functions for protein structure prediction.

Deep learning methods for protein prediction problem

2017 ◽  
Author(s):  
◽  
Son Phong Nguyen
Keyword(s):  
Neural Networks ◽  
Deep Learning ◽  
Convolutional Neural Networks ◽  
Structure Prediction ◽  
State Of The Art ◽  
Protein Structures ◽  
Distance Matrix ◽  
Loop Modeling ◽  
Deep Convolutional Neural Networks

[ACCESS RESTRICTED TO THE UNIVERSITY OF MISSOURI AT AUTHOR'S REQUEST.] Computational protein structure prediction is very important for many applications in bioinformatics. Many prediction methods have been developed, including Modeller, HHpred, I-TASSER, Robetta, and MUFOLD. In the process of predicting protein structures, it is essential to accurately assess the quality of generated models. Consensus quality assessment (QA) methods, such as Pcons-net and MULTICOM-refine, which are based on structure similarity, performed well on QA tasks. The drawback of consensus QA methods is that they require a pool of diverse models to work well, which is not always available. More importantly, they cannot evaluate the quality of a single protein model, which is a very common task in protein predictions and other applications. Although many single-model quality assessment methods, such as ProQ2, MQAPmulti, OPUS-CA, DOPE, DFIRE, and RW, etc. have been developed to address that problem, their accuracy is not good enough for most real applications. In this dissertation, based on the idea of using C-[alpha] atoms distance matrix and deep learning methods, two methods have been proposed for assessing quality of protein structures. First, a novel algorithm based on deep learning techniques, called DL-Pro, is proposed. From training examples of distance matrices corresponding to good and bad models, DL-Pro learns a stacked autoencoder network as a classifier. In experiments on selected targets from the Critical Assessment of Structure Prediction (CASP) competition, DL-Pro obtained promising results, outperforming state-of-the-art energy/scoring functions, including OPUS-CA, DOPE, DFIRE, and RW. Second, a new method DeepCon-QA is developed to predict quality of single protein model. Based on the idea of using protein vector representation and distance matrix, DeepCon-QA was able to achieve comparable performance with the best state-of-the-art QA method in our experiments. It also takes advantage the strength of deep convolutional neural networks to “learn” and “understand” the input data to be able to predict output data precisely. On the other hand, this dissertation also proposes several new methods for solving loop modeling problem. Five new loop modeling methods based on machine learning techniques, called NearLooper, ConLooper, ResLooper, HyLooper1 and HyLooper2 are proposed. NearLooper is based on the nearest neighbor technique; ConLooper applies deep convolutional neural networks to predict Cα atoms distance matrix as an orientation-independent representation of protein structure; ResLooper uses residual neural networks instead of deep convolutional neural networks; HyLooper1 combines the results of NearLooper and ConLooper while HyLooper2 combines NearLooper and ResLooper. Three commonly used benchmarks for loop modeling are used to compare the performance between these methods and existing state-of-the-art methods. The experiment results show promising performance in which our best method improves existing state-of-the-art methods by 28% and 54% of average RMSD on two datasets while being comparable on the other one.

Sequence Specific Dihedral Angle Distribution: Application in Protein Structure Prediction and Evaluation

1970 ◽  
Vol 19 (2) ◽  
pp. 217-226
Author(s):  
S. M. Minhaz Ud-Dean ◽  
Mahdi Muhammad Moosa
Keyword(s):  
Protein Structure ◽  
Dihedral Angle ◽  
Protein Structure Prediction ◽  
Structure Prediction ◽  
Protein Structures ◽  
Angle Distribution ◽  
Ramachandran Plot ◽  
Specific Data ◽  
Specific Distribution ◽  
Structure Evaluation

Protein structure prediction and evaluation is one of the major fields of computational biology. Estimation of dihedral angle can provide information about the acceptability of both theoretically predicted and experimentally determined structures. Here we report on the sequence specific dihedral angle distribution of high resolution protein structures available in PDB and have developed Sasichandran, a tool for sequence specific dihedral angle prediction and structure evaluation. This tool will allow evaluation of a protein structure in pdb format from the sequence specific distribution of Ramachandran angles. Additionally, it will allow retrieval of the most probable Ramachandran angles for a given sequence along with the sequence specific data. Key words: Torsion angle, φ-ψ distribution, sequence specific ramachandran plot, Ramasekharan, protein structure appraisal D.O.I. 10.3329/ptcb.v19i2.5439 Plant Tissue Cult. & Biotech. 19(2): 217-226, 2009 (December)

Sign in / Sign up

Export Citation Format

Share Document