Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > q-bio > arXiv:2509.05189

Help | Advanced Search

Quantitative Biology > Quantitative Methods

arXiv:2509.05189 (q-bio)
[Submitted on 5 Sep 2025 ]

Title: Resolving Tangling in Multi-Conformer Refinement via Iterative Projections

Title: 通过迭代投影解决多构象精修中的纠缠问题

Authors:Avinash Mandaiya, Veit Elser
Abstract: The advent of advanced crystallographic techniques has shifted structural biology from static, single-conformer models toward probing protein dynamics. Extracting cooperative motions from temporally and spatially averaged electron density maps requires both high-resolution data and refinement algorithms capable of handling conformational heterogeneity. However, current refinement protocols often fail due to the tangling phenomenon, in which conformational states become improperly intertwined during optimization. Here, we present an automated refinement methodology based on iterative projections within the divide-and-concur framework. This approach enables seamless integration of geometric constraints with experimental density constraints derived from observed scattering amplitudes. By allowing each atom to satisfy density constraints independently, we show that this framework effectively circumvents tangling artifacts and achieves robust refinement performance, even for models initialized with R-factors as high as 12%. Just as iterative projections revolutionized phase retrieval in crystallography, we demonstrate that they can also address the optimization challenges in multi-conformational refinement. This work establishes a computational foundation for advancing crystallographic methodologies to resolve conformational heterogeneity and ultimately capture protein dynamics at atomic resolution.
Abstract: 先进的晶体学技术的出现使结构生物学从静态的单一构象模型转向研究蛋白质动力学。 从时间上和空间上平均的电子密度图中提取协同运动需要高分辨率数据以及能够处理构象异质性的精修算法。 然而,当前的精修协议常常由于纠缠现象而失败,其中在优化过程中构象状态被不恰当地交织在一起。 在此,我们提出了一种基于分而治之框架内的迭代投影的自动化精修方法。 这种方法能够将几何约束与从观测散射振幅中获得的实验密度约束无缝集成。 通过允许每个原子独立满足密度约束,我们表明该框架可以有效避免纠缠伪影,并实现稳健的精修性能,即使对于初始R因子高达12%的模型也是如此。 正如迭代投影在晶体学中革新了相位检索一样,我们证明它们也可以解决多构象精修中的优化挑战。 这项工作为推进晶体学方法以解决构象异质性并最终在原子分辨率下捕捉蛋白质动力学奠定了计算基础。
Subjects: Quantitative Methods (q-bio.QM) ; Optimization and Control (math.OC); Computational Physics (physics.comp-ph)
Cite as: arXiv:2509.05189 [q-bio.QM]
  (or arXiv:2509.05189v1 [q-bio.QM] for this version)
  https://doi.org/10.48550/arXiv.2509.05189
arXiv-issued DOI via DataCite

Submission history

From: Avinash Mandaiya [view email]
[v1] Fri, 5 Sep 2025 15:39:36 UTC (1,815 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
q-bio.QM
< prev   |   next >
new | recent | 2025-09
Change to browse by:
math
math.OC
physics
physics.comp-ph
q-bio

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号