低温电子显微术中方向搜索问题的计算复杂性
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy
摘要:
在这份报告中,我们研究的问题,确定随机取向的相同粒子的噪声投影的三维取向。这个问题在从电子显微镜图像层析重建大分子复合物的密度图中具有核心重要性,并且已经被深入研究了30多年。我们分析了计算复杂性性的方向问题,并表明,虽然几个变种的问题是$NP$ -硬,不可逼近和固定参数棘手,一些限制是多项式时间内的一个常数因子近似,甚至在对数空间中可解。方向搜索问题被形式化为一个约束的线安排问题,是独立的利益。负的复杂性结果为定向搜索中使用的探试法提供了部分理由,而关于定向搜索的正复杂性结果也对寻找功能相似基因的问题具有一些积极的意义。“低温电子显微镜中方向搜索的计算复杂性”的初步版本出现在Proc. ICCS 2004,LNCS 3036,pp. 231--238. Springer-Verlag 2004.
英文摘要:
In this report we study the problem of determining three-dimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central importance in the tomographic reconstruction of the density map of macromolecular complexes from electron microscope images and it has been studied intensively for more than 30 years. We analyze the computational complexity of the orientation problem and show that while several variants of the problem are $NP$-hard, inapproximable and fixed-parameter intractable, some restrictions are polynomial-time approximable within a constant factor or even solvable in logarithmic space. The orientation search problem is formalized as a constrained line arrangement problem that is of independent interest. The negative complexity results give a partial justification for the heuristic methods used in orientation search, and the positive complexity results on the orientation search have some positive implications also to the problem of finding functionally analogous genes. A preliminary version ``The Computational Complexity of Orientation Search in Cryo-Electron Microscopy'' appeared in Proc. ICCS 2004, LNCS 3036, pp. 231--238. Springer-Verlag 2004.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。