0% found this document useful (0 votes)
13 views7 pages

Ba 5070

Uploaded by

fengyu1006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
13 views7 pages

Ba 5070

Uploaded by

fengyu1006
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

research papers

Acta Crystallographica Section D


Biological
Coot: model-building tools for molecular graphics
Crystallography
ISSN 0907-4449

Paul Emsley* and Kevin Cowtan CCP4mg is a project that aims to provide a general-purpose Received 26 February 2004
Accepted 4 August 2004
tool for structural biologists, providing tools for X-ray
structure solution, structure comparison and analysis, and
York Structural Biology Laboratory, University of
York, Heslington, York YO10 5YW, England
publication-quality graphics. The map-®tting tools are avail-
able as a stand-alone package, distributed as `Coot'.

Correspondence e-mail:
emsley@ysbl.york.ac.uk
1. Introduction
Molecular graphics still plays an important role in the deter-
mination of protein structures using X-ray crystallographic
data, despite on-going efforts to automate model building.
Functions such as side-chain placement, loop, ligand and
fragment ®tting, structure comparison, analysis and validation
are routinely performed using molecular graphics. Lower
resolution (dmin worse than 2.5 A Ê ) data in particular need
interactive ®tting.
The introduction of FRODO (Jones, 1978) and then O
(Jones et al., 1991) to the ®eld of protein crystallography was in
each case revolutionary, each in their time breaking new
ground in demonstrating what was possible with the current
hardware. These tools allowed protein crystallographers to
enjoy what is widely held to be the most thrilling part of their
work: giving birth (as it were) to a new protein structure. The
CCP4 program suite (Collaborative Computational Project,
Number 4, 1994) is an integrated collection of software for
macromolecular crystallography, with a scope ranging from
data processing to structure re®nement and validation. Until
recently, molecular graphics had not been part of the suite.
With the recent computational and graphical performance of
relatively cheap hardware, the time had arrived for CCP4 to
provide graphical functionality for knowledge-based (semi-)-
automatic building using powerful modern languages in a
¯exible extendible package. CCP4mg (Potterton et al., 2004) is
an initiative by CCP4 to provide libraries and a molecular
graphics application that is a popular system for represent-
ation, modelling, structure determination, analysis and
validation. The aim is to provide a system that is easy to use
and a platform for developers who wish to integrate macro-
molecular computation with a molecular-graphics interface.
There are several modules to such graphical functionality; the
protein model-building/map-®tting tools described here are
only a part. These tools are available as a stand-alone software
package, Coot.
A map-®tting program has to provide certain functionality,
which is not required by a molecular-display program. These
functions include symmetry coordinates, electron-density map
contouring and the ability to move the coordinates in various
# 2004 International Union of Crystallography ways, such as model idealization or according to side-chain
Printed in Denmark ± all rights reserved rotamer probabilities.

2126 doi:10.1107/S0907444904019158 Acta Cryst. (2004). D60, 2126±2132


research papers
The map-®tting and model-building functions described 2.3. Interface to REFMAC
here have a functionality broadly similar to that of programs On reading an MTZ ®le one can optionally assign para-
such as O, Xtalview from X®t (McRee, 1999) or QUANTA meters for running REFMAC (Murshudov et al., 1997).
(Accelrys, San Diego, CA, USA). However, in the spirit of the REFMAC is a program of the CCP4 suite for maximum-
CCP4 program suite, it is possible for others to read and likelihood-based macromolecular re®nement. After a period
modify the program. of interactive model building, the user can choose to use
Coot attempts (generally speaking) to provide more trans- REFMAC to re®ne the current coordinates (in combination
parency, ease of use, better extendability, (semi-)automated with MTZ parameters). Coot blocks until REFMAC has
model-building methods and convenient integration with terminated and then automatically reads the newly generated
programs of the CCP4 suite. (re®ned) coordinates and MTZ ®le, from which a map is
generated (and displayed).

2. Program functions 2.4. Rigid-body refinement


Coot has been substantially built around two major libraries: Clipper library functions provide easy access to the map
mmdb (Krissinel et al., 2004), a library for the handling of gradients. For a selected coordinate set, the map gradients at
macromolecular coordinates, and Clipper (Cowtan, 2002, the atom centres are averaged. A shift is applied (to all the
2003), a library for crystallographic objects and computation selected atoms) that is some simple fraction of the average
thereof. The various functions of Coot are split into `stand- gradient. The rotational component of the rigid-body re®ne-
alone' classes in the sense that an attempt has been made to ment is generated in the following manner: the rotations to be
minimize the dependence of the classes on anything other calculated ( x, y and z) are (small) rotations around the
than the above libraries. With portability in mind, special coordinate axes, the centre of rotation (V) being the centre of
effort was made not to introduce GUI dependences into the the rotating atoms. Let Vpi be the projection on to the XY
interface to Coot's library of tools. plane of the vector between the position of atom i and V, the
Coot is event-driven; functions are only run as a result of cp . The dot product of the gradient with V
unit vector being V cp
i i
user action (typically moving or clicking the mouse). provides dVp .
i
The required angle is arctan dVp =jVj†. These angles are
i
available for each atom and they are averaged to obtain three
2.1. Symmetry perpendicular rotations: x, y and z. These angle transfor-
Coordinate symmetry is recomputed and redisplayed at mations are applied to the coordinates. The application of
every recentre event. For each molecule for which the user transformations continues until the average shift length is less
wishes to display symmetry, symmetry atoms are displayed than 0.0005 A Ê.
within a particular distance criterion of the display centre. By This is a reasonable approach for much of a protein's
using a set of pre-computed guide points that mark the extents structure, but could behave badly where there is a combina-
of the molecule and applying the symmetry operators and cell tion of relatively heavy and light atoms, such as sulfates or
shifts to these guide points, a set of operator indexes and cell methionines. This problem could be countered by weighting
shifts are generated that may contain symmetry-related atoms the atom-density score by the atomic weight.
close to the screen centre (where `close' is de®ned by a user-
settable parameter). For each of these sets, all atoms in the 2.5. Rotamers
molecule are transformed and a check is made for each to see
The rotamer library used in Coot is the backbone-
if it is within the symmetry display radius of the position at the
independent library of Dunbrack & Cohen (1997). It is formed
centre of the screen. Thus, symmetry is kept current and
from a reasonably large sample set (850 chains), is reasonably
relevant to the current display centre.
up to date (May 2002) and provides a more accurate estima-
tion of the population of rare rotamers.
2.2. Electron density The Coot function `Auto-®t Rotamer' takes a set of most
likely rotamers for a particular side chain and generates
Because Coot is based on the Clipper libraries, it is easy to
coordinates for each rotamer. Each test rotamer is then rigid-
generate maps by reading a ®le of structure factors that
body re®ned and the ®nal position is scored according to the
contain phase information (typically an MTZ ®le). Density is
®t to the density (the residue's backbone atoms are included in
not limited to any particular part of the unit cell; the relevant
the set of re®ned atoms). The best ®t rotamer is chosen and
symmetry-related density is generated (and then contoured)
replaces the previous coordinates.
automatically using Clipper functionality. The electron-
density maps can be simply recontoured (provoked by script
or keyboard or mouse events) at a different level using a 2.6. Regularization and refinement
predetermined increment. Every map (displayed or un- Molecular-graphics model building requires the ability to
displayed) is regenerated and contoured: this process is not regularize (`idealize') the coordinates of the model. In order to
optimally fast but simpli®es the user interface. do so, the ideal values of the geometry of the macromolecule

Acta Cryst. (2004). D60, 2126±2132 Emsley & Cowtan  Model-building tools for molecular graphics 2127
research papers
should be known. These ideal values can come in various position is determined from the mean position of the grid
forms. The interface in Coot reads the mmCIF dictionaries of coordinates of the cluster. This position is then optimized by
REFMAC, which de®ne idea values and estimated standard re®ning the position to the local maximum as determined by
deviations for bond lengths, angles, torsions planes and chiral cubic interpolation of the map. A map sphericity test is then
centres. Coot uses the Polak±Ribiere variant of the BFGS applied; the variance of the cubic interpolated electron density
(Broyden±Fletcher±Goldfarb±Shanno) conjugate-gradient Ê from the local maximum in positive
at points 0.3, 0.6 and 0.9 A
multi-variable function minimizer to optimize the coordinates. and negative offsets along the x, y and z axes are determined.
The analytical gradient derivations are described in The variances are summed and must be lower than a user-
Appendix A. changeable cutoff (default 0.07 e2 A Ê ÿ6). The successful posi-
2.6.1. Fitting to the map. As described above, the map tions are then compared with the coordinates of the protein's
gradients are provided by a Clipper function. These map O and N atoms. If the distance is between user-changeable
gradients (at the positions of the atom centres) are simply criteria (default 2.4±3.4 AÊ ) then the position is accepted as a
multiplied by a (user-changeable) scaling factor and added to solvent O atom and (optionally) added to the protein model.
the geometric terms to de®ne the target function (this is called
`Re®nement' in Coot). 2.8. Add terminal residue
Given the selection of a terminal residue (which also could
2.7. Finding ligands merely be the start of a gap of unplaced residues), two residue-
type independent randomly selected '/ pairs are made from
A map can be masked by a set of coordinates (typically
Clipper's Ramachandran distribution of '/ pairs. These
those of the currently determined atoms of the protein
angles are used to generate positions of C, C , O and N main-
model). This approach leaves a map that has positive density
chain atoms for the neighbouring two residues using the
at places where there are no atoms to represent that density
peptide geometry. This set of atoms then undergo rigid-body
(similar, in fact, to an Fo ÿ Fc map). This masked map is
re®nement to optimize the ®t to the map. The score of the ®t
searched for `clusters' of density above a particular level. The
and the positions of the atoms are recorded. This procedure is
clustering of the grid points of the asymmetric unit into
then repeated a number of times (by default 100). The main-
potential ligand sites is performed conveniently using a
chain atoms of the neighbouring residue's best-®t atoms are
recursive neighbour search of the map. The clusters are sorted
then offered as a position of the neighbouring residue (the
according to size and electron-density value. Eigenvalues and
atoms of the next neighbouring residue are discarded).
eigenvectors are calculated for each cluster of grid points.
Similarly, the eigenvalues and eigenvectors of the search
ligands (there can of course be just one search ligand) are 2.9. Skeletonization and Ca building
computed (the parameters being the positions of the atom Coot uses a Clipper map to generate and store the skeleton.
centres). The eigenvalues of the ligands are compared with the This approach is convenient because, like electron-density
eigenvalues of each of the electron-density clusters and if they maps, the skeleton can be displayed `on the ¯y' anywhere in
are suf®ciently similar the ligand is placed into the cluster by the crystal (i.e. it is not limited to a precalculated region). The
matching the centre of the test ligand and the centre of the Clipper skeletonization algorithm is similar to that employed
cluster. The ligand is oriented in each of the four different in DM from CCP4 (Cowtan, 1994). A skeleton `bond' (bone)
orientations that provide coinciding eigenvectors and then is drawn between neighbouring map grid points if both parts
rigid-body re®ned and scored. The score is simply the sum of are marked as skeleton points.
the electron density at the atom centres. The score at each site The skeleton can be further trimmed by recursive tip
for each different ligand is compared and the best ®t (highest removal (a tip being a grid point with one or zero neighbours).
score with suf®cient fraction of atoms in positive density after This process removes side chains and, potentially, parts of the
the rigid-body re®nement) is chosen. This last check ensures termini, but provides an easy means of identifying the fold and
that oversized ligands are not ®tted into small clusters. non-crystallographic symmetry.
2.7.1. Flexible ligands. Instead of having a series of Like some validation (Kleywegt, 1997) and other attempts
different ligand compounds, the search ligands can be gener- at automated model building (Morris et al., 2002; Old®eld &
ated from a single ligand that has rotatable bonds. The ligand Hubbard, 1994; Old®eld, 2001), a likelihood distribution for
dictionary provides a description of the geometry of the ligand the pseudo-torsion angle C (n)ÐC (n + 1)ÐC (n + 2)Ð
including torsions. These torsions are randomly sampled for a C (n + 3) versus the angle C (n + 1)ÐC (n + 2)ÐC (n + 3)
number of trials (by default 1000) to provide coordinates that has been generated from high-resolution structures in the
can be checked against the potential ligand sites as described PDB (Berman et al., 2000) (Fig. 1). Once at least three C
above. An enhancement would be to allow the determination atoms have been placed, this is used as prior knowledge in the
of the number of trials to depend on the number of torsions. placement of the next C position in the following manner.
2.7.2. Finding water molecules. The electron density is Skeleton points between 2.4 and 3.4 A Ê from the current C
clustered as described for ligands. For clusters that have a position (which has an associated nearby skeleton point) are
volume below a certain upper limit (4.2 A Ê 3, which stops water selected. These skeleton points are tested for direct connec-
molecules being placed in multi-atom ligand sites) a starting tivity to the current skeleton point. Skeleton points that are

2128 Emsley & Cowtan  Model-building tools for molecular graphics Acta Cryst. (2004). D60, 2126±2132
research papers
C coordinates are converted to main-chain coordinates in a
manner similar to that previously described (Jones & Thirup,
1986; Esnouf, 1997).

APPENDIX A
Regularization and refinement derivatives
The function that we are trying to minimize is S, where
S ˆ Sbond ‡ Sangle ‡ Storsion ‡ Splane :

Let us take these four parts in turn.

A1. Bonds

NP
bonds
Sbond ˆ bi ÿ b0i †2 ;
iˆ1

where b0i is the ideal length (from the dictionary) of the ith
bond, bi is the bond vector and bi is its length.
@Si @S @b @b
ˆ i i ˆ ‰2 bi ÿ b0i †Š i ;
Figure 1 @xm @bi @xm @xm
C pseudo-torsion angle versus opening angle for proteins in the PDB
used in the likelihood assignment of potential C positions.
bi ˆ ‰ xm ÿ xk †2 ‡ ym ÿ yk †2 ‡ zm ÿ zk †2 Š1=2 :
Therefore
directly connected are assigned a score of 100; those that are
 
unconnected are assigned a score of 0.1. For each selected @bi 11 x ÿ xk †
skeleton point, a test point is then generated 3.8 A Ê from the ˆ 2 xm ÿ xk † ˆ m
@xm 2 bi bi
current C position in the direction of skeleton point. A C
pseudo-torsion angle and angle pair are generated from the and
position of the test point, the current C position and the two @Si x ÿ xk †
previously assigned C positions. This pseudo-torsion angle ˆ 2‰bi ÿ b01 Š m :
@xm bi
and angle pair are used to generate a score by looking up the
value in the internal representation of Fig. 1 using cubic
interpolation. This value is combined with the skeleton-based
score for this particular test point. This procedure is then A2. Angles
repeated in a `look-ahead' manner, assuming that the test We are trying to minimize Sangle, where (for simplicity, the
point is a member of the set of four C positions generating weights have been omitted)
the C pseudo-torsion/angle pair. The most likely solution for
Nangles
the look-ahead is combined with the score for the current test P
Sangle ˆ i ÿ 0 i † 2 :
point. The test points are then sorted by combined score and iˆ1
interactively offered as potential positions for the next C
atom, the positions with the best score being offered ®rst. Angle  is contributed to by atoms k, l and m:
Occasionally (usually as a result of a positional error in the cos  ˆ a  b†= ab†;
current C position), 3.8 A Ê is the wrong distance to the next
correct C position; thus the user is allowed to change the where a is the bond of atoms k and l [(xk ÿ xl), (yk ÿ yl),
length to something other than 3.8 A Ê. (zk ÿ zl)] and b is the bond of atoms l and m [(xm ÿ xl),
The depth of the look-ahead in the current implementation (ym ÿ yl), (zm ÿ zl)]. Note that the vectors point away from the
is at level 1 but could trivially be extended (in tests, a level 2 middle atom l.
look-ahead was better but took too long to be considered Therefore,
pleasantly interactive).  ˆ a cos P†; 1†
This algorithm has room for improvement: for example, by
considering the value of the density at the test point and along where
the C pseudo-bond, one-third and two-thirds of the way
P ˆ a  b†= ab†:
along the bond (corresponding to positions that are close to
the peptide C and N atoms; Old®eld, 2003). Using the chain rule,

Acta Cryst. (2004). D60, 2126±2132 Emsley & Cowtan  Model-building tools for molecular graphics 2129
research papers
@ @ @P A4. Angles: an end atom (atoms k or m)
ˆ : 2†
@xk @P @xk This case is simpler because there are no cross-terms in
Given that we are only interested in  in the range 0 ! , @R=@xk and @Q=@xk .
@ 1 @R x ÿ xl †
ˆÿ : 3† ˆ k :
@P sin  @xk ab
Again using the chain rule, and
@P @R @Q @Q
ˆQ ‡R ; 4† ˆ xm ÿ xl †;
@xk @xk @xk @xk
where and so
 
Q ˆ a  b; 5† @ 1 xl ÿ xk † xm ÿ xl
ˆÿ cos  ‡ : 8†
@xk sin  a2 ab
R ˆ 1= ab†: 6†

A5. Torsion angles

A3. Angles: the middle atom The torsion angle is the angle between a  b and b  c
(Fig. 2) and this can be written as
A middle atom is somewhat more tricky than an end atom   
because the derivatives of ab and a  b are not so trivial. Let us arctan a  b^  c†= ÿa  c ‡ a  b†
^ b^  c† ; 9†
change the indexing so that we are actually talking about the
middle atom, l. where b^ is a unit vector in the direction of b, b^ ˆ b=b.
Differentiating (6) gives This de®nition of the torsion angle is used rather than the
more common de®nition, which uses three cross-products,
@R 1 @a 1 @b because our version and its derivatives are faster to calculate.
ˆÿ 2b ÿ 2a : 7†
@xl ab† @xl ab† @x l Let us split the expression up into tractable portions; the
evaluation of  in the program will combine these expressions,
@a=@xl here is exactly the same as for bonds,
starting at the end (the most simple).
@a xl ÿ xk From the primatives,
ˆ :
@xl a
ax ˆ P2x ÿ P1x ; bx ˆ P3x ÿ P2x ; cx ˆ P4x ÿ P3x ;
Similarly,
@b xl ÿ xm ay ˆ P2y ÿ P1y ; by ˆ P3y ÿ P2y ; cy ˆ P4y ÿ P3y ;
ˆ :
@xl a
az ˆ P2z ÿ P1z ; bz ˆ P3z ÿ P2z ; cz ˆ P4z ÿ P3z ;
Therefore, substituting these equations into (7) gives
@R x ÿx x ÿx  ˆ arctan D†;
ˆÿ l 3 kÿ l 3 m:
@xl ab ab
where
Turning to Q, recall (5); therefore a  b  c†=b
 Dˆ :
Q ˆ xk ÿ xl † xm ÿ xl † ‡ yk ÿ yl † ym ÿ yl † ÿa  c ‡ a  b† b  c†=b2

‡ zk ÿ zl † zm ÿ zl † So
and hence
@Q
ˆ ÿ xk ÿ xl † ÿ xm ÿ xl †:
@xl
Substituting all the above into (4) gives
@P  x ÿx x ÿ x  ÿ xk ÿ xl † ÿ xm ÿ xl †
ˆ a  b† ÿ l 3 k ÿ l 3 m ‡ :
@xl ab ab ab
Combining this expression and (3) into (2) we obtain
@ 1 @P
ˆ :
@xl sin  @xl
Figure 2
Nomenclature used for torsion angles.

2130 Emsley & Cowtan  Model-building tools for molecular graphics Acta Cryst. (2004). D60, 2126±2132
research papers
@ @ @D @L 2 xP ÿ xP2 2 xP3 ÿ xP2 †
ˆ ; 10† ˆÿ 3 3 ˆÿ :
@xP1 @D @xP1 @xP3 b b b4

@ 1 @D The derivative with respect to xP2 has the opposite sign.


ˆ : 11† Notice that b involves only atoms P2 and P3, so that the
@xP1 1 ‡ D2 @xP1
derivates of L with respect to the P1 and P4 coordinates are
Let zero.
E ˆ a  b  c†=b;
A6. Torsion angles: @E/@x terms

F ˆ ‰ÿa  c ‡ a  b† b  c†=bŠÿ1 ; Recall that


E ˆ a  b  c†=b:
F ˆ 1=G; 12†
Let
2
G ˆ ÿa  c ‡ a  b† b  c†=b ; M ˆ a  b  c†;
i.e.
H ˆ ÿa  c;
E ˆ M=b:
J ˆ a  b;
Differentiating gives
K ˆ b  c; @E M @b 1 @M
ˆÿ 2 ‡ ;
@xP3 b @xP3 b @xP3
L ˆ 1=b2 :
where, as for bonds,
Differentiating (12) gives xP ÿ xP2
@b
@F 1 @G ˆ 3 :
ˆÿ 2 : @xP3 b
@xP1 G @xP1
However, note again that the derivative of b is zero for atoms
Substituting for the derivative in (10), P1 and P4, i.e. for atoms P2 and P3
!
@ 1 @E @F @E M xP3 ÿ xP2 † 1 @M
ˆ F ‡E : ˆÿ ‡ ;
@xP1 1 ‡ D2 @xP1 @xP1 @xP3 b3 b @xP3

We also have but for atoms P1 and P4


@E 1 @M
G ˆ H ‡ JKL: ˆ ;
@xP1 b @xP1
Differentiating this gives
@G @H @K @J @L M ˆ ax by cz ÿ bz cy † ‡ ay bz cx ÿ bx cz † ‡ az bx cy ÿ by cx †:
ˆ ‡ JL ‡ KL ‡ JK :
@xP1 @xP1 @xP1 @xP1 @xP1 So here are the primitives of M ˆ a  b  c†
The H, J, K and L derivatives are @M
ˆ ÿ by cz ÿ bz cy †;
H ˆ ÿa  c ˆ ÿax cx ÿ ay by ÿ az cz ; @xP1

@H @H @H @H @M
ˆ cx ; ˆ ÿcx ; ˆ ax ; ˆ ÿax ; ˆ by cz ÿ bz cy † ‡ ay cz ÿ az cy †;
@xP1 @xP2 @xP3 @xP4 @xP2
@K @K @K
ˆ 0; ˆ ÿcx ; ˆ cx ‡ bx ; @M
@xP1 @xP2 @xP3 ˆ az cy ÿ ay cz † ‡ by az ÿ bz ay †;
@xP3
@K @J @J
ˆ bx ; ˆ ÿbx ; ˆ bx ÿ ax ;
@xP4 @xP1 @xP2 @M
ˆ ay bz ÿ az by †;
@J @J @xP4
ˆ ax ; ˆ 0:
@xP3 @xP4
@M
The @b=@x terms are just like the bond derivatives, ˆ ÿ bz cx ÿ bx cz †;
@yP1
@L @L @b
ˆ ; @M
@xP1 @b @xP1 ˆ bz cx ÿ bx cz † ‡ az cx ÿ ax cz †;
@yP2
i.e.

Acta Cryst. (2004). D60, 2126±2132 Emsley & Cowtan  Model-building tools for molecular graphics 2131
research papers
@M Recall the equation of a plane: ax + by + cz + d = 0. Firstly,
ˆ ÿ az cx ÿ ax cz † ‡ bz ax ÿ bx az †;
@yP3 the centres of the sets of atoms, xcen, ycen, zcen, are determined.
The plane is moved so that it crosses the origin and therefore
@M d = 0 (it is moved back later). The problem then involves three
ˆ ÿ bz ax ÿ bx az †;
@yP4 equations, three unknowns and an eigenvalue problem, with
the smallest eigenvalue corresponding to the best-®t plane.
@M The least-squares planes of the plane restraints are recal-
ˆ ÿ bx cy ÿ by cx †; culated at every iteration.
@zP1
The authors thank Garib Murshudov, Eleanor J. Dodson,
@M Jack Quine and the many Coot testers. KC is supported by The
ˆ bx cy ÿ by cx † ‡ ax cy ÿ ay cx †;
@zP2 Royal Society (grant No. 003R05674). PE is funded by
BBSRC grant No. 87/B17320.
@M
ˆ ÿ ax cy ÿ ay cx † ‡ ay bx ÿ ax by †;
@zP3 References
Berman, H. M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T. N.,
@M Weissig, H., Shindyalov, I. N. & Bourne, P. E. (2000). Nucleic Acids
ˆ ÿ ay bx ÿ ax by †:
@zP4 Res. 28, 235±242.
Collaborative Computational Project, Number 4 (1994). Acta Cryst.
D50, 760±766.
Cowtan, K. (1994). Jnt CCP4/ESF±EACBM Newsl. Protein Crystal-
A7. Combining terms logr. 31, 34±38.
Cowtan, K. (2002). Jnt CCP4/ESF±EACBM Newsl. Protein Crystal-
Combining, we obtain the following expression for the logr. 40.
derivative of torsion angle  in terms of the primitive deri- Cowtan, K. (2003). Crystallogr. Rev. 9, 73±80.
vates, Dunbrack, R. L. Jr & Cohen, F. E. (1997). Protein Sci. 6, 1661±1681.
Esnouf, R. M. (1997). Acta Cryst. D53, 665±672.
@ 1 @D Jones, T. A. (1978). J. Appl. Cryst. 11, 268±272.
ˆ ;
@xP1 1 ‡ tan2 † @xP1 Jones, T. A., Cowan, S., Zou, J.-Y. & Kjeldgaard, M. (1991). Acta
Cryst. A47, 110±119.
where Jones, T. A. & Thirup, S. (1986). EMBO J. 5, 891±822.
" !# Kleywegt, G. J. (1997). J. Mol. Biol. 273, 371±376.
@D @E E @H @K @J @L Krissinel, E. B, Winn, M. D., Ballard, C. C., Ashton, A. W., Patel, P.,
ˆ F ÿ ‡ JL ‡ KL ‡ JK : Potterton, E. A., McNicholas, S. J., Cowtan, K. D. & Emsley, P.
@xP1 @xP1 G2 @xP1 @xP1 @xP1 @xP1
(2004). Acta Cryst. D60, 2250±2255.
McRee, D. E. (1999). J. Struct. Biol. 125, 156±165.
Morris, R. J., Perrakis, A. & Lamzin, V. S. (2002). Acta Cryst. D58,
968±975.
A8. Planes Murshudov, G. N., Vagin, A. A. & Dodson, E. J. (1997). Acta Cryst
D53, 240±255.
Old®eld, T. J. (2001). Acta Cryst. D57, 82±94.
Nplanes Natomsi
P P Old®eld, T. J. (2003). Acta Cryst. D59, 483±491.
Splane ˆ e2ij ; Old®eld, T. J. & Hubbard, R. E. (1994). Proteins Struct. Funct. Genet.
iˆ1 jˆ1 18, 324±337.
Potterton, L., McNicholas, S., Krissinel, E., Gruber, J., Cowtan, K.,
where eij is the distance of the ith plane restraint's jth atom Emsley, P., Murshudov, G. N., Cohen, S., Perrakis, A. & Noble, M.
from the ith plane restraint's least-squares plane. (2004). Acta Cryst. D60, 2288±2294.

2132 Emsley & Cowtan  Model-building tools for molecular graphics Acta Cryst. (2004). D60, 2126±2132

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy