The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy

Simple item page
dc.creatorMielikäinen, Taneli
dc.creatorRavantti, Janne
dc.creatorUkkonen, Esko
dc.date2004-06-23
dc.date2004-06-28
dc.date.accessioned2026-07-07T03:21:28Z
dc.date.available2026-07-07T03:21:28Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0406043
dc.identifierhttp://arxiv.org/abs/cs/0406043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32209
dc.subjectData Structures and Algorithms
dc.subjectComputational Geometry
dc.subjectComputer Vision and Pattern Recognition
dc.subjectF.2.2; I.4.5; J.3
dc.titleThe Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy
dc.typetext

Files

Collections

arXiv