view article

Figure 2
Schematic representation of the Patterson refinement procedure as applied to the MR solution of Fab domains. The search model (A) has an Fv and an Fc domain [red and green, connected by a hinge (the elbow angle)]; the relative orientation of the two domains in the search model is different from the orientation in the target (T). The rotation search performed with the intact Fab may provide several solutions, each matching one individual domain (B). These solutions are not easily distinguishable or rankable, and subsequent translation searches usually fail. PC refinement allows sampling of the relative orientation of the Fv and Fc regions, from which the `best model' can be identified (D). This model can then easily generate a solution in the translation search.

Journal logoBIOLOGICAL
ISSN: 1399-0047
Follow Acta Cryst. D
Sign up for e-alerts
Follow Acta Cryst. on Twitter
Follow us on facebook
Sign up for RSS feeds