scholarly journals EROS-DOCK: protein–protein docking using exhaustive branch-and-bound rotational search

2019 ◽  
Vol 35 (23) ◽  
pp. 5003-5010 ◽  
Author(s):  
Maria Elisa Ruiz Echartea ◽  
Isaure Chauvot de Beauchêne ◽  
David W Ritchie
Keyword(s):  
Force Field ◽  
Branch And Bound ◽  
3D Structure ◽  
Quality Criteria ◽  
Search Space ◽  
Protein Docking ◽  
Coarse Grained ◽  
Supplementary Information ◽  
Binary Complex ◽  
The Individual

Abstract Motivation Protein–protein docking algorithms aim to predict the 3D structure of a binary complex using the structures of the individual proteins. This typically involves searching and scoring in a 6D space. Many docking algorithms use FFT techniques to exhaustively cover the search space and to accelerate the scoring calculation. However, FFT docking results often depend on the initial protein orientations with respect to the Fourier sampling grid. Furthermore, Fourier-transforming a physics-base force field can involve a serious loss of precision. Results Here, we present EROS-DOCK, an algorithm to rigidly dock two proteins using a series of exhaustive 3D rotational searches in which non-clashing orientations are scored using the ATTRACT coarse-grained force field model. The rotational space is represented as a quaternion ‘π-ball’, which is systematically sub-divided in a ‘branch-and-bound’ manner, allowing efficient pruning of rotations that will give steric clashes. The algorithm was tested on 173 Docking Benchmark complexes, and results were compared with those of ATTRACT and ZDOCK. According to the CAPRI quality criteria, EROS-DOCK typically gives more acceptable or medium quality solutions than ATTRACT and ZDOCK. Availability and implementation The EROS-DOCK program is available for download at http://erosdock.loria.fr. Supplementary information Supplementary data are available at Bioinformatics online.

P3DOCK: a protein–RNA docking webserver based on template-based and template-free docking

2019 ◽  
Vol 36 (1) ◽  
pp. 96-103 ◽  
Author(s):  
Jinfang Zheng ◽  
Xu Hong ◽  
Juan Xie ◽  
Xiaoxue Tong ◽  
Shiyong Liu
Keyword(s):  
Success Rate ◽  
Clustering Algorithm ◽  
Hybrid Methods ◽  
3D Structure ◽  
Three Dimensional ◽  
Protein Docking ◽  
Ease Of Use ◽  
Supplementary Information ◽  
Main Function ◽  
Rna Interaction

AbstractMotivationThe main function of protein–RNA interaction is to regulate the expression of genes. Therefore, studying protein–RNA interactions is of great significance. The information of three-dimensional (3D) structures reveals that atomic interactions are particularly important. The calculation method for modeling a 3D structure of a complex mainly includes two strategies: free docking and template-based docking. These two methods are complementary in protein–protein docking. Therefore, integrating these two methods may improve the prediction accuracy.ResultsIn this article, we compare the difference between the free docking and the template-based algorithm. Then we show the complementarity of these two methods. Based on the analysis of the calculation results, the transition point is confirmed and used to integrate two docking algorithms to develop P3DOCK. P3DOCK holds the advantages of both algorithms. The results of the three docking benchmarks show that P3DOCK is better than those two non-hybrid docking algorithms. The success rate of P3DOCK is also higher (3–20%) than state-of-the-art hybrid and non-hybrid methods. Finally, the hierarchical clustering algorithm is utilized to cluster the P3DOCK’s decoys. The clustering algorithm improves the success rate of P3DOCK. For ease of use, we provide a P3DOCK webserver, which can be accessed at www.rnabinding.com/P3DOCK/P3DOCK.html. An integrated protein–RNA docking benchmark can be downloaded from http://rnabinding.com/P3DOCK/benchmark.html.Availability and implementationwww.rnabinding.com/P3DOCK/P3DOCK.html.Supplementary informationSupplementary data are available at Bioinformatics online.

UNRES-Dock—protein–protein and peptide–protein docking by coarse-grained replica-exchange MD simulations

2020 ◽  
Author(s):  
Paweł Krupa ◽  
Agnieszka S Karczyńska ◽  
Magdalena A Mozolewska ◽  
Adam Liwo ◽  
Cezary Czaplewski
Keyword(s):  
Protein Complexes ◽  
Md Simulations ◽  
Protein Docking ◽  
Conformational Space ◽  
Coarse Grained ◽  
Supplementary Information ◽  
Replica Exchange ◽  
Variable Degree ◽  
Single Chain ◽  
Simulation Speed

Abstract Motivation The majority of the proteins in living organisms occur as homo- or hetero-multimeric structures. Although there are many tools to predict the structures of single-chain proteins or protein complexes with small ligands, peptide–protein and protein–protein docking is more challenging. In this work, we utilized multiplexed replica-exchange molecular dynamics (MREMD) simulations with the physics-based heavily coarse-grained UNRES model, which provides more than a 1000-fold simulation speed-up compared with all-atom approaches to predict structures of protein complexes. Results We present a new protein–protein and peptide–protein docking functionality of the UNRES package, which includes a variable degree of conformational flexibility. UNRES-Dock protocol was tested on a set of 55 complexes with size from 43 to 587 amino-acid residues, showing that structures of the complexes can be predicted with good quality, if the sampling of the conformational space is sufficient, especially for flexible peptide–protein systems. The developed automatized protocol has been implemented in the standalone UNRES package and in the UNRES server. Availability and implementation UNRES server: http://unres-server.chem.ug.edu.pl; UNRES package and data used in testing of UNRES-Dock: http://unres.pl. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals GraphQA: protein model quality assessment using graph convolutional networks

2020 ◽  
Author(s):  
Federico Baldassarre ◽  
David Menéndez Hurtado ◽  
Arne Elofsson ◽  
Hossein Azizpour
Keyword(s):  
3D Structure ◽  
Representation Learning ◽  
Supplementary Information ◽  
Model Quality ◽  
Convolutional Networks ◽  
Geometric Invariance ◽  
Protein Model ◽  
Protein Model Quality Assessment ◽  
Individual Contributions ◽  
The Individual

Abstract Motivation Proteins are ubiquitous molecules whose function in biological processes is determined by their 3D structure. Experimental identification of a protein’s structure can be time-consuming, prohibitively expensive and not always possible. Alternatively, protein folding can be modeled using computational methods, which however are not guaranteed to always produce optimal results. GraphQA is a graph-based method to estimate the quality of protein models, that possesses favorable properties such as representation learning, explicit modeling of both sequential and 3D structure, geometric invariance and computational efficiency. Results GraphQA performs similarly to state-of-the-art methods despite using a relatively low number of input features. In addition, the graph network structure provides an improvement over the architecture used in ProQ4 operating on the same input features. Finally, the individual contributions of GraphQA components are carefully evaluated. Availability and implementation PyTorch implementation, datasets, experiments and link to an evaluation server are available through this GitHub repository: github.com/baldassarreFe/graphqa. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals RNA-align: quick and accurate alignment of RNA 3D structures based on size-independent TM-scoreRNA

2019 ◽  
Vol 35 (21) ◽  
pp. 4459-4461 ◽  
Author(s):  
Sha Gong ◽  
Chengxin Zhang ◽  
Yang Zhang
Keyword(s):  
Rna Structure ◽  
Large Scale ◽  
3D Structure ◽  
Structure Alignment ◽  
Coarse Grained ◽  
Supplementary Information ◽  
Art Programs ◽  
3D Structures ◽  
Rna Molecules ◽  
Functional Relations

Abstract Motivation Comparison of RNA 3D structures can be used to infer functional relationship of RNA molecules. Most of the current RNA structure alignment programs are built on size-dependent scales, which complicate the interpretation of structure and functional relations. Meanwhile, the low speed prevents the programs from being applied to large-scale RNA structural database search. Results We developed an open-source algorithm, RNA-align, for RNA 3D structure alignment which has the structure similarity scaled by a size-independent and statistically interpretable scoring metric. Large-scale benchmark tests show that RNA-align significantly outperforms other state-of-the-art programs in both alignment accuracy and running speed. The major advantage of RNA-align lies at the quick convergence of the heuristic alignment iterations and the coarse-grained secondary structure assignment, both of which are crucial to the speed and accuracy of RNA structure alignments. Availability and implementation https://zhanglab.ccmb.med.umich.edu/RNA-align/. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Evaluation of the coarse-grained OPEP force field for protein-protein docking

2016 ◽  
Vol 9 (1) ◽  
Author(s):  
Philipp Kynast ◽  
Philippe Derreumaux ◽  
Birgit Strodel
Keyword(s):  
Force Field ◽  
Protein Docking ◽  
Coarse Grained

scholarly journals Less is more: Coarse-grained integrative modeling of large biomolecular assemblies with HADDOCK

2019 ◽  
Author(s):  
Jorge Roel-Touris ◽  
Charleen G. Don ◽  
Rodrigo V. Honorato ◽  
João P.G.L.M Rodrigues ◽  
Alexandre M.J.J. Bonvin
Keyword(s):  
Protein Interactions ◽  
Degrees Of Freedom ◽  
Energy Landscape ◽  
3D Structure ◽  
Coarse Graining ◽  
Protein Docking ◽  
Coarse Grained ◽  
Speed Increase ◽  
Less Is More ◽  
Similar Accuracy

ABSTRACTPredicting the 3D structure of protein interactions remains a challenge in the field of computational structural biology. This is in part due to difficulties in sampling the complex energy landscape of multiple interacting flexible polypeptide chains. Coarse-graining approaches, which reduce the number of degrees of freedom of the system, help address this limitation by smoothing the energy landscape, allowing an easier identification of the global energy minimum. They also accelerate the calculations, allowing to model larger assemblies. Here, we present the implementation of the MARTINI coarse-grained force field for proteins into HADDOCK, our integrative modelling platform. Docking and refinement are performed at the coarse-grained level and the resulting models are then converted back to atomistic resolution through a distance restraints-guided morphing procedure. Our protocol, tested on the largest complexes of the protein docking benchmark 5, shows an overall ~7-fold speed increase compared to standard all-atom calculations, while maintaining a similar accuracy and yielding substantially more near-native solutions. To showcase the potential of our method, we performed simultaneous 7 body docking to model the 1:6 KaiC-KaiB complex, integrating mutagenesis and hydrogen/deuterium exchange data from mass spectrometry with symmetry restraints, and validated the resulting models against a recently published cryo-EM structure.

Proteomic Analysis of Medicinal Plant Calotropis Gigantea by insilico Peptide Mass Fingerprinting

2020 ◽  
Vol 16 ◽  
Author(s):  
Saad Ur Rehman ◽  
Muhammad Rizwan ◽  
Sajid Khan ◽  
Azhar Mehmood ◽  
Anum Munir
Keyword(s):  
Medicinal Plant ◽  
Structure Prediction ◽  
3D Structure ◽  
Peptide Mass Fingerprinting ◽  
Protein Docking ◽  
Receptor Protein ◽  
Human Leukemia ◽  
Protein Database ◽  
Calotropis Gigantea ◽  
Peptide Mass

: Medicinal plants are the basic source of medicinal compounds traditionally used for the treatment of human diseases. Calotropis gigantea a medicinal plant belonging to the family of Apocynaceae in the plant kingdom and subfamily Asclepiadaceae usually bearing multiple medicinal properties to cure a variety of diseases. Background: The Peptide Mass Fingerprinting (PMF) identifies the proteins from a reference protein database by comparing the amino acid sequence that is previously stored in a database and identified. Method: The calculation of insilico peptide masses is done through the ExPASy PeptideMass and these masses are used to identify the peptides from MASCOT online server. Anticancer probability is calculated from the iACP server, docking of active peptides is done by CABS-dock the server. Objective: The purpose of the study is to identify the peptides having anti-cancerous properties by in-silico peptide mass fingerprinting. Results : The anti-cancerous peptides are identified with the MASCOT peptide mass fingerprinting server, the identified peptides are screened and only the anti-cancer are selected. De novo peptide structure prediction is used for 3D structure prediction by PEP-FOLD 3 server. The docking results confirm strong bonding with the interacting amino acids of the receptor protein of breast cancer BRCA1 which shows the best peptide binding to the Active chain, the human leukemia protein docking with peptides shows the accurate binding. Conclusion : These peptides are stable and functional and are the best way for the treatment of cancer and many other deadly diseases.

Dementia key gene identification with multi-layered SNP-gene-disease network

2020 ◽  
Vol 36 (Supplement_2) ◽  
pp. i831-i839
Author(s):  
Dong-gi Lee ◽  
Myungjun Kim ◽  
Sang Joon Son ◽  
Chang Hyung Hong ◽  
Hyunjung Shin
Keyword(s):  
Candidate Genes ◽  
Learning Algorithm ◽  
Search Space ◽  
Supplementary Information ◽  
Gene Identification ◽  
Nucleotide Polymorphisms ◽  
Disease Network ◽  
Single Nucleotide ◽  
Key Genes ◽  
Significant Attention

Abstract Motivation Recently, various approaches for diagnosing and treating dementia have received significant attention, especially in identifying key genes that are crucial for dementia. If the mutations of such key genes could be tracked, it would be possible to predict the time of onset of dementia and significantly aid in developing drugs to treat dementia. However, gene finding involves tremendous cost, time and effort. To alleviate these problems, research on utilizing computational biology to decrease the search space of candidate genes is actively conducted. In this study, we propose a framework in which diseases, genes and single-nucleotide polymorphisms are represented by a layered network, and key genes are predicted by a machine learning algorithm. The algorithm utilizes a network-based semi-supervised learning model that can be applied to layered data structures. Results The proposed method was applied to a dataset extracted from public databases related to diseases and genes with data collected from 186 patients. A portion of key genes obtained using the proposed method was verified in silico through PubMed literature, and the remaining genes were left as possible candidate genes. Availability and implementation The code for the framework will be available at http://www.alphaminers.net/. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Martini Coarse-Grained Force Field: Extension to RNA

2017 ◽  
Vol 113 (2) ◽  
pp. 246-256 ◽  
Author(s):  
Jaakko J. Uusitalo ◽  
Helgi I. Ingólfsson ◽  
Siewert J. Marrink ◽  
Ignacio Faustino
Keyword(s):  
Force Field ◽  
Field Extension ◽  
Coarse Grained
Sign in / Sign up

Export Citation Format

Share Document