抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。

疟原虫var基因转换速率变化导致抗原变异[英]／Paul H, Robert P, Christodoulou Z, et al//Proc Natl Acad Sci U S A

The authors describe a general-purpose, representation-independent method for the accurate and computationally efficient registration of 3-D shapes including free-form curves and surfaces. The method handles the full six degrees of freedom and is based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point. The ICP algorithm always converges monotonically to the nearest local minimum of a mean-square distance metric, and the rate of convergence is rapid during the first few iterations. Therefore, given an adequate set of initial rotations and translations for a particular class of objects with a certain level of 'shape complexity', one can globally minimize the mean-square distance metric over all six degrees of freedom by testing each initial registration. One important application of this method is to register sensed data from unfixtured rigid objects with an ideal geometric model, prior to shape inspection. Experimental results show the capabilities of the registration algorithm on point sets, curves, and surfaces. >

A method for registration of 3-D shapes

We describe the testing and release of AutoDock4 and the accompanying graphical user interface AutoDockTools. AutoDock4 incorporates limited flexibility in the receptor. Several tests are reported here, including a redocking experiment with 188 diverse ligand-protein complexes and a cross-docking experiment using flexible sidechains in 87 HIV protease complexes. We also report its utility in analysis of covalently bound ligands, using both a grid-based docking method and a modification of the flexible sidechain technique.

https://onlinelibrary.wiley.com/doi/pdf/10.1002/jcc.21256

AutoDock4 and AutoDockTools4: Automated docking with selective receptor flexibility

Inference of macromolecular assemblies from crystalline state.

J. Appl. Cryst.の発刊に際して

Here, we describe two freely available web servers for molecular docking. The PatchDock method performs structure prediction of protein-protein and protein-small molecule complexes. The SymmDock method predicts the structure of a homomultimer with cyclic symmetry given the structure of the monomeric unit. The inputs to the servers are either protein PDB codes or uploaded protein structures. The services are available at http://bioinfo3d.cs.tau.ac.il. The methods behind the servers are very efficient, allowing large-scale docking experiments.

PatchDock and SymmDock: servers for rigid and symmetric docking

The docking field has come of age. The time is ripe to present the principles of docking, reviewing the current state of the field. Two reasons are largely responsible for the maturity of the computational docking area. First, the early optimism that the very presence of the "correct" native conformation within the list of predicted docked conformations signals a near solution to the docking problem, has been replaced by the stark realization of the extreme difficulty of the next scoring/ranking step. Second, in the last couple of years more realistic approaches to handling molecular flexibility in docking schemes have emerged. As in folding, these derive from concepts abstracted from statistical mechanics, namely, populations. Docking and folding are interrelated. From the purely physical standpoint, binding and folding are analogous processes, with similar underlying principles. Computationally, the tools developed for docking will be tremendously useful for folding. For large, multidomain proteins, domain docking is probably the only rational way, mimicking the hierarchical nature of protein folding. The complexity of the problem is huge. Here we divide the computational docking problem into its two separate components. As in folding, solving the docking problem involves efficient search (and matching) algorithms, which cover the relevant conformational space, and selective scoring functions, which are both efficient and effectively discriminate between native and non-native solutions. It is universally recognized that docking of drugs is immensely important. However, protein-protein docking is equally so, relating to recognition, cellular pathways, and macromolecular assemblies. Proteins function when they are bound to other molecules. Consequently, we present the review from both the computational and the biological points of view. Although large, it covers only partially the extensive body of literature, relating to small (drug) and to large protein-protein molecule docking, to rigid and to flexible. Unfortunately, when reviewing these, a major difficulty in assessing the results is the non-uniformity in the formats in which they are presented in the literature. Consequently, we further propose a way to rectify it here.

Principles of docking: An overview of search algorithms and a guide to scoring functions

A general method for model-based object recognition in occluded scenes is presented. It is based on geometric hashing. The method stands out for its efficiency. We describe the general framework of the method and illustrate its applications for various recogni- tion problems both in 3-D and 2-D. Special attention is given to the recognition of 3-D objects in occluded scenes from 2-D gray scale images. New experimental results are included for this important case.

Geometric Hashing: A General And Efficient Model-based Recognition Scheme

A matching algorithm using surface complementarity between receptor and ligand protein molecules is outlined. The molecular surfaces are represented by "critical points," describing holes and knobs. Holes (maxima of a shape function) are matched with knobs (minima). This simple and appealing surface representation has been previously described by Connolly [(1986) Biopolymers, Vol. 25, pp. 1229-1247]. However, attempts to implement this description in a docking scheme have been unsuccessful (e.g., Connolly, ibid.). In order to decrease the combinatorial complexity, and to make the execution time affordable, four critical hole/knob point matches were sought. This approach failed since some bound interfaces are relatively flat and do not possess four critical point matches. On the otherhand, matchings of fewer critical points require a very time-consuming, full conformational (grid) space search [Wang, (1991) Journal of Computational Chemistry, Vol. 12, pp. 746-750]. Here we show that despite the initial failure of this approach, with a simple and straightforward modification in the matching algorithm, this surface representation works well. Out of the 16 protein-protein complexes we have tried, 15 were successfully docked, including two immunoglobulins. The entire molecular surfaces were considered, with absolutely no additional information regarding the binding sites. The whole process is completely automated, with no manual intervention, either in the input atomic coordinate data, or in the matching. We have been able to reach this level of performance with the hole/knob surface description by using pairs of critical points along with their surface normals in the calculation of the transformation matrix. The success of this approach suggests that future docking methods should use geometric docking as the first screening filter.(ABSTRACT TRUNCATED AT 250 WORDS)

Shape complementarity at protein–protein interfaces

We present a new algorithm for unbound (real life) docking of molecules, whether protein-protein or protein-drug. The algorithm carries out rigid docking, with surface variability/flexibility implicitly addressed through liberal intermolecular penetration. The high efficiency of the algorithm is the outcome of several factors: (i) focusing initial molecular surface fitting on localized, curvature based surface patches; (ii) use of Geometric Hashing and Pose Clustering for initial transformation detection; (iii) accurate computation of shape complementarity utilizing the Distance Transform; (iv) efficient steric clash detection and geometric fit scoring based on a multi-resolution shape representation; and (v) utilization of biological information by focusing on hot spot rich surface patches. The algorithm has been implemented and applied to a large number of cases.

/pdf/efficient-unbound-docking-of-rigid-molecules-1nvpk1vcr5.pdf

Haim J. Wolfson

Papers

PatchDock and SymmDock: servers for rigid and symmetric docking

Principles of docking: An overview of search algorithms and a guide to scoring functions

Geometric Hashing: A General And Efficient Model-based Recognition Scheme

Shape complementarity at protein–protein interfaces

Efficient Unbound Docking of Rigid Molecules