Unsupervised and Supervised Structure Learning for Protein Contact Prediction

• URL: http://arxiv.org/abs/2009.00133v1
• Date: Mon, 31 Aug 2020 22:37:16 GMT
• Title: Unsupervised and Supervised Structure Learning for Protein Contact Prediction
• Authors: Siqi Sun
• Abstract summary: I will briefly introduce the extant related work, then show how to establish the contact prediction through unsupervised graphical models with topology constraints. I will explain how to use the supervised deep learning methods to further boost the accuracy of contact prediction. I will propose a scoring system called diversity score to measure the novelty of contact predictions, as well as an algorithm that predicts contacts with respect to the new scoring system.
• Score: 11.634916254630884
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Protein contacts provide key information for the understanding of protein structure and function, and therefore contact prediction from sequences is an important problem. Recent research shows that some correctly predicted long-range contacts could help topology-level structure modeling. Thus, contact prediction and contact-assisted protein folding also proves the importance of this problem. In this thesis, I will briefly introduce the extant related work, then show how to establish the contact prediction through unsupervised graphical models with topology constraints. Further, I will explain how to use the supervised deep learning methods to further boost the accuracy of contact prediction. Finally, I will propose a scoring system called diversity score to measure the novelty of contact predictions, as well as an algorithm that predicts contacts with respect to the new scoring system.

Related papers

• PLA-SGCN: Protein-Ligand Binding Affinity Prediction by Integrating Similar Pairs and Semi-supervised Graph Convolutional Network [6.024776891570197]
  This paper aims to integrate retrieved hard protein-ligand pairs in PLA prediction (i.e., task prediction step) using a semi-supervised graph convolutional network (GCN) The results show that the proposed method significantly performs better than the comparable approaches.
  arXiv  Detail & Related papers  (2024-05-13T03:27:02Z)
• Protein-ligand binding representation learning from fine-grained interactions [29.965890962846093]
  We propose to learn protein-ligand binding representation in a self-supervised learning manner. This self-supervised learning problem is formulated as a prediction of the conclusive binding complex structure. Experiments have demonstrated the superiority of our method across various binding tasks.
  arXiv  Detail & Related papers  (2023-11-09T01:33:09Z)
• Rethinking Complex Queries on Knowledge Graphs with Neural Link Predictors [58.340159346749964]
  We propose a new neural-symbolic method to support end-to-end learning using complex queries with provable reasoning capability. We develop a new dataset containing ten new types of queries with features that have never been considered. Our method outperforms previous methods significantly in the new dataset and also surpasses previous methods in the existing dataset at the same time.
  arXiv  Detail & Related papers  (2023-04-14T11:35:35Z)
• Structure-aware Interactive Graph Neural Networks for the Prediction of Protein-Ligand Binding Affinity [52.67037774136973]
  Drug discovery often relies on the successful prediction of protein-ligand binding affinity. Recent advances have shown great promise in applying graph neural networks (GNNs) for better affinity prediction by learning the representations of protein-ligand complexes. We propose a structure-aware interactive graph neural network (SIGN) which consists of two components: polar-inspired graph attention layers (PGAL) and pairwise interactive pooling (PiPool)
  arXiv  Detail & Related papers  (2021-07-21T03:34:09Z)
• Exploring the Limits of Few-Shot Link Prediction in Knowledge Graphs [49.6661602019124]
  We study a spectrum of models derived by generalizing the current state of the art for few-shot link prediction. We find that a simple zero-shot baseline - which ignores any relation-specific information - achieves surprisingly strong performance. Experiments on carefully crafted synthetic datasets show that having only a few examples of a relation fundamentally limits models from using fine-grained structural information.
  arXiv  Detail & Related papers  (2021-02-05T21:04:31Z)
• Generalized Relation Learning with Semantic Correlation Awareness for Link Prediction [29.23338194883254]
  We propose a unified Generalized Relation Learning framework to address the above two problems. After training with GRL, the closeness of semantically similar relations in vector space and the discrimination of dissimilar relations are improved.
  arXiv  Detail & Related papers  (2020-12-22T12:22:03Z)
• Deep Learning of High-Order Interactions for Protein Interface Prediction [58.164371994210406]
  We propose to formulate the protein interface prediction as a 2D dense prediction problem. We represent proteins as graphs and employ graph neural networks to learn node features. We incorporate high-order pairwise interactions to generate a 3D tensor containing different pairwise interactions.
  arXiv  Detail & Related papers  (2020-07-18T05:39:35Z)
• Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction [69.1473775184952]
  We introduce a realistic problem of few-shot out-of-graph link prediction. We tackle this problem with a novel transductive meta-learning framework. We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
  arXiv  Detail & Related papers  (2020-06-11T17:42:46Z)
• Explainable Deep Relational Networks for Predicting Compound-Protein Affinities and Contacts [80.69440684790925]
  DeepRelations is a physics-inspired deep relational network with intrinsically explainable architecture. It shows superior interpretability to the state-of-the-art. It boosts the AUPRC of contact prediction 9.5, 16.9, 19.3 and 5.7-fold for the test, compound-unique, protein-unique, and both-unique sets.
  arXiv  Detail & Related papers  (2019-12-29T00:14:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.