SyNDock: N Rigid Protein Docking via Learnable Group Synchronization

• URL: http://arxiv.org/abs/2305.15156v2
• Date: Thu, 25 May 2023 01:27:47 GMT
• Title: SyNDock: N Rigid Protein Docking via Learnable Group Synchronization
• Authors: Yuanfeng Ji, Yatao Bian, Guoji Fu, Peilin Zhao, Ping Luo
• Abstract summary: SyNDock is an automated framework that swiftly assembles precise multimeric complexes within seconds. SyNDock formulates multimeric protein docking as a problem of learning global transformations. It achieves a 4.5% improvement in performance and a remarkable millionfold acceleration in speed.
• Score: 38.91751238804233
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The regulation of various cellular processes heavily relies on the protein complexes within a living cell, necessitating a comprehensive understanding of their three-dimensional structures to elucidate the underlying mechanisms. While neural docking techniques have exhibited promising outcomes in binary protein docking, the application of advanced neural architectures to multimeric protein docking remains uncertain. This study introduces SyNDock, an automated framework that swiftly assembles precise multimeric complexes within seconds, showcasing performance that can potentially surpass or be on par with recent advanced approaches. SyNDock possesses several appealing advantages not present in previous approaches. Firstly, SyNDock formulates multimeric protein docking as a problem of learning global transformations to holistically depict the placement of chain units of a complex, enabling a learning-centric solution. Secondly, SyNDock proposes a trainable two-step SE(3) algorithm, involving initial pairwise transformation and confidence estimation, followed by global transformation synchronization. This enables effective learning for assembling the complex in a globally consistent manner. Lastly, extensive experiments conducted on our proposed benchmark dataset demonstrate that SyNDock outperforms existing docking software in crucial performance metrics, including accuracy and runtime. For instance, it achieves a 4.5% improvement in performance and a remarkable millionfold acceleration in speed.

Related papers

• Rigidity-Aware Geometric Pretraining for Protein Design and Conformational Ensembles [74.32932832937618]
  We introduce $textbfRigidSSL$ ($textitRigidity-Aware Self-Supervised Learning$), a geometric pretraining framework.<n>Phase I (RigidSSL-Perturb) learns geometric priors from 432K structures from the AlphaFold Protein Structure Database with simulated perturbations.<n>Phase II (RigidSSL-MD) refines these representations on 1.3K molecular dynamics trajectories to capture physically realistic transitions.
  arXiv  Detail & Related papers  (2026-03-02T21:32:30Z)
• MC-GNNAS-Dock: Multi-criteria GNN-based Algorithm Selection for Molecular Docking [5.313085467302315]
  This study introduces an enhanced system, MC-GNNAS-Dock, with three key advances.<n>First, a multi-criteria evaluation integrates binding-pose accuracy (RMSD) with validity checks from PoseBusters, offering a more rigorous assessment.<n>Second, architectural refinements by inclusion of residual connections strengthen predictive robustness.<n>Third, rank-aware loss functions are incorporated to sharpen rank learning.
  arXiv  Detail & Related papers  (2025-09-30T15:08:41Z)
• PoseX: AI Defeats Physics Approaches on Protein-Ligand Cross Docking [74.76447568426276]
  PoseX is an open-source benchmark to evaluate both self-docking and cross-docking.<n>We incorporated 23 docking methods in three methodological categories.<n>We developed a relaxation method for post-processing to minimize conformational energy and refine binding poses.
  arXiv  Detail & Related papers  (2025-05-03T05:35:37Z)
• GNNAS-Dock: Budget Aware Algorithm Selection with Graph Neural Networks for Molecular Docking [0.0]
  This paper introduces GNNASDock, a novel Graph Graph Network (GNN)-based automated algorithm selection system for molecular docking in blind docking. GNNs are accommodated to process the complex structural data of both situations and proteins. They benefit from inherent graph-like properties to predict the performance of various docking algorithms under different conditions.
  arXiv  Detail & Related papers  (2024-11-19T16:01:54Z)
• TSdetector: Temporal-Spatial Self-correction Collaborative Learning for Colonoscopy Video Detection [19.00902297385955]
  We propose a novel Temporal-Spatial self-correction detector (TSdetector), which integrates temporal-level consistency learning and spatial-level reliability learning to detect objects continuously. The experimental results on three publicly available polyp video dataset show that TSdetector achieves the highest polyp detection rate and outperforms other state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-09-30T06:19:29Z)
• Bridging the Gap Between End-to-End and Two-Step Text Spotting [88.14552991115207]
  Bridging Text Spotting is a novel approach that resolves the error accumulation and suboptimal performance issues in two-step methods. We demonstrate the effectiveness of the proposed method through extensive experiments.
  arXiv  Detail & Related papers  (2024-04-06T13:14:04Z)
• Multi-scale Iterative Refinement towards Robust and Versatile Molecular Docking [17.28573902701018]
  Molecular docking is a key computational tool utilized to predict the binding conformations of small molecules to protein targets. We introduce DeltaDock, a robust and versatile framework designed for efficient molecular docking.
  arXiv  Detail & Related papers  (2023-11-30T14:09:20Z)
• DockGame: Cooperative Games for Multimeric Rigid Protein Docking [45.970633276976045]
  We introduce DockGame, a novel game-theoretic framework for docking. We view protein docking as a cooperative game between proteins, where the final assembly structure(s) constitute stable equilibria. On the Docking Benchmark 5.5 dataset, DockGame has much faster runtimes than traditional docking methods.
  arXiv  Detail & Related papers  (2023-10-09T22:02:05Z)
• Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RL [106.82295532402335]
  Existing reinforcement learning algorithms suffer from computational intractability, strong statistical assumptions, and suboptimal sample complexity. We provide the first computationally efficient algorithm that attains rate-optimal sample complexity with respect to the desired accuracy level. Our algorithm, MusIK, combines systematic exploration with representation learning based on multi-step inverse kinematics.
  arXiv  Detail & Related papers  (2023-04-12T14:51:47Z)
• Independent SE(3)-Equivariant Models for End-to-End Rigid Protein Docking [57.2037357017652]
  We tackle rigid body protein-protein docking, i.e., computationally predicting the 3D structure of a protein-protein complex from the individual unbound structures. We design a novel pairwise-independent SE(3)-equivariant graph matching network to predict the rotation and translation to place one of the proteins at the right docked position. Our model, named EquiDock, approximates the binding pockets and predicts the docking poses using keypoint matching and alignment.
  arXiv  Detail & Related papers  (2021-11-15T18:46:37Z)
• Learning to Optimize Non-Rigid Tracking [54.94145312763044]
  We employ learnable optimizations to improve robustness and speed up solver convergence. First, we upgrade the tracking objective by integrating an alignment data term on deep features which are learned end-to-end through CNN. Second, we bridge the gap between the preconditioning technique and learning method by introducing a ConditionNet which is trained to generate a preconditioner.
  arXiv  Detail & Related papers  (2020-03-27T04:40:57Z)

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.