Prediction of Structural and Functional Aspects of Protein

Author(s):  
Arun G. Ingale

To predict the structure of protein from a primary amino acid sequence is computationally difficult. An investigation of the methods and algorithms used to predict protein structure and a thorough knowledge of the function and structure of proteins are critical for the advancement of biology and the life sciences as well as the development of better drugs, higher-yield crops, and even synthetic bio-fuels. To that end, this chapter sheds light on the methods used for protein structure prediction. This chapter covers the applications of modeled protein structures and unravels the relationship between pure sequence information and three-dimensional structure, which continues to be one of the greatest challenges in molecular biology. With this resource, it presents an all-encompassing examination of the problems, methods, tools, servers, databases, and applications of protein structure prediction, giving unique insight into the future applications of the modeled protein structures. In this chapter, current protein structure prediction methods are reviewed for a milieu on structure prediction, the prediction of structural fundamentals, tertiary structure prediction, and functional imminent. The basic ideas and advances of these directions are discussed in detail.

2017 ◽  
pp. 551-568
Author(s):  
Arun G. Ingale

To predict the structure of protein from a primary amino acid sequence is computationally difficult. An investigation of the methods and algorithms used to predict protein structure and a thorough knowledge of the function and structure of proteins are critical for the advancement of biology and the life sciences as well as the development of better drugs, higher-yield crops, and even synthetic bio-fuels. To that end, this chapter sheds light on the methods used for protein structure prediction. This chapter covers the applications of modeled protein structures and unravels the relationship between pure sequence information and three-dimensional structure, which continues to be one of the greatest challenges in molecular biology. With this resource, it presents an all-encompassing examination of the problems, methods, tools, servers, databases, and applications of protein structure prediction, giving unique insight into the future applications of the modeled protein structures. In this chapter, current protein structure prediction methods are reviewed for a milieu on structure prediction, the prediction of structural fundamentals, tertiary structure prediction, and functional imminent. The basic ideas and advances of these directions are discussed in detail.


Author(s):  
Jiaxi Liu ◽  

The prediction of protein three-dimensional structure from amino acid sequence has been a challenge problem in bioinformatics, owing to the many potential applications for robust protein structure prediction methods. Protein structure prediction is essential to bioscience, and its research results are important for other research areas. Methods for the prediction an才d design of protein structures have advanced dramatically. The prediction of protein structure based on average hydrophobic values is discussed and an improved genetic algorithm is proposed to solve the optimization problem of hydrophobic protein structure prediction. An adjustment operator is designed with the average hydrophobic value to prevent the overlapping of amino acid positions. Finally, some numerical experiments are conducted to verify the feasibility and effectiveness of the proposed algorithm by comparing with the traditional HNN algorithm.


Author(s):  
CHANDRAYANI N. ROKDE ◽  
DR.MANALI KSHIRSAGAR

Protein structure prediction (PSP) from amino acid sequence is one of the high focus problems in bioinformatics today. This is due to the fact that the biological function of the protein is determined by its three dimensional structure. The understanding of protein structures is vital to determine the function of a protein and its interaction with DNA, RNA and enzyme. Thus, protein structure is a fundamental area of computational biology. Its importance is intensed by large amounts of sequence data coming from PDB (Protein Data Bank) and the fact that experimentally methods such as X-ray crystallography or Nuclear Magnetic Resonance (NMR)which are used to determining protein structures remains very expensive and time consuming. In this paper, different types of protein structures and methods for its prediction are described.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Sarah E. Biehn ◽  
Steffen Lindert

AbstractHydroxyl radical protein footprinting (HRPF) in combination with mass spectrometry reveals the relative solvent exposure of labeled residues within a protein, thereby providing insight into protein tertiary structure. HRPF labels nineteen residues with varying degrees of reliability and reactivity. Here, we are presenting a dynamics-driven HRPF-guided algorithm for protein structure prediction. In a benchmark test of our algorithm, usage of the dynamics data in a score term resulted in notable improvement of the root-mean-square deviations of the lowest-scoring ab initio models and improved the funnel-like metric Pnear for all benchmark proteins. We identified models with accurate atomic detail for three of the four benchmark proteins. This work suggests that HRPF data along with side chain dynamics sampled by a Rosetta mover ensemble can be used to accurately predict protein structure.


2016 ◽  
Vol 24 (4) ◽  
pp. 577-607 ◽  
Author(s):  
Mario Garza-Fabre ◽  
Shaun M. Kandathil ◽  
Julia Handl ◽  
Joshua Knowles ◽  
Simon C. Lovell

Computational approaches to de novo protein tertiary structure prediction, including those based on the preeminent “fragment-assembly” technique, have failed to scale up fully to larger proteins (on the order of 100 residues and above). A number of limiting factors are thought to contribute to the scaling problem over and above the simple combinatorial explosion, but the key ones relate to the lack of exploration of properly diverse protein folds, and to an acute form of “deception” in the energy function, whereby low-energy conformations do not reliably equate with native structures. In this article, solutions to both of these problems are investigated through a multistage memetic algorithm incorporating the successful Rosetta method as a local search routine. We found that specialised genetic operators significantly add to structural diversity and that this translates well to reaching low energies. The use of a generalised stochastic ranking procedure for selection enables the memetic algorithm to handle and traverse deep energy wells that can be considered deceptive, which further adds to the ability of the algorithm to obtain a much-improved diversity of folds. The results should translate to a tangible improvement in the performance of protein structure prediction algorithms in blind experiments such as CASP, and potentially to a further step towards the more challenging problem of predicting the three-dimensional shape of large proteins.


2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Siyuan Liu ◽  
Tong Wang ◽  
Qijiang Xu ◽  
Bin Shao ◽  
Jian Yin ◽  
...  

Abstract Background Fragment libraries play a key role in fragment-assembly based protein structure prediction, where protein fragments are assembled to form a complete three-dimensional structure. Rich and accurate structural information embedded in fragment libraries has not been systematically extracted and used beyond fragment assembly. Methods To better leverage the valuable structural information for protein structure prediction, we extracted seven types of structural information from fragment libraries. We broadened the usage of such structural information by transforming fragment libraries into protein-specific potentials for gradient-descent based protein folding and encoding fragment libraries as structural features for protein property prediction. Results Fragment libraires improved the accuracy of protein folding and outperformed state-of-the-art algorithms with respect to predicted properties, such as torsion angles and inter-residue distances. Conclusion Our work implies that the rich structural information extracted from fragment libraries can complement sequence-derived features to help protein structure prediction.


Author(s):  
Leonardo de Lima Corrêa ◽  
Márcio Dorn

Tertiary protein structure prediction in silico is currently a challenging problem in Structural Bioinformatics and can be classified according to the computational complexity theory as an NP-hard problem. Determining the 3-D structure of a protein is both experimentally expensive, and time-consuming. The agent-based paradigm has been shown a useful technique for the applications that have repetitive and time-consuming activities, knowledge share and management, such as integration of different knowledge sources and modeling of complex systems, supporting a great variety of domains. This chapter provides an integrated view and insights about the protein structure prediction area concerned to the usage, application and implementation of multi-agent systems to predict the protein structures or to support and coordinate the existing predictors, as well as it is advantages, issues, needs, and demands. It is noteworthy that there is a great need for works related to multi-agent and agent-based paradigms applied to the problem due to their excellent suitability to the problem.


2007 ◽  
Vol 5 (21) ◽  
pp. 387-396 ◽  
Author(s):  
Glennie Helles

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.


Biotechnology ◽  
2019 ◽  
pp. 1031-1068
Author(s):  
Leonardo de Lima Corrêa ◽  
Márcio Dorn

Tertiary protein structure prediction in silico is currently a challenging problem in Structural Bioinformatics and can be classified according to the computational complexity theory as an NP-hard problem. Determining the 3-D structure of a protein is both experimentally expensive, and time-consuming. The agent-based paradigm has been shown a useful technique for the applications that have repetitive and time-consuming activities, knowledge share and management, such as integration of different knowledge sources and modeling of complex systems, supporting a great variety of domains. This chapter provides an integrated view and insights about the protein structure prediction area concerned to the usage, application and implementation of multi-agent systems to predict the protein structures or to support and coordinate the existing predictors, as well as it is advantages, issues, needs, and demands. It is noteworthy that there is a great need for works related to multi-agent and agent-based paradigms applied to the problem due to their excellent suitability to the problem.


Sign in / Sign up

Export Citation Format

Share Document