Solving the scalability issue in quantum-based refinement: Q|R#1

被引:19
|
作者
Zheng, Min [1 ,2 ,3 ]
Moriarty, Nigel W. [4 ]
Xu, Yanting [1 ]
Reimers, Jeffrey R. [1 ,5 ]
Afonine, Pavel V. [1 ,4 ]
Waller, Mark P. [1 ]
机构
[1] Shanghai Univ, Int Ctr Quantum & Mol Struct, Shanghai 200444, Peoples R China
[2] Westfalische Wilhelms Univ Munster, Organ Chem Inst, Theoret Organ Chem, D-48149 Munster, Germany
[3] Westfalische Wilhelms Univ Munster, Ctr Multiscale Theory & Computat, D-48149 Munster, Germany
[4] Lawrence Berkeley Natl Lab, Mol Biosci & Integrated Bioimaging, Berkeley, CA 94720 USA
[5] Univ Technol Sydney, Sch Math & Phys Sci, Sydney, NSW 2007, Australia
关键词
quantum refinement; fragmentation; graph clustering; Q|R#1; ENERGY RESTRAINTS; PROTEIN; CHEMISTRY; MODEL; OPTIMIZATION; COMBINATION; VALIDATION; REVOLUTION; PROGRAM;
D O I
10.1107/S2059798317016746
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Accurately refining biomacromolecules using a quantum-chemical method is challenging because the cost of a quantum-chemical calculation scales approximately as n(m), where n is the number of atoms and m (>= 3) is based on the quantum method of choice. This fundamental problem means that quantum-chemical calculations become intractable when the size of the system requires more computational resources than are available. In the development of the software package called Q|R, this issue is referred to as Q|R#1. A divide-and-conquer approach has been developed that fragments the atomic model into small manageable pieces in order to solve Q|R#1. Firstly, the atomic model of a crystal structure is analyzed to detect noncovalent interactions between residues, and the results of the analysis are represented as an interaction graph. Secondly, a graph-clustering algorithm is used to partition the interaction graph into a set of clusters in such a way as to minimize disruption to the noncovalent interaction network. Thirdly, the environment surrounding each individual cluster is analyzed and any residue that is interacting with a particular cluster is assigned to the buffer region of that particular cluster. A fragment is defined as a cluster plus its buffer region. The gradients for all atoms from each of the fragments are computed, and only the gradients from each cluster are combined to create the total gradients. A quantum-based refinement is carried out using the total gradients as chemical restraints. In order to validate this interaction graph-based fragmentation approach in Q|R, the entire atomic model of an amyloid cross-beta spine crystal structure (PDB entry 2oNA) was refined.
引用
收藏
页码:1020 / 1028
页数:9
相关论文
共 46 条
  • [1] Q | R: quantum-based refinement
    Zheng, Min
    Reimers, Jeffrey R.
    Waller, Mark P.
    Afonine, Pavel V.
    ACTA CRYSTALLOGRAPHICA SECTION D-STRUCTURAL BIOLOGY, 2017, 73 : 45 - 52
  • [2] Including crystallographic symmetry in quantum-based refinement: Q|R#2
    Zheng, Min
    Biczysko, Malgorzata
    Xu, Yanting
    Moriarty, Nigel W.
    Kruse, Holger
    Urzhumtsev, Alexandre
    Waller, Mark P.
    Afonine, Pavel, V
    ACTA CRYSTALLOGRAPHICA SECTION D-STRUCTURAL BIOLOGY, 2020, 76 : 41 - 50
  • [3] Quantum-based refinement
    Waller, Mark
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2017, 254
  • [4] Real-space quantum-based refinement for cryo-EM: Q|R#3
    Wang, Lum
    Kruse, Holger
    Sobolev, Oleg V.
    Moriarty, Nigel W.
    Waller, Mark P.
    Afonine, Pavel V.
    Biczysko, Malgorzata
    ACTA CRYSTALLOGRAPHICA SECTION D-STRUCTURAL BIOLOGY, 2020, 76 : 1184 - 1191
  • [5] Quantum-based atomic model refinement becomes reality in Phenix
    Afonine, Pavel V.
    Biczysko, Malgorzata
    Gokcan, Hatice
    Isayev, Olexandr
    Kruse, Holger
    Moriarty, Nigel W.
    Roitberg, Adrian E.
    Waller, Mark P.
    Zubatyuk, Roman
    ACTA CRYSTALLOGRAPHICA A-FOUNDATION AND ADVANCES, 2024, 80
  • [6] A quantum-based sine cosine algorithm for solving general systems of nonlinear equations
    Rizk-Allah, Rizk M.
    ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (05) : 3939 - 3990
  • [7] A quantum-based sine cosine algorithm for solving general systems of nonlinear equations
    Rizk M. Rizk-Allah
    Artificial Intelligence Review, 2021, 54 : 3939 - 3990
  • [8] Quantum-Based Deep Q-Network Bandwidth Resource Allocation Algorithm for UASN
    Gao, Jia
    Wang, Jingjing
    Gu, Jianlei
    Shi, Wei
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (24): : 39932 - 39940
  • [9] Optimal clustering for quantum refinement of biomolecular structures: Q|R#4
    Wang, Yaru
    Kruse, Holger
    Moriarty, Nigel W.
    Waller, Mark P.
    Afonine, Pavel V.
    Biczysko, Malgorzata
    THEORETICAL CHEMISTRY ACCOUNTS, 2023, 142 (10)
  • [10] Optimal clustering for quantum refinement of biomolecular structures: Q|R#4
    Yaru Wang
    Holger Kruse
    Nigel W. Moriarty
    Mark P. Waller
    Pavel V. Afonine
    Malgorzata Biczysko
    Theoretical Chemistry Accounts, 2023, 142