Project-Team:CAPSID

Inria | Raweb 2015 | Presentation of the Project-Team CAPSID


	PDF	e-Pub

Previous |

Home | Next next

Section: Research Program

Integrative Multi-Component Assembly and Modeling

Context

At the molecular level, each PPI is embodied by a physical 3D protein-protein interface. Therefore, if the 3D structures of a pair of interacting proteins are known, it should in principle be possible for a docking algorithm to use this knowledge to predict the structure of the complex. However, modeling protein flexibility accurately during docking is very computationally expensive due to the very large number of internal degrees of freedom in each protein, associated with twisting motions around covalent bonds. Therefore, it is highly impractical to use detailed force-field or geometric representations in a brute-force docking search. Instead, most protein docking algorithms use fast heuristic methods to perform an initial rigid-body search in order to locate a relatively small number of candidate binding orientations, and these are then refined using a more expensive interaction potential or force-field model, which might also include flexible refinement using molecular dynamics (MD), for example.

Polar Fourier Docking Correlations

In our Hex protein docking program [48] , the shape of a protein molecule is represented using polar Fourier series expansions of the form

σ (\underset{̲}{x}) = \sum_{n l m} a_{n l m} R_{n l} (r) y_{l m} (θ, φ),

(1)

where $σ (\underset{̲}{x})$ is a 3D shape-density function, $a_{n l m}$ are the expansion coefficients, $R_{n l} (r)$ are orthonormal Gauss-Laguerre polynomials and $y_{l m} (θ, φ)$ are the real spherical harmonics. The electrostatic potential, $φ (\underset{̲}{x})$ , and charge density, $ρ (\underset{̲}{x})$ , of a protein may be represented using similar expansions. Such representations allow the in vacuo electrostatic interaction energy between two proteins, A and B, to be calculated as [35]

E = \frac{1}{2} \int φ_{A} (\underset{̲}{x}) ρ_{B} (\underset{̲}{x}) d \underset{̲}{x} + \frac{1}{2} \int φ_{B} (\underset{̲}{x}) ρ_{A} (\underset{̲}{x}) d \underset{̲}{x} .

(2)

This equation demonstrates using the notion of overlap between 3D scalar quantities to give a physics-based scoring function. If the aim is to find the configuration that gives the most favourable interaction energy, then it is necessary to perform a six-dimensional search in the space of available rotational and translational degrees of freedom. By re-writing the polar Fourier expansions using complex spherical harmonics, we showed previously that fast Fourier transform (FFT) techniques may be used to accelerate the search in up to five of the six degrees of freedom [49] . Furthermore, we also showed that such calculations may be accelerated dramatically on modern graphics processor units [8] , [6] . Consequently, we are continuing to explore new ways to exploit the polar Fourier approach.

Assembling Symmetrical Protein Complexes

Although protein-protein docking algorithms are improving [50] , [38] , it still remains challenging to produce a high resolution 3D model of a protein complex using ab initio techniques, mainly due to the problem of structural flexibility described above. However, with the aid of even just one simple constraint on the docking search space, the quality of docking predictions can improve dramatically [49] [8] . In particular, many protein complexes involve symmetric arrangements of one or more sub-units, and the presence of symmetry may be exploited to reduce the search space considerably [22] , [47] , [53] . For example, using our operator notation (in which $\hat{R}$ and $\hat{T}$ represent 3D rotation and translation operators, respectively), we have developed an algorithm which can generate and score candidate docking orientations for monomers that assemble into cyclic ( $C_{n}$ ) multimers using 3D integrals of the form

E_{A B} (y, α, β, γ) = \int [\hat{T} (0, y, 0) \hat{R} (α, β, γ) φ_{A} (\underset{̲}{x})] \times [\hat{R} (0, 0, ω_{n}) \hat{T} (0, y, 0) \hat{R} (α, β, γ) ρ_{B} (\underset{̲}{x})] d \underset{̲}{x},

(3)

where the identical monomers A and B are initially placed at the origin, and $ω_{n} = 2 π / n$ is the rotation about the principal $n$ -fold symmetry axis. This example shows that complexes with cyclic symmetry have just 4 rigid body DOFs, compared to $6 (n - 1)$ DOFs for non-symmetrical $n$ -mers. We have generalised these ideas in order to model protein complexes that crystallise into any of the naturally occurring point group symmetries ( $C_{n}$ , $D_{n}$ , $T$ , $O$ , $I$ ). Although we currently use shape-based FFT correlations, the symmetry operator technique may equally be used to refine candidate solutions using a more accurate CG force-field scoring function.

Coarse-Grained Models

Many approaches have been proposed in the literature to take into account protein flexibility during docking. The most thorough methods rely on expensive atomistic simulations using MD. However, much of a MD trajectory is unlikely to be relevant to a docking encounter unless it is constrained to explore a putative protein-protein interface. Consequently, MD is normally only used to refine a small number of candidate rigid body docking poses. A much faster, but more approximate method is to use coarse-grained (CG) normal mode analysis (NMA) techniques to reduce the number of flexible degrees of freedom to just one or a handful of the most significant vibrational modes [43] , [26] , [40] , [41] . In our experience, docking ensembles of NMA conformations does not give much improvement over basic FFT-based soft docking [9] , and it is very computationally expensive to use side-chain repacking to refine candidate soft docking poses [2] .

In the last few years, CG force-field models have become increasingly popular in the MD community because they allow very large biomolecular systems to be simulated using conventional MD programs [21] . Typically, a CG force-field representation replaces the atoms in each amino acid with from 2 to 4 “pseudo-atoms”, and it assigns each pseudo-atom a small number of parameters to represent its chemo-physical properties. By directly attacking the quadratic nature of pair-wise energy functions, coarse-graining can speed up MD simulations by up to three orders of magnitude. Nonetheless, such CG models can still produce useful models of very large multi-component assemblies [52] . Furthermore, this kind of coarse-graining effectively integrates out many of the internal DOFs to leave a smoother but still physically realistic energy surface [34] . We are therefore developing a “coarse-grained” scoring function for fast protein-protein docking and multi-component assembly.

Assembling Multi-Component Complexes and Integrative Structure Modeling

We also want to develop related approaches for integrative structure modeling using cryo-electron microscopy (cryo-EM). Thanks to recently developments in cryo-EM instruments and technologies, its is now feasible to capture low resolution images of very large macromolecular machines. However, while such developments offer the intriguing prospect of being able to trap biological systems in unprecedented levels of detail, there will also come an increasing need to analyse, annotate, and interpret the enormous volumes of data that will soon flow from the latest instruments. In particular, a new challenge that is emerging is how to fit previously solved high resolution protein structures into low resolution cryo-EM density maps. However, the problem here is that large molecular machines will have multiple sub-components, some of which will be unknown, and many of which will fit each part of the map almost equally well. Thus, the general problem of building high resolution 3D models from cryo-EM data is like building a complex 3D jigsaw puzzle in which several pieces may be unknown or missing, and none of which will fit perfectly. Although we do not have precise roadmap to a solution for the multi-component assembly problem, we wish to proceed firstly by putting more emphasis on the single-body terms in the scoring function, and secondly by using fast CG representations and knowledge-based distance restraints to prune large regions of the search space.

Previous |

Home | Next next