scholarly journals Basic protein structure prediction for the biologist: A review

2010 ◽  
Vol 62 (4) ◽  
pp. 857-871 ◽  
Author(s):  
M. Mihăşan

As the field of protein structure prediction continues to expand at an exponential rate, the bench-biologist might feel overwhelmed by the sheer range of available applications. This review presents the three main approaches in computational structure prediction from a non-bioinformatician?s point of view and makes a selection of tools and servers freely available. These tools are evaluated from several aspects, such as number of citations, ease of usage and quality of the results. Finally, the applications of models generated by computational structure prediction are discussed.

Author(s):  
Raghunath Satpathy

Proteins play a vital molecular role in all living organisms. Experimentally, it is difficult to predict the protein structure, however alternatively theoretical prediction method holds good for it. The 3D structure prediction of proteins is very much important in biology and this leads to the discovery of different useful drugs, enzymes, and currently this is considered as an important research domain. The prediction of proteins is related to identification of its tertiary structure. From the computational point of view, different models (protein representations) have been developed along with certain efficient optimization methods to predict the protein structure. The bio-inspired computation is used mostly for optimization process during solving protein structure. These algorithms now a days has received great interests and attention in the literature. This chapter aim basically for discussing the key features of recently developed five different types of bio-inspired computational algorithms, applied in protein structure prediction problems.


2021 ◽  
Author(s):  
Ben Geoffrey A S

This work seeks to combine the combined advantage of leveraging these emerging areas of Artificial Intelligence and quantum computing in applying it to solve the specific biological problem of protein structure prediction using Quantum Machine Learning algorithms. The CASP dataset from ProteinNet was downloaded which is a standardized data set for machine learning of protein structure. Its large and standardized dataset of PDB entries contains the coordinates of the backbone atoms, corresponding to the sequential chain of N, C_alpha, and C' atoms. This dataset was used to train a quantum-classical hybrid Keras deep neural network model to predict the structure of the proteins. To visually qualify the quality of the predicted versus the actual protein structure, protein contact maps were generated with the experimental and predicted protein structure data and qualified. Therefore this model is recommended for the use of protein structure prediction using AI leveraging the power of quantum computers. The code is provided in the following Github repository https://github.com/bengeof/Protein-structure-prediction-using-AI-and-quantum-computers.


2015 ◽  
Vol 83 (10) ◽  
pp. 1823-1835 ◽  
Author(s):  
Jiong Zhang ◽  
Bogdan Barz ◽  
Jingfen Zhang ◽  
Dong Xu ◽  
Ioan Kosztin

10.29007/j5p9 ◽  
2019 ◽  
Author(s):  
Ahmed Bin Zaman ◽  
Amarda Shehu

A central challenge in template-free protein structure prediction is controlling the quality of computed tertiary structures also known as decoys. Given the size, dimensionality, and inherent characteristics of the protein structure space, this is non-trivial. The current mechanism employed by decoy generation algorithms relies on generating as many decoys as can be afforded. This is impractical and uninformed by any metrics of interest on a decoy dataset. In this paper, we propose to equip a decoy generation algorithm with an evolving map of the protein structure space. The map utilizes low-dimensional representations of protein structure and serves as a memory whose granularity can be controlled. Evaluations on diverse target sequences show that drastic reductions in storage do not sacrifice decoy quality, indicating the promise of the proposed mechanism for decoy generation algorithms in template-free protein structure prediction.


2021 ◽  
Author(s):  
Mindaugas Margelevicius

A protocol ROPIUS0 for protein structure prediction and model selection is presented. At the core of the ROPIUS0 protocol is the deep learning module developed for the selection of protein structural models. It is shown that the direct use of predicted inter-residue distances may be sufficient to discriminate between correct and incorrect protein folds, considering only a small fraction of predicted distances. Having finished the latest CASP14 prediction season, a ROPIUS0 variant based on model selection ranks 13th in the category of tertiary structure prediction. Its performance is on par with top-performing automated prediction servers when tested on the CASP13 dataset. The results suggest ways to improve searching for structurally similar and homologous proteins without considerably increasing speed.


1970 ◽  
Vol 19 (2) ◽  
pp. 217-226
Author(s):  
S. M. Minhaz Ud-Dean ◽  
Mahdi Muhammad Moosa

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)


2020 ◽  
Vol 7 (2) ◽  
pp. 34-41
Author(s):  
VLADIMIR NIKONOV ◽  
◽  
ANTON ZOBOV ◽  

The construction and selection of a suitable bijective function, that is, substitution, is now becoming an important applied task, particularly for building block encryption systems. Many articles have suggested using different approaches to determining the quality of substitution, but most of them are highly computationally complex. The solution of this problem will significantly expand the range of methods for constructing and analyzing scheme in information protection systems. The purpose of research is to find easily measurable characteristics of substitutions, allowing to evaluate their quality, and also measures of the proximity of a particular substitutions to a random one, or its distance from it. For this purpose, several characteristics were proposed in this work: difference and polynomial, and their mathematical expectation was found, as well as variance for the difference characteristic. This allows us to make a conclusion about its quality by comparing the result of calculating the characteristic for a particular substitution with the calculated mathematical expectation. From a computational point of view, the thesises of the article are of exceptional interest due to the simplicity of the algorithm for quantifying the quality of bijective function substitutions. By its nature, the operation of calculating the difference characteristic carries out a simple summation of integer terms in a fixed and small range. Such an operation, both in the modern and in the prospective element base, is embedded in the logic of a wide range of functional elements, especially when implementing computational actions in the optical range, or on other carriers related to the field of nanotechnology.


2014 ◽  
Vol 3 (5) ◽  
Author(s):  
S. Reiisi ◽  
M. Hashemzade-chaleshtori ◽  
S. Reisi ◽  
H. Shahi ◽  
S. Parchami ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document