Classification of heterogeneous electron microscopic projections into homogeneous subsets.

The co-existence of different states of a macromolecular complex in samples used by three-dimensional electron microscopy (3D-EM) constitutes a serious challenge. The single particle method applied directly to such heterogeneous sets is unable to provide useful information about the encountered conformational diversity and produces reconstructions with severely reduced resolution. One approach to solving this problem is to partition heterogeneous projection set into homogeneous components and apply existing reconstruction techniques to each of them. Due to the nature of the projection images and the high noise level present in them, this classification task is difficult. A method is presented to achieve the desired classification by using a novel image similarity measure and solving the corresponding optimization problem. Unlike the majority of competing approaches, the presented method employs unsupervised classification (it does not require any prior knowledge about the objects being classified) and does not involve a 3D reconstruction procedure. We demonstrate a fast implementation of this method, capable of classifying projection sets that originate from 3D-EM. The method's performance is evaluated on synthetically generated data sets produced by projecting 3D objects that resemble biological structures.

[1]  G. Herman,et al.  Disentangling conformational states of macromolecules in 3D-EM through likelihood optimization , 2007, Nature Methods.

[2]  Montserrat Samsó,et al.  25 Å Resolution Structure of a Cytoplasmic Dynein Motor Reveals a Seven-member Planar Ring , 2004 .

[3]  Gabor T. Herman,et al.  A Fast Construction of the Distance Graph Used for the Classification of Heterogeneous Electron Microscopic Projections , 2007, GbRPR.

[4]  R. Crowther,et al.  Procedures for three-dimensional reconstruction of spherical viruses by Fourier synthesis from electron micrographs. , 1971, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.

[5]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[6]  J. Frank Three-Dimensional Electron Microscopy of Macromolecular Assemblies: Visualization of Biological Molecules in Their Native State , 1996 .

[7]  Xiong Zhang,et al.  Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization , 1999, SIAM J. Optim..

[8]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[9]  Sanjeev Khanna,et al.  On the Hardness of Approximating Max k-Cut and its Dual , 1997, Chic. J. Theor. Comput. Sci..

[10]  Frank Harary,et al.  Graph Theory , 2016 .

[11]  Vipin Kumar,et al.  Introduction to Data Mining , 2022, Data Mining and Machine Learning Applications.

[12]  Roberto Marabini,et al.  Maximum-likelihood multi-reference refinement for electron microscopy images. , 2005, Journal of molecular biology.

[13]  Jie Fu,et al.  Unsupervised classification of single particles by cluster tracking in multi-dimensional space. , 2007, Journal of structural biology.

[14]  J. Frank,et al.  A method of focused classification, based on the bootstrap 3D variance analysis, and its application to EF-G-dependent translocation. , 2006, Journal of structural biology.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .