| BUSTER User Manual | previous next | |
| Chapter 2 |
Copyright © 1995-2004 by Eric Blanc, Pietro Roversi, Clemens
Vonrhein,
Gérard Bricogne and the Buster Development Group.
All rights reserved.
The phases from the partial structure, missing atoms model, bulk solvent and if available, experimental phases, are combined together after a round of scaling to produce BUSTER model Fourier amplitudes and phases in the file mlphas.mtz;
The atomic parameters to be refined are those in PDBFRG. At each cycle BUSTER calculates the log-likelihood L = log L and its derivatives to first and second order w.r.t. the expectation of the total structure factor from the current model. The first-order derivatives (gradients) are the ML equivalents of the weighted difference coefficients used at the corresponding stage of the LS method. Just like the latter they are used by TNT, through system calls from BUSTER, to calculate the gradient of L in atomic parameter space by the Agarwal-Lifchitz method. The second-order derivatives are then used to calculate the (diagonal) curvatures of L in atomic parameter space. These gradients and curvatures are based on the available X-ray data, i.e. experimental amplitudes and optionally phase information. TNT builds similar gradients and curvatures for a geometric restraint criterion and, if required to do so, for other criteria such as compliance with non-crystallographic symmetry. Gradients and curvatures from all sources are then pooled with appropriate weights to build a shift direction in atomic parameter space. The final stage is to determine by a line search how far to move along that direction, then to apply the corresponding shifts and return control to BUSTER to initiate the next cycle. This iterative calculation keeps copious archives of its progress.
Assuming that the partial structure has already been refined, or that errors due to its imperfection are minor in comparison with those due to its incompleteness, we now request that BUSTER starts modulating the probability distribution of the missing atoms beyond the rather flat "prior prejudice" computed initially as prior by blurring the binary mask for the set-theoretic difference between the whole molecule and the fragment. This is done by selecting a subset of reflexions called the "trunk" (i.e. the unbranched part of a tree) through a combination of resolution and figure-of-merit criteria, then assigning to each trunk reflexion a Lagrange multiplier through which to carry out ME-modulation of the prior prejudice. This iterative process is conducted until convergence is reached, at which stage the initial prior is renamed oldprior and the ME map is written out as the new prior. The evolution of entropy loss and Bayesian score is monitored throughout the calculation.