首页> 美国卫生研究院文献>Bioinformatics >Optimal simultaneous superpositioning of multiple structures with missing data
【2h】

Optimal simultaneous superpositioning of multiple structures with missing data

机译:缺失数据的多个结构的最佳同时重叠

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

>Motivation: Superpositioning is an essential technique in structural biology that facilitates the comparison and analysis of conformational differences among topologically similar structures. Performing a superposition requires a one-to-one correspondence, or alignment, of the point sets in the different structures. However, in practice, some points are usually ‘missing’ from several structures, for example, when the alignment contains gaps. Current superposition methods deal with missing data simply by superpositioning a subset of points that are shared among all the structures. This practice is inefficient, as it ignores important data, and it fails to satisfy the common least-squares criterion. In the extreme, disregarding missing positions prohibits the calculation of a superposition altogether.>Results: Here, we present a general solution for determining an optimal superposition when some of the data are missing. We use the expectation–maximization algorithm, a classic statistical technique for dealing with incomplete data, to find both maximum-likelihood solutions and the optimal least-squares solution as a special case.>Availability and implementation: The methods presented here are implemented in THESEUS 2.0, a program for superpositioning macromolecular structures. ANSI C source code and selected compiled binaries for various computing platforms are freely available under the GNU open source license from .>Contact: >Supplementary information: are available at Bioinformatics online.
机译:>动机:叠加是结构生物学中的一项必不可少的技术,它有助于对拓扑相似结构之间的构象差异进行比较和分析。执行叠加需要不同结构中的点集一一对应或对齐。但是,实际上,某些点通常会从多个结构中“缺失”,例如,当路线包含间隙时。当前的叠加方法仅通过叠加所有结构之间共享的点子集即可处理丢失的数据。这种做法效率低下,因为它忽略了重要数据,并且无法满足常见的最小二乘标准。在极端情况下,忽略丢失的位置会完全禁止叠加。>结果:在这里,我们提出了一种通用的解决方案,用于在丢失某些数据时确定最佳的叠加。作为特殊情况,我们使用期望最大化算法(一种用于处理不完整数据的经典统计技术)来找到最大似然解和最优最小二乘解。>可用性和实现:此处介绍的功能是在THESEUS 2.0中实现的,该程序是用于叠加大分子结构的程序。在GNU开源许可下,可从以下位置免费获得ANSI C源代码和针对各种计算平台选择的已编译二进制文件。>联系方式: >补充信息:可从Bioinformatics在线获得。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号