Abstract
In this paper 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 problem and show that while several variants of the problem are NP-hard and inapproximable, some restrictions are polynomial-time approximable within a constant factor or even solvable in logarithmic space. The negative complexity results give a partial justification for the heuristic methods used in the orientation search, and the positive complexity results have some positive implications also to a different problem of finding functionally analogous genes.
A work supported by the Academy of Finland.
Chapter PDF
Similar content being viewed by others
References
Frank, J.: Three-Dimensional Electron Microscopy of Macromolecular Assemblies. Academic Press, London (1996)
Carazo, J.M., Sorzano, C.O., Rietzel, E., Schröder, R., Marabini, R.: Discrete tomography in electron microscopy. In: Herman, G.T., Kuba, A. (eds.) Discrete Tomography: Foundations, Algorithms, and Applications, Applied and Numerical Harmonic Analysis, ch. 18, pp. 405–416. Birkhäuser, Basel (1999)
Crowther, R., DeRosier, D., Klug, A.: The reconstruction of a three-dimensional structure from projections and its application to electron microscopy. Proceedings of the Royal Society of London A 317, 319–340 (1970)
Hallett, M.T., Lagergren, J.: Hunting for functionally analogous genes. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 465–476. Springer, Heidelberg (2000)
Mielikäinen, T., Ravantti, J., Ukkonen, E.: The computational complexity of orientation search problems in cryo-electron microscopy, Report C-2004-3, Department of Computer Science, University of Helsinki (2004)
Doerschuk, P.C., Johnson, J.E.: Ab initio reconstruction and experimental design for cryo electron microscopy. IEEE Transactions on Information Theory 46(5), 1714–1729 (2000)
Ji, Y., Marinescu, D.C., Chang, W., Baker, T.S.: Orientation refinement of virus structures with unknown symmetry. In: Proceedings of the International Parallel and Distributed Processing Symposium, pp. 49–56. IEEE Computer Society, Los Alamitos (2003)
Lanczycki, C.J., Johnson, C.A., Trus, B.L., Conway, J.F., Steven, A.C., Martino, R.L.: Parallel computing strategies for determining viral capsid structure by cryo-electron microscopy. IEEE Computational Science & Engineering 5, 76–91 (1998)
Baker, T.S., Olson, N.H., Fuller, S.D.: Adding the third dimension to virus life cycles: Three-dimensional reconstruction of icosahedral. Microbiology and Molecular Biology Reviews 63(4), 862–922 (1999)
van Heel, M.: Angular reconstitution: a posteriori assignment of projection directions for 3D reconstruction. Ultramicroscopy 21, 11–124 (1987)
Bellon, P.L., Cantele, F., Lanzavecchia, S.: Correspondence analysis of sinogram lines. Sinogram trajectories in factor space replace raw images in the orientation of projections of macromolecular assemblies. Ultramicroscopy 87, 187–197 (2001)
Penczek, P.A., Zhu, J., Frank, J.: A common-lines based method for determining orientations for N > 3 particle projections simultaneously. Ultramicroscopy 63, 205–218 (1996)
Thuman-Commike, P.A., Chiu, W.: Improved common line-based icosahedral particle image orientation estimation algorithms. Ultramicroscopy 68, 231–255 (1997)
Edelsbrunner, H.: Algorithms in Combinatorial Geometry. EATCS Monographs on Theoretical Computer Science, vol. 10. Springer, Heidelberg (1987)
Ausiello, G., Crescenzi, P., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
Håstad, J.: Clique is hard to approximate within n1 − ε. Acta Mathematica 182, 105–142 (1999)
Böckenhauer, H.-J., Hromkovič, J., Klasing, R., Seibert, S., Unger, W.: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. Theoretical Computer Science 185(1), 3–24 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mielikäinen, T., Ravantti, J., Ukkonen, E. (2004). The Computational Complexity of Orientation Search in Cryo-Electron Microscopy. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science - ICCS 2004. ICCS 2004. Lecture Notes in Computer Science, vol 3036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24685-5_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-24685-5_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22114-2
Online ISBN: 978-3-540-24685-5
eBook Packages: Springer Book Archive