- We are sorry, but NCBI web applications do not support your browser and may not function properly. More information

- Journal List
- Bioinformatics
- PMC3117359

# Template-free detection of macromolecular complexes in cryo electron tomograms

^{1}Program in Molecular and Computational Biology, University of Southern California, Los Angeles, CA 90089, USA and

^{2}European Molecular Biology Laboratory, Computational and Structural Biology Unit, Meyerhofstrasse 1, 69117 Heidelberg, Germany

## Abstract

**Motivation:** Cryo electron tomography (CryoET) produces 3D density maps of biological specimen in its near native states. Applied to small cells, cryoET produces 3D snapshots of the cellular distributions of large complexes. However, retrieving this information is non-trivial due to the low resolution and low signal-to-noise ratio in tomograms. Current pattern recognition methods identify complexes by matching known structures to the cryo electron tomogram. However, so far only a small fraction of all protein complexes have been structurally resolved. It is, therefore, of great importance to develop template-free methods for the discovery of previously unknown protein complexes in cryo electron tomograms.

**Results:** Here, we have developed an inference method for the template-free discovery of frequently occurring protein complexes in cryo electron tomograms. We provide a first proof-of-principle of the approach and assess its applicability using realistically simulated tomograms, allowing for the inclusion of noise and distortions due to missing wedge and electron optical factors. Our method is a step toward the template-free discovery of the shapes, abundance and spatial distributions of previously unknown macromolecular complexes in whole cell tomograms.

**Contact:** alber/at/usc.edu

**Supplementary information:** Supplementary data are available at *Bioinformatics* online.

## 1 INTRODUCTION

Cryo electron tomography (cryoET) enables the 3D visualization of a cell's interior under close to live conditions (Best *et al.*, 2007; Frank, 2006; Lučić *et al.*, 2005; Medalia *et al.*, 2002; Murphy and Jensen, 2007). Such tomograms are essentially 3D representations of the entire proteome providing a snapshot of the distributions of protein complexes and their interaction networks (Alber *et al.*, 2008; Beck *et al.*, 2011). However, retrieving shape information and distributions of macromolecular assemblies is not trivial due to the low signal-to-noise ratio (SNR), missing data and non-isotropic resolution, and the fact that individual macromolecules are difficult to recognize in a highly crowded environment (Best *et al.*, 2007; Böhm *et al.*, 2000; Frangakis *et al.*, 2002; Medalia *et al.*, 2002). So far, the identification of macromolecular complexes is accomplished mostly by template matching methods (Best *et al.*, 2007; Böhm *et al.*, 2000; Frangakis *et al.*, 2002; Medalia *et al.*, 2002). where the signals representing the density map of a known protein complex structure are correlated to the signals in the cryoET map. The cross-correlation between the template and tomogram is calculated for each position and every possible orientation. Peaks in the resulting cross-correlation function across the whole tomogram may indicate positions occupied by the particular complex. A major drawback, however, is that template matching cannot discover yet structurally unknown complexes. So far only a relatively small fraction of large protein complexes have been structurally resolved. Furthermore, recent work has shown that the quaternary structure of large protein complexes varies considerably across different organisms (Han *et al.*, 2009) and available reference structures might therefore not be applicable to the desired organism. Even if a template structure is available, the template-based methods may fail if the template structure is in a different conformation or is bound to additional proteins than the target complexes in the tomogram. As a consequence, template-based methods may fail in detecting an unbiased atlas of the spatial arrangement of all complexes in a cell (i.e. a cellular proteome ‘atlas’). It is, therefore, of great importance to develop template-free methods for the detection of macromolecular complexes in cryo electron tomograms. Such methods will allow not only the discovery of the shapes of unknown macromolecular complexes but also allow detecting their positions and orientations in the cryo electron tomograms.

The key problem in a template-free approach is to identify frequently occurring density patterns in cryo electron tomograms. A pattern is defined by voxel regions with similar intensity structures, which appear multiple times at different position in the tomogram. Such frequently occurring patterns represent objects of biological interest. In this article, we focus on patterns that correspond to protein complexes. Once identical complexes are discovered, their subtomograms can be locally aligned and their density distribution averaged producing a density map of the complex with improved SNR.

Identifying recurrent patterns in cryo electron tomograms is challenging because neither the composition nor the total number of the patterns is known. Moreover, cryo electron tomograms are of very low resolution (≥4 nm), low SNR and are subject to distortions due to electron optical effects. Therefore, traditional methods in computer vision derived for high resolution and high SNR 3D object recognition usually cannot be directly applied to cryo electron tomograms (Tangelder and Veltkamp, 2008).

Here, we propose a step-wise approach for classifying cryo electron tomograms into recurrent density patterns (Fig. 1). First, an initial classification is generated based on rotation-invariant features of the tomogram. In the second step, this initial classification is refined using a Gaussian Hidden Markov Random Field (GHMRF) model. As an inference method, GHMRF models have shown robustness in 2D image segmentations at relatively high noise levels (Zhang *et al.*, 2001). Here, we extend the GHMRF framework to the classification of recurrent patterns in 3D cryoET maps, which contain high levels of noise and distortions.

In this article, we provide the first proof of principle of the method, and demonstrate its applicability for the detection of frequently occurring protein complexes in noisy density maps with relatively high accuracy. We test our approach on realistically simulated cryo electron tomograms including low resolution, high levels of noise and distortions due to missing wedge effects and electron optical factors.

## 2 METHODS

Our method consists of three steps (Fig. 1): first, we identify candidate patterns (i.e. objects) by segmenting the tomogram into high intensity regions. This step reduces the search space to the most promising density regions. Second, the similarity between all the objects is compared. To calculate similarities between all the objects efficiently, each tomogram voxel (i.e. the 3D equivalent of an image pixel) is represented by a feature vector that describes the local intensity distribution in the proximity of the voxel in a rotationally invariant manner. The similarity between objects is then determined efficiently by comparing the distances between the corresponding feature vectors. Then the segmented objects are clustered based on their feature vector similarity. All voxels in objects of the same cluster are assigned to the same pattern class. Third, the resulting initial voxel classification is refined by an GHMRF approach. The GHMRF approach reclassifies the voxels into recurrent patterns by maximizing the probability to observe the classification for the given tomogram.

### 2.1 Problem formulation and definitions

A tomogram is described by a 3D grid of voxels that are associated with values of electron optical density. Let ={1,2,…,N} be the set of indices of all voxels in the density map, and let **x**_{i}^{3} be the location of voxel *i* in the map.

*Intensity vector*: then, a tomogram is represented by a *N*-dimensional vector of the ordered list of intensity values for all voxels.

where *N* is the total number of voxels and *f*_{i} is the intensity value of voxel *i*.

*Class label vector*: a pattern in a density map is defined as a collection of voxels that may have different intensities but are assigned to the same pattern class. Let us define the set of all pattern classes in a tomogram as ={1,2,…,*C*}, with *C* as the total number of classes. Each voxel in the density map can be assigned to one of the classes in . Similar to an intensity vector, we therefore define a class label vector

where *l*_{i} is the class label of voxel *i*. Whereas the intensity vector **f** is known, the class label vector **l** is unknown and to be inferred. The task of identifying recurrent patterns in a density map is therefore equivalent to determining the class label vector **l**. To achieve this goal, we apply a two-step procedure, combining a heuristic approach generating an initial tomogram classification with a subsequent refinement using a statistical inference method that maximizes the joint probability of the class assignment **l** and the intensity **f**.

### 2.2 Initial tomogram classification

The goal of the following section is to define an initial class label vector **l**, which serves in a later step as an input in the GHMRF-based refinement process.

#### 2.2.1 Identification of segmented objects.

First, Gaussian filtering is applied to generate a blurred density map **f**^{blur} reducing the influence of noise in the segmentation. Then a seed growth approach is adapted from the watershed segmentation (Dougherty, 1993) as follows. All local intensity maxima in the filtered map are identified. Local maxima with low intensity values are likely a result of noise and are discarded. The remaining local maxima with high intensity voxels are used as seeds for an extended watershed segmentation procedure. During the seed growth segmentation, a voxel rank *r* is introduced that captures the order at which voxels are included to a region. A segmented region *S*_{s} is defined, where the watershed algorithm is terminated at a given voxel rank *r*_{s}^{max}. Let *v*_{s,r} be a specific voxel index, of segment *s* and voxel rank *r*, then the set of voxels in a region of segmented object *S*_{s} is defined as

such that for all *s*. Note that the filtered tomogram is only used to identify the indices of voxels in the segmented objects. Classifications are performed using the unfiltered intensity values of these voxels.

#### 2.2.2 Rotation-invariant feature vectors.

To introduce an efficient way to compare the similarities between all the distinct objects, we introduce rotation-invariant feature vectors (Kazhdan *et al.*, 2003; Saha *et al.*, 2010; Xu *et al.*, 2009).

Rotation-invariant feature vectors **p**(**x**_{i}) describe the intensity distribution of the tomogram in the neighborhood of a voxel located at **x**_{i}. To construct a feature vector at the voxel location **x**_{i}, we divide the neighborhood of the voxel **x**_{i} into *M* concentric shells (Fig. 2)

where *V*_{j}(**x**_{i}) is defined as the set of voxels that fall into the concentric shell centered at **x**_{i} and is defined by the two radii *r*_{j−1} and *r*_{j}, where with *r*_{j}=*jR*/*M* and *R* is the largest chosen radius. If a concentric shell *V*_{j}(**x**_{i}) is thin (i.e. *r*_{j+1}−*r*_{j}≈ voxel length), then the voxel intensities *f*(**x**_{k}) with *k**V*_{j}(**x**_{i}) can be approximated by a spherical function *g* that is defined on the surface of a sphere in spherical coordinates.

where , and θ, ϕ are the colatitude and longitude angles, respectively. *g* can then be approximated by a sum of its spherical harmonics (Hobson, 1931):

where *L* is a given bandwidth, and *a*_{lm} is a coefficient associated with the complex spherical harmonics function *Y*_{l}^{m}, which is independent to *g*.

**x**

_{i}for voxel

*i*. Schematic view of a 2D grid with individual voxels shown as dark grey dots. Concentric shells are constructed that are centered at

**x**

**...**

Based on such a decomposition, the intensity distribution of all the voxels in shell *V*_{j}(**x**_{i}) can then be described by a set of *L* rotation-invariant features {*s*_{jl}|*l*=1,…,*L*}(Kazhdan *et al.*, 2003) as follows:

Such features are calculated for all the *M* shells. The rotation-invariant description of the density distribution around the location of a voxel **x**_{i} is then defined by the following feature vector:

whose elements consist of the ordered sequence of *s*_{jl} for all consecutive shells {*V*_{j}(**x**_{i})|:*j*=1,…,*M*}. These feature vectors are rotation invariant, which means that they are independent of the relative orientation of the local density distribution. Therefore, feature vector-based similarities between density regions can be calculated even if these regions are at different relative orientations to each other. Previously, we have shown that such rotational invariant features are also robust against noise in maps (Xu *et al.*, 2009).

#### 2.2.3 Comparing the similarity of segmented objects.

The goal is to cluster segmented objects based on their feature vector dissimilarity. The dissimilarity *o*_{a,b} between objects *a* and *b* is defined as one minus the fraction of voxels with similar feature vectors in both objects *S*_{a} and *S*_{b}.

where is the number of similar feature vectors that appear both in objects *S*_{a} and *S*_{b}.

_{i}^{fea} is the set of feature vectors that are most similar to feature vector *i*, but are located spatially apart from *i* in the tomogram. and are the total number of feature vectors in *S*_{a} and *S*_{b}, respectively. is the sum of the total number of feature vectors in object *a* for which a similar feature vector exists in object *b* and the number of feature vectors in *b* with a similar feature vector in *a*.

To determine _{i}^{fea}, the voxels in the tomogram are clustered based on the Euclidian distance between their feature vectors. Cryo electron tomograms are generally so large that not all feature vectors can be stored in computer memory at the same time. We, therefore, employ a large-scale clustering technique, (BIRCH) (Harrington and Salibián-Barrera, 2008; Zhang *et al.*, 1997). The clustering cutoff is chosen heuristically by sampling the similarities between randomly selected feature vectors. Good performances have been achieved when the cutoff comprises the top 5% of sampled feature vector similarities. Then all voxels are detected that are in the same cluster but are apart in grid space so that they are not direct neighbors in the tomogram. For each voxel *i* in each cluster *A* a voxel set is defined as *U*_{i}={*k*:|**x**_{k}−**x**_{i}|>*r*_{d},*k**A*}, where *r*_{d} is a predefined grid distance.

It is computationally beneficial to restrict ^{fea}_{i} to only a fixed number of the closest voxel neighbors. Here, ^{fea}_{i} is defined as the subset of *U*_{i} with the 20 voxels whose feature vectors are most similar to the feature vector of *i*. Slight variations of this number do not affect the outcome of our calculations.

#### 2.2.4 Clustering of segmented objects.

Next, all segmented objects are clustered using hierarchical clustering with the dissimilarity measure *o*_{a,b}. The clustering cutoff is determined as the global minimum in a penalty function that seeks to simultaneously minimize the number of clusters and the variation within each cluster according to Kelley *et al.*, (1996). All objects in the same cluster define the same frequently occurring density pattern. Because we are only interested in frequently occurring patterns clusters with less than three objects are discarded. The number of all density pattern classes *C* is then defined as the number of all clusters *n* and a ‘background’ class, which comprises all the voxels in the tomogram that are not part of any segmented object. All the voxels in objects that are part of the same cluster are assigned to the same class label *l*, with ={1,2,…,*n*}. All remaining voxels in the tomogram are assigned to the background class.

The assignment of all the voxels to the pattern classes defines the class label vector **l**=(*l*_{1},…,*l*_{N}), which is the initial classification of the tomogram and serves as input information for a refined reclassification described in the following section.

### 2.3 Classification refinement by Gaussian Hidden Markov Random Field Model

In this section, the initial classification is refined using an GHMRF model. In the GHMRF framework, class labels are not directly observable variables and are modeled as a hidden random field. The class labels are determined by maximizing the joint probability *P*(**l**,**f**) of class labels **l** and the intensity vector **f**. GHMRF has been used for image analysis and segmentation (Li *et al.*, 2009; Zhang *et al.*, 2001). Here, we apply and extend the method to 3D density maps for the classification of frequently occurring macromolecular complexes in cryo electron tomograms.

#### 2.3.1 Gaussian Hidden Markov Random Field Model.

In the GHMRF framework, the voxel labels are modeled as a hidden random field. Their conditional independence follows the Markov property and can be described by an undirected graph where each node corresponds to a voxel.

where *l*_{i}={*l*_{j}|∀*j*_{i}} are the labels of neighbor voxels of *i*.

In standard GHMRF models, the voxel neighborhood is defined by an undirected graph with voxels as vertices and edges as the cubic grid connecting the vertices (Fig. 3). In our method, this graph is augmented by additional edges between those voxels that share similar feature vectors but are at far distance in the tomogram grid. In other words, for a given voxel *i*, its neighborhood list _{i} includes all direct grid neighbors in the tomogram *and* all voxels that have a similar density environment even if they are located at far distance (Fig. 3). By augmenting the list of grid neighbors, we are able to connect those voxels in the graph that have the same class label, even if these voxels are part of different copies of the same complex located at different regions of the tomogram. The neighborhood _{i} of voxel *i* is, therefore, defined as

where ^{map}_{i} is the set of all voxels that are adjacent to *i* in the tomogram grid and ^{fea}_{i} is the set of voxels that have similar feature vectors.

**...**

Voxel intensities *f*_{i} form an observable random field. Given the class label *l*_{i}=*l*, the voxel intensity *f*_{i} is assumed to follow a conditional probability distribution

where Φ(*f*;μ_{l},σ_{l}) denotes Gaussian distribution with mean μ_{l} and SD σ_{l} that are specific to class label *l*. In addition, given one instance of **l**, the intensities **f** are assumed to be conditionally independent.

#### 2.3.2 Iterative optimization method for voxel classification.

The voxel re-classification is formulated as a maximization problem:

is the best estimation for the true class label vector. *P*(**f**,**l**) is the joint probability of the intensities **f** and class labels **l**, where θ={μ_{l},σ_{l}} is the collection of mean and SD parameters for the intensity values of the voxels in each of the pattern classes. To perform the maximization, we use an iterative approach (Zhang *et al.*, 2001) that consists of two steps. First, for a given estimation of the parameter set at iteration *t*, a classification is performed to obtain updated class labels . Then expectation maximization determines the optimal parameter set given obtained from the first step.

Step 1: classification.

Given , we want to obtain

According to (Zhang *et al.* (2001), the minimization problem can be formulated as

with the energy functions

and

where κ is the set of all cliques on the graph. Following Zhang *et al.* (2001), we choose *V*_{c}=−δ_{lilj}, where δ is the Kronecker delta function. Calculating the global minimum of Equation (17) is computationally infeasible. However, because both *U*(**f**|**l**) and *U*(**l**) can be expanded into sums over all voxels *i*, the optimal solution can be approximated using the *iterated conditional modes* (ICM) algorithm (Besag, 1986), which is popular in solving such optimization problems. This method optimizes *U*(*l*_{i}|**l**_{{i}},**f**) for each *i*, while keeping all other labels **l**_{{i}} fixed.

Step 2: Expectation maximization for model fitting.

The expectation maximization method updates parameters θ by maximizing the conditional expectation

Following Zhang *et al.* (2001), new parameters are estimated as

and

where

Following Li (2009) and given the class labels *l*_{i} obtained from the classification step, the probability for a voxel *i* to be assigned to class label *l* is calculated as

The iterations between expectation and maximization step are repeated until convergence is reached, leading to the newly refined class label vector **l**.

Finally, a class label can be defined for each object as the label that is assigned to the majority of voxels in the object. The classification performance is increased, if all the voxels with labels different to the corresponding object label are reassigned to the background class.

### 2.4 Generating simulated cryo electron tomograms

For a reliable assessment of the method, tomograms must be generated by simulating the actual tomographic image reconstruction process, allowing the inclusion of noise, tomographic distortions due to missing wedge and electron optical factors such as contrast transfer function (CTF) and Modulation Transfer Function (MTF) (Fig. 4).

**A**) Contour volume representation of the tomogram and (

**B**) a slice through x–y plane of the tomogram (top panel) and a slice through

**...**

We follow a previously applied methodology for simulating the tomographic image formation mechanism as realistically as possible (Beck *et al.*, 2009; Förster *et al.*, 2008; Nickell *et al.*, 2005). The electron optical density of a macromolecule is proportional to its electrostatic potential and the density map can be calculated from the atomic structure by applying a low pass filter at a given resolution. Here, density maps are generated at 4 nm resolution using the PDB2VOL program of the *Situs 2.0* package (Wriggers *et al.*, 1999) with voxel length of 1 nm. These initial density maps are then used as samples for simulating electron micrograph images at different tilt angles. In cryoET, the sample is tilted in small increments around a single-axis. At each tilt angle, a simulated micrograph is generated from the sample. We set the tilt angle rotating from −70 to 70^{○} with steps of 2^{○}, which is a typical procedure for experimental tomograms. As a result, our data contains a wedge-shaped region in Fourier space for which no data have been measured (missing wedge effects), similar to experimental measurements. The missing wedge effect leads to distortions of the density maps along the tilt-axis. To generate realistic micrographs, noise is added to the images and the resulting image map is convoluted with a CTF, which describes the imaging in the transmission electron microscope in a linear approximation. Any negative contrast values beyond the 1st zero of the CTF are eliminated. We also consider the MTF of a typical detector used in whole cell tomography, and convolute the density map with the corresponding MTF. The CTF and MTF describe distortions from interactions between electrons and the specimen and distortions due to the image detector (Frank, 2006; Nickell *et al.*, 2005). Typical acquisition parameters that were also used during actual experimental measurements of whole cell tomograms (Beck *et al.*, 2009) were used: voxel grid length=1 nm, the spherical aberration=2×10^{−3} m, the defocus value=−4×10^{−6}m, the voltage=200 kV, the MTF corresponded to a realistic electron detector (McMullan *et al.*, 2009), defined as sinc(πω/2) where ω is the fraction of the Nyquist frequency.

Finally, we use a backprojection algorithm to generate a tomogram from the individual 2D micrographs that were generated at the various tilt angles (Beck *et al.*, 2009). To test the influence of increasing noise, we add different amount of noise to the images, so that the SNR levels range between 5 and 0.5, respectively (Fig. 4).

### 2.5 Benchmark set

The classification is tested on simulated tomograms containing 40 complexes of four different classes (Fig. 4). To assess bias arising from specific combinations of complexes, a set of 24 types of complexes of variable sizes were selected from the PDB databank (Fig. 5). From this pool, 52 benchmark sets were generated that each contained four randomly chosen types of complexes. To generate a tomogram for each of these combinations, 10 instances of each complex were randomly oriented and placed into a grid of size 150 nm×150 nm×100 nm (Fig. 4). For two of the 52 benchmark sets (set 1 and set 2), 50 independent density maps were generated each with randomly placed complexes. For each density map, a tomogram was simulated at four different signal-to-noise ratios (SNR=0.5, 0.1, 5, ∞) (Fig. 4) leading to a total of 200 simulated tomograms per set. *Set 1* contains GroEL [1KP8], heat-shock protein ACR1 [2BYU], carboxipeptidase [2BO9] and propionyl-CoA carboxylase [1VRG] (PDB ID in squared brackets). *Set 2* contains ornithine carbamoyltransferase [1A1S], octomeric enolase[1W6T], RNA polymerase [2GHO] and ClpP [1YG6]). For the remaining 50 benchmark sets of complexes, tomograms were generated at SNR=0.5.

### 2.6 Analysis

For the simulated tomograms, **l** is compared to the known ground truth **l**^{true}. A true positive match is defined when a voxel's predicted class label *l*_{i} is identical to the true class label *l*_{i}^{true}. To assess the performance, the precision and recall of the classification is calculated. The *precision* is a measure of exactness defined as the fraction of the correctly predicted voxels,

where #**TP** is the number of true positives and #**TP**+#**FP** is the total number of voxels with the same class labels. The *recall* is a measure of completeness defined as the number of true positives divided by the total number of voxels of that class in the ground truth.

where #**FN** is the number of false negatives, i.e. the number of voxels that were not identified as class members. In addition, the precision and recall for classifying segmented objects is calculated. Here, class labels are defined for complexes (i.e., segmented objects) instead of individual voxels.

## 3 RESULTS

First, we analyze the effectiveness of the rotation-invariant feature vectors in detecting pattern similarities in a tomogram. Then we describe the performances of the initial pattern classification and the refined pattern classification based on the GHMRF approach.

### 3.1 Analysis of feature vectors

We now determine the locations of the most unique feature vectors in a complex. For each of the 24 benchmark complexes, a simulated density map is generated at 4 nm resolution (Wriggers *et al.*, 1999) and its rotation-invariant feature vectors are calculated. For each voxel in a complex, the distance is calculated between its feature vector and all the feature vectors in the other complexes. For each of the 24 complexes, the minimum distance is determined. For the given voxel, the average of all minimum distances is a measure of the feature vector's uniqueness with respect to the feature vectors in all the other complexes. The average minimum distance correlates strongly with the position of the voxel from the mass center of the complex (average Pearson's correlation −0.68±0.05). Voxels at the complex center have feature vectors that are most different from those in other complexes and are therefore most discriminative for classification purposes (Fig. 5). Moreover, larger complexes have generally a greater number of unique feature vectors (Fig. 5). These findings provide an important guide for increasing accuracy and computational efficiency of the method. Instead of processing all feature vectors in a tomogram, one should focus only on those vectors that are located at the central regions of a complex. Considering only the most informative feature vectors will not only increase the accuracy of the method but also greatly increase the computational efficiency and reduce the necessary computational memory consumption. Noise and distortions in a map will reduce the number of unique feature vectors, however, also then the central regions are most discriminative for classification. Accordingly, the similarity between the segmented objects in a tomogram is calculated by using only its central core regions.

### 3.2 Parameter definition

The classification accuracy is increased, if the similarity between segmented objects is calculated from their core regions. Here, the core region is set to be 500 nm^{3} and is defined by the termination of the adapted watershed algorithm after 500 voxels are selected: *S*_{s}^{core}={*v*_{s,r}|*r*=1,…,*r*_{s}^{max}=500}. The good performance for using a fixed rather than a relative sized core region is presumably a result of the limited size range of soluble complexes in a cell, which ranges typically up to ≈2700 nm^{3} (ribosome) with a mean of ≈656 nm^{3} in our sample. A slight variation of the core region size does not change the outcome of our analysis. However, using more extended regions will not improve but often decrease the classification accuracy while reducing computational efficiency significantly.

While the object similarities are determined from the core regions (S^{core}), the determined class labels are assigned to all voxels in an extended region *S*_{s}^{ext}={*v*_{s,r}|*r*=1,…,*r*_{s}^{max}=2000}.

### 3.3 Classification performance

We now analyze the performance of the method and distinguish between the assessment of individual voxels and segmented objects. In addition, the performance is analyzed with respect to different combinations of complex types and their relative placements in the tomograms.

#### 3.3.1 Voxel-based classification.

To compare the influence of noise, we have generated 50 tomograms for four different SNR levels (Tables 1 and and2).2). For benchmark set 1, the average precision of the initial classification is 0.44 with an average recall of 0.54 for tomograms without noise. With increasing noise levels, the performance reduces to 0.39 and 0.5 for the precision and recall, respectively. As expected, the GHMRF model improves significantly the precision and recall. For tomograms with the highest noise level, the average precision is improved from 0.39 to 0.44 in comparison to the initial classification (Table 1 and Fig. 6). These observations indicate that about 40% of all voxels can be predicted as members of the correct pattern class, even when significant noise and distortions are present in the tomogram. This excellent performance is in a similar range as classifications based on template matching.

**A**) (Left panel) Initial classification for a density region that contains a proteasome complex (blue color). It is evident that the proximity of the complex contains voxels that are false classified as being part of another complex class (grey color).

**...**

For benchmark set 2, precision and recall for the initial classification is substantially higher for tomograms with low noise levels in comparison to set 1. However, the initial classification is more affected by noise in the tomogram in comparison to benchmark set 1. The differences in performance presumably reflect the variable number of unique feature vectors in different complexes. The average precision decreases from 0.5 for tomograms without noise to 0.31 for tomograms with an SNR level of 0.5 (Table 2). Again, the GHMRF model improves the performance dramatically, in particular for tomograms with high noise levels. For tomograms with the highest noise level, the precision is improved from 0.31 to 0.51 in comparison to the initial classification (Tables 1 and and2).2). As a statistical inference method the GHMRF-based refinement appears more robust against the distortions in the tomogram due to missing wedge, electron optical factors and increasing noise levels.

To further test different combinations of complexes, 50 additional sets of randomly chosen complexes were tested. For all of these sets, tomograms were generated with SNR of 0.5. The average precisions, recall and their SDs are very similar to those of sets 1 and 2 [voxel-based GHMRF classification, averaged over all sets: precision 0.45 (0.12), recall 0.51 (0.12); object-based GHMRF classification: precision 0.62 (0.14), recall 0.62 (0.14)] (Supplementary Table S1).

#### 3.3.2 Object-based classification

Assessment of the classification can also be performed based on segmented objects rather than individual voxels. A true positive match is then defined if a segmented object is classified correctly even if not all of its voxels are detected. The object-based classification further improves precision and recall of the classifications (Tables 1 and and2).2). The average object-based precision for GHMRF classifications of tomograms without noise is 0.76 and 0.91 for sets 1 and 2, respectively. The corresponding average recall is 0.76 and 0.91. For set 2, the average precision at the highest noise level is 0.64 with a recall of 0.65, showing that >60% of all segmented objects were detected correctly.

#### 3.3.3 Influence of the object placement.

To assess the influence of the object placement, 50 different tomograms were generated for sets 1 and 2. The classification results are robust with the SDs for the average precisions of about 0.1–0.2 for the initial and GHMRF-based classifications at all noise levels (Tables 1 and and2).2). SDs for the average object-based precisions are in a similar range.

#### 3.3.4 Class member similarity.

There are generally two main reasons why some voxels are not correctly classified. First, voxels are unclassified and part of the background class (see class 4 in Fig. 6C). Second, identical complexes are sometimes grouped in two or more classes instead of a single class (Table 3, Fig. 6C). For instance, for the majority of tomograms in set 1, five instead of four recurrent classes have been identified (Table 3). In one example, the identical complexes of the class 3 were divided into two different groups after classification (see classes 3a and b in Fig. 6C). Although the complexes in the additional class are counted as false positives, all the members in the class are indeed identical complexes in this example. In general, for low noise levels ≈96% and for high noise levels ≈91% of the complexes in the same class are of the same type. It is, therefore, possible to align the subtomograms of these complexes in each class and generate an average density map of the complex with improved SNR. It may then be possible to identify sufficient similarities among the class-averaged density maps to redefine them to the same class.

## 4 CONCLUSIONS

We have introduced an inference-based template-free method for the detection and classification of frequently occurring protein complexes in tomograms. We have assessed our method on realistically simulated cryo electron tomograms at 4 nm resolution, which contain noise and distortions due to missing wedge and electron optical factors. Our method relies on an initial classification, which uses rotation-invariant feature vectors to provide an efficient way to calculate the similarity between segmented objects. This initial classification is further refined using an GHMRF model, which is less prone to noise and distortions and therefore improves the initial classification significantly. Indeed, for tomograms with an SNR of 0.5, between 44% and 51% of all voxels and between 64% and 71% of all segmented objects are classified correctly. Misclassification is mainly due to the grouping of identical complexes into separate classes. Importantly, more than 91% of complexes assigned to the same class are identical even at high noise levels. These results are encouraging and demonstrate that in principle it is possible to discover new complexes in cryo electron tomograms in an efficient manner.

The current work represents a first proof-of-principle of the method. Future improvements will focus on optimizing the method toward higher concentrations of complexes to levels observed in the crowded cell cytoplasm. Moreover, a number of limitations to visual proteomics might be overcome by further technical developments. In future, it may be possible to improve the moderate SNR level in cryoET, for instance, by improving the contrast in tomograms through phase plates (Murata *et al.*, 2010). Furthermore, specimen thinning techniques through focused ion beams (Murata *et al.*, 2010) will be crucial for improving SNR and imaging larger cell types, such as eukaryotic cells. Finally, direct electron detection systems promise to largely improve SNR of cameras (Murata *et al.*, 2010), which will be highly beneficial for cryoET. In summary, our results demonstrate the detection of frequently occurring complexes in tomographic maps, even at low SNR levels and without the need of available template structures. Our method can facilitate the discovery of new complexes in cryo electron tomograms. This task provides a step toward unbiased visual proteomics of cells, which aims to discover the shapes, abundance and spatial distributions of all large protein complexes in a cell.

## ACKNOWLEDGEMENTS

The authors thank Dr. Shihua Zhang for his valuable suggestions and discussions.

*Funding*: Human Frontier Science Program (RGY0079/2009-C to F.A.); National Institute of Health (NIH) (1R01GM096089 and 2U54RR022220-06 to F.A.), Alfred P. Sloan Research foundation (to F.A.); F.A. is a Pew Scholar in Biomedical Sciences, supported by the Pew Charitable Trusts.

*Conflict of Interest*: none declared.

## REFERENCES

- Alber F., et al. Integrating diverse data for structure determination of macromolecular assemblies. Ann. Rev. Biochem. 2008;77:443. [PubMed]
- Beck M., et al. Visual proteomics of the human pathogen Leptospira interrogans. Nat. Methods. 2009;6:817–823. [PMC free article] [PubMed]
- Beck M., et al. Exploring the spatial and temporal organization of a cell's proteome. J. Struct. Biol. 2011;173:483–496. [PMC free article] [PubMed]
- Besag J. On the statistical analysis of dirty pictures. J. R. Stat. Soc. Ser. B. 1986;48:259–302.
- Best C., et al. Localization of protein complexes by pattern recognition. Methods Cell Biol. 2007;79:615–638. [PubMed]
- Böhm J., et al. Toward detecting and identifying macromolecules in a cellular context: template matching applied to electron tomograms. Proc. Natl Acad. Sci USA. 2000;97:14245. [PMC free article] [PubMed]
- Dougherty E. Mathematical Morphology in Image Processing. Boca Raton, FL. USA: CRC Press, Inc.; 1993.
- Förster F., et al. Classification of cryo-electron sub-tomograms using constrained correlation. J. Struct. Biol. 2008;161:276–286. [PubMed]
- Frangakis A., et al. Identification of macromolecular complexes in cryoelectron tomograms of phantom cells. Proc. Natl Acad. Sci. USA. 2002;99:14153. [PMC free article] [PubMed]
- Frank J. Three-dimensional Electron Microscopy of Macromolecular Assemblies: Visualization of Biological Molecules in Their Native State. USA: Oxford University Press; 2006.
- Han B., et al. Survey of large protein complexes in D. vulgaris reveals great structural diversity. Proc. Natl Acad. Sci. USA. 2009;106:16580. [PMC free article] [PubMed]
- Harrington J., Salibián-Barrera M. Finding approximate solutions to combinatorial problems with very large data sets using BIRCH. Comput. Stat. Data Anal. 2008
- Hobson E. The Theory of Spherical and Ellipsoidal Harmonics. Cambridge, England: 1931.
- Kazhdan M., et al. Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing. Switzerland, Switzerland: Eurographics Association Aire-la-Ville; 2003. Rotation invariant spherical harmonic representation of 3D shape descriptors; pp. 156–164.
- Kelley L., et al. An automated approach for clustering an ensemble of nmR-derived protein structures into conformationally related subfamilies. Protein Eng. Des. Sel. 1996;9:1063. [PubMed]
- Li G., et al. Automatic cortical sulcal parcellation based on surface principal direction flow field tracking. NeuroImage. 2009;46:923–937. [PMC free article] [PubMed]
- Li S. Markov Random Field Modeling in Image Analysis. New York, USA: Springer; 2009.
- Lučić V., et al. Structural studies by electron tomography: from cells to molecules. Biochemistry. 2005;74:833. [PubMed]
- McMullan G., et al. Detective quantum efficiency of electron area detectors in electron microscopy. Ultramicroscopy. 2009;109:1126–1143. [PMC free article] [PubMed]
- Medalia O., et al. Macromolecular architecture in eukaryotic cells visualized by cryoelectron tomography. Science. 2002;298:1209. [PubMed]
- Murata K., et al. Zernike phase contrast cryo-electron microscopy and tomography for structure determination at nanometer and subnanometer resolutions. Structure. 2010;18:903–912. [PMC free article] [PubMed]
- Murphy G., Jensen G. Electron cryotomography. BioTechniques. 2007;43:413–415. [PubMed]
- Nickell S., et al. TOM software toolbox: acquisition and analysis for electron tomography. J. Struct. Biol. 2005;149:227–234. [PubMed]
- Saha M., et al. MOTIF-EM: an automated computational tool for identifying conserved regions in CryoEM structures. Bioinformatics. 2010;26:i301. [PMC free article] [PubMed]
- Tangelder J., Veltkamp R. A survey of content based 3D shape retrieval methods. Multimedia Tools Appl. 2008;39:441–471.
- Wriggers W., et al. Situs: a package for docking crystal structures into low-resolution maps from electron microscopy. J. Struct. Biol. 1999;125:185–195. [PubMed]
- Xu M., et al. Bioinformatics and Biomedicine, 2009. BIBM'09. IEEE International Conference on. Los Alamitos, CA, USA: IEEE; 2009. 3D rotation invariant features for the characterization of molecular density maps; pp. 74–78.
- Zhang T., et al. BIRCH: a new data clustering algorithm and its applications. Data Min. Know. Discov. 1997;1:141–182.
- Zhang Y., et al. Segmentation of brain MR images through a hidden Markov random field model and the expectation-maximization algorithm. IEEE Trans. Med. Imag. 2001;20:45–57. [PubMed]

**Oxford University Press**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- Printer Friendly

- Cryo-electron tomography for structural characterization of macromolecular complexes.[Curr Protoc Protein Sci. 2011]
*Cope J, Heumann J, Hoenger A.**Curr Protoc Protein Sci. 2011 Aug; Chapter 17:Unit17.13.* - Contrast transfer function correction applied to cryo-electron tomography and sub-tomogram averaging.[J Struct Biol. 2009]
*Zanetti G, Riches JD, Fuller SD, Briggs JA.**J Struct Biol. 2009 Nov; 168(2):305-12. Epub 2009 Aug 8.* - Classification of electron sub-tomograms with neural networks and its application to template-matching.[J Struct Biol. 2011]
*Yu Z, Frangakis AS.**J Struct Biol. 2011 Jun; 174(3):494-504. Epub 2011 Mar 5.* - Cryo-electron tomography: gaining insight into cellular processes by structural approaches.[Curr Opin Struct Biol. 2011]
*Yahav T, Maimon T, Grossman E, Dahan I, Medalia O.**Curr Opin Struct Biol. 2011 Oct; 21(5):670-7. Epub 2011 Aug 2.* - Cryo-electron tomography of cells: connecting structure and function.[Histochem Cell Biol. 2008]
*Lucić V, Leis A, Baumeister W.**Histochem Cell Biol. 2008 Aug; 130(2):185-96. Epub 2008 Jun 20.*

- High-throughput subtomogram alignment and classification by Fourier space constrained fast volumetric matching[Journal of structural biology. 2012]
*Xu M, Beck M, Alber F.**Journal of structural biology. 2012 May; 178(2)10.1016/j.jsb.2012.02.014* - Automated target segmentation and real space fast alignment methods for high-throughput classification and averaging of crowded cryo-electron subtomograms[Bioinformatics. 2013]
*Xu M, Alber F.**Bioinformatics. 2013 Jul 1; 29(13)i274-i282* - High precision alignment of cryo-electron subtomograms through gradient-based parallel optimization[BMC Systems Biology. ]
*Xu M, Alber F.**BMC Systems Biology. 6(Suppl 1)S18* - Putting structure into context: fitting of atomic models into electron microscopic and electron tomographic reconstructions[Current Opinion in Cell Biology. 2012]
*Volkmann N.**Current Opinion in Cell Biology. 2012 Feb; 24(1)141-147*

- PubMedPubMedPubMed citations for these articles

- Template-free detection of macromolecular complexes in cryo electron tomogramsTemplate-free detection of macromolecular complexes in cryo electron tomogramsBioinformatics. Jul 1, 2011; 27(13)i69PMC

Your browsing activity is empty.

Activity recording is turned off.

See more...