arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.12082q-bio.BM
收藏

通过点云配准匹配生物分子结构

Matching biomolecular structures by registration of point clouds

Michael Habeck, Andreas Kröpelin, Nima Vakili

AI总结:

本文提出基于三维点云与核相关的统一生物分子结构配准框架,用无需点对应的最大化—最小化算法实现刚体匹配,并在冷冻电镜和小角散射拟合等任务中验证其优势。

摘要:

动机:评估两个生物分子结构之间的匹配程度是叠加、比对和分子对接等结构分析的核心。这些任务通常通过蛋白质结构比对、刚体对接或冷冻电镜图刚体拟合软件中实现的专用结构匹配技术来解决。结果:我们提出了一个统一框架,通过运用计算机视觉中的思想来比较生物分子结构。结构被表示为三维点云,并通过量化其重叠程度进行比较。我们使用核相关来度量点云重叠,并讨论了在刚体变换空间中最大化核相关的局部和全局优化策略。我们推导了一种最大化—最小化过程,可在不建立点到点对应的情况下配准两个点云。我们证明,最大化—最小化算法优于常用的迭代最近点配准算法。此外,我们讨论并基准测试了一种用于全局优化核相关的随机化策略。我们在多种三维拟合问题上展示了该方法,例如比较环状置换结构,以及将结构刚体拟合到冷冻电镜图或小角散射得到的珠状模型中。

英文摘要:

Motivation: Assessing the match between two biomolecular structures is at the heart of structural analyses such as superposition, alignment and docking. These tasks are typically solved with specialized structure-matching techniques implemented in software for protein structural alignment, rigid-body docking, or rigid fitting into cryo-EM maps. Results: We present a unifying framework to compare biomolecular structures by applying ideas from computer vision. The structures are represented as three-dimensional point clouds and compared by quantifying their overlap. We use the kernel correlation to measure point cloud overlap, and discuss local and global optimization strategies for maximizing the kernel correlation over the space of rigid transformations. We derive a majorization-minimization procedure that can be used to register two point clouds without establishing a point-to-point correspondence. We demonstrate that the majorization-minimization algorithms outperform the commonly used Iterative Closest Point registration algorithm. Furthermore, we discuss and benchmark a randomization strategy for globally optimizing the kernel correlation. We illustrate the approach on various 3D fitting problems such as the comparison of circularly permuted structures and rigid fitting of cryo-EM maps or bead models from small-angle scattering.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑