Philip R. EvanspersName, Garib N. MurshudovpersName (2013date). “How good are my data and what is the resolution?.” Acta Crystallographica Section Dtitle·venue.
Object of study — WHERE TO CUT A DATA SET OFF - the resolutionterm limit every crystal structure declares, tested against refinement, automated model buildingterm and simulated dataterm, and then explicitly refused as a rule
Research question — at what point weak high-resolution dataterm stop carrying information, and whether any of the data-processing statisticsterm marks that point
Contribution — the AIMLESSterm scaling program, and evidence that CC1/2 is a better resolutionterm criterion than the traditional <I/sigma> - together with the finding that extending past the conventional limit 'does no harm'
phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text| phenomenon | a threshold whose value depends on the use the data is put to, and whose main friction is with referees — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction.” | |
| claim-type | method — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | |
| method — evidence | — “Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule. With increasing resolution the R factors and D values for experimental data converge towards the values from simulated data, but the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.” | |
| object of study — evidence | — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction.” | |
| research question — evidence | — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation.” | |
| contribution — evidence | — “The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm.” | |
| mechanism | A THRESHOLD PAPER THAT REFUSES TO SET THE THRESHOLD, AND SAYS WHY: `A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later.` Three things at once - the friction is social, the value is purpose-dependent, and the advice is about WHEN to apply a criterion rather than where to put it — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction.” | mechanisms[0] |
| mechanism | AND THE CONVENTION AND THE MEASUREMENT DISAGREE, IN ANGSTROMS: `there is NO GAIN in including data beyond about 1.95 A resolution, at which point CC1/2 IS 0.27 and <I/sigma> IS 0.9: A more conventional cutoff point at <I/sigma> = 2.0 WOULD BE AT 2.06 A RESOLUTION.` The traditional criterion throws away a shell of data the tests say is still useful - and the gap is 0.11 A on one data set — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | mechanisms[1] |
| mechanism | AND THE THRESHOLD IS NOT A SCALAR: the same data set gives `the resolutions at which <I/sigma> = 2.0 along d1, d2 and d3 being 2.23, 1.98 AND 2.05 A` - three answers depending on direction. And the paper declines to choose: `it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation` — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation.” | mechanisms[2] |
| mechanism | AND THE EMPIRICAL RANGE IS GIVEN AND THEN REFUSED AS A RULE: `by the time CC1/2 has fallen to around 0.2-0.4, or <I/sigma> TO AROUND 0.5-1.5, there is little information remaining, but that it would be hard to make A DEFINITE RULE. ... the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.` A range published as a range, with the reason it cannot become a number — “Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule. With increasing resolution the R factors and D values for experimental data converge towards the values from simulated data, but the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.” | mechanisms[3] |
| mechanism | AND A QUALITY STATISTIC THAT GETS WORSE AS THE DATA GETS BETTER: `The multiplicity-weighted R_meas is an improvement over R_merge, as it is RELATIVELY INSENSITIVE TO DATA MULTIPLICITY, WHEREAS R_MERGE tends to increase with increasing multiplicity, even though the averaged intensities are improving.` The measure and the thing measured move in opposite directions, and the field used the bad one for decades — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | mechanisms[4] |
| mechanism | AND THE CONSISTENCY MEASURE CANNOT SEE THE ERROR THAT MATTERS MOST: `Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error.` Agreement between replicates is evidence of precision and silent about accuracy - the measurement's blind spot is exactly the error class it is used to rule out — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error.” | mechanisms[5] |
| mechanism | AND THE ERROR BARS ARE WRONG EVERYWHERE, BY DEFAULT: `Initial estimates of the standard error of each intensity observation are generally underestimated by all integration programs, so AIMLESS ... UPDATES THE sigma(I) ESTIMATES in an attempt to make the average standard error match the average scatter.` Every program in the field ships an underestimate, and the fix is a fitted correction — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity.” | mechanisms[6] |
| mechanism | AND ONE OF THE CORRECTION TERMS HAS NO MEANING: `SdB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance against intensity and may be justified as an empirical `CORRECTION` FACTOR. It should be noted that this `correction` to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors.` A parameter kept because it works, labelled as such, with the assumption it rests on printed beside it — “Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity.” | mechanisms[7] |
| mechanism | AND THE PREFERRED STATISTIC WAS BORROWED FROM ANOTHER FIELD THIRTY YEARS EARLIER: `A better measure for assessing the `resolution` of a data set is the correlation coefficient between random half data sets, CC1/2 ... A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s.` The advantage given is definitional: `a correlation coefficient ... has a well defined range` — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | mechanisms[8] |
| extends | Karplus & Diederichs (2012), who proposed CC1/2 as a resolution criterion - and, further back, Fourier shell correlation, used for electron-microscopy resolution since the early 1980s — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | claim_relations[0] |
| critiques | the conventional <I/sigma> = 2.0 resolution cutoff, which on the worked example sits at 2.06 A where the tests put the information limit at 1.95 A — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | claim_relations[1] |
| sense | `resolution` (of a data set) - `a difficult and possibly contentious question (particularly with referees of papers)`, with no definite rule because it `depends on what the data are to be used for` — “The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm.” | senses[0] |
| sense | `CC1/2` - the correlation coefficient between two random half data sets; preferred because a correlation coefficient `has a well defined range`, and a descendant of Fourier shell correlation from 1980s electron microscopy — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | senses[1] |
| sense | `R_merge` vs `R_meas` vs `R_p.i.m.` - three R factors for one property, the first of which RISES as the data improves — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | senses[2] |
| sense | `internal consistency` - agreement among symmetry-related observations, which `LIKELY UNDERESTIMATES THE TRUE ERROR` because those observations share their systematic errors — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error.” | senses[3] |
| sense | AIMLESS scaling - a faster replacement for SCALA that preserves a similar scale model while making new models and analyses easier to add — “The program AIMLESS performs essentially the same task as SCALA and gives similar results. However, it is significantly faster (about three times) and is a better framework for adding new scaling models and analyses. In due course, the three programs POINTLESS , AIMLESS and CTRUNCATE may be combined into one. The extensive statistics produced by AIMLESS are mostly similar to those produced by SCALA , so the questions and decisions for the user are as discussed in Evans (2011 ▶ ): (i) What is the point group (Laue group)? (ii) What is the space group? (iii) Is there radiation damage and should the most damaged regions of data be excluded? (iv) What resolution cutoff should be applied (see below)? (v) Is there a detectable anomalous signal? (vi) Are the data twinned? (vii) Is this data set better than those previously collected” | senses[4] |
| sense | Resolution as usable information - a use-dependent truncation decision rather than a fixed property determined by one universal threshold — “In order to estimate the useful ‘resolution’ of the data, i.e. the resolution at which the data may be truncated without losing significant information, AIMLESS plots various measures of signal to noise and internal consistency against resolution. There is at present no general consensus on the optimum criteria for interpretation of these plots and how to estimate the point at which adding additional high-resolution data is not adding anything useful: the true ‘resolution’ of a data set has often been a point of contention with referees of papers” | senses[5] |
| sense | Signal-to-noise cutoff - average merged intensity divided by estimated error, conventionally cut around one to two but sensitive to error calibration — “One obvious way to judge data significance is from the average signal-to-noise ratio of the merged intensities as a function of resolution. This is calculated as [after ‘correcting’ the σ′( I h l ) estimates; § 2.1], i.e. for each reflection h the average intensity over symmetry mates 〈 I h 〉 is divided by its estimated error σ(〈 I h 〉) and this ratio is averaged in resolution bins [reported as Mn(I/sd) in the program output]. Commonly used resolution-cutoff levels are typically in the range 1–2: even in a resolution bin with 〈 I /σ〉 = 1 a proportion of intensities are significantly above the noise level [∼5–7% I > 3σ, ∼20–25% negative]. 〈 I /σ〉 is a good criterion for resolution cutoff, but it does suffer from uncertainties in the estimation of σ( I ), both from inadequacies in the integration program and the necessary σ( I ) ‘correction’ (see § 2.1; Ian Tickle, in a private communication, has pointed out that the major correction applies to large intensities and therefore would not affect the weak high-resolution data relevant to determination of resolution cutoff). It should be noted that 〈 I /σ〉 is not independent of measures of internal consistency because the corrections to σ′( I ) are adjusted to match the scatter of observations. Thus, σ′( I ) estimates are still likely to be underestimates of the true standard deviations” | senses[6] |
| sense | R-factor mismatch - merging R factors diverge as observations weaken whereas refinement R factors tend toward a constant — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | senses[7] |
| sense | Directional resolution - anisotropy makes one global cutoff inadequate and directional cutoffs potentially artefactual — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem, with the goal of developing clear protocols” | senses[8] |
| sense | Weak-data recommendation - retain data somewhat beyond traditional limits because trials show small possible gains and little observed harm — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | senses[9] |
| sense | Nominal resolution boundary - the number of included reflections is not a global certificate of model quality or local structural correctness — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | senses[10] |
| control | refining against SIMULATED data generated from the observed intensity distribution but NOT from the structure itself, at the same resolutions as the measured data — held — “Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule. With increasing resolution the R factors and D values for experimental data converge towards the values from simulated data, but the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.” — rules out mistaking model bias or noise-fitting for real information in the weak high-resolution shells - the point where measured and simulated converge is the information limit — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | controls[0] |
| control | omitting part of the model, perturbing the remaining coordinates by up to 0.3 A, and comparing difference maps at different cutoffs — partial — “The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm.” — rules out model bias in the visual assessment of whether extra resolution helps — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models.” | controls[1] |
| control | updating the sigma(I) estimates until the normalised deviations have variance 1.0 across all intensity ranges — partial — “Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity.” — rules out error bars that every integration program underestimates by default — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity.” | controls[2] |
| weight | Karplus & Diederichs (2012), who proposed CC1/2 as a resolution criterion - and, further back, Fourier shell correlation, used for electron-microscopy resolution since the early 1980s — 0.9 — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | claim_relations[0] |
| weight | the conventional <I/sigma> = 2.0 resolution cutoff, which on the worked example sits at 2.06 A where the tests put the information limit at 1.95 A — 0.9 — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | claim_relations[1] |
| note | R meas —distinct-from→ R merge — 'The multiplicity-weighted R_MEAS is an improvement over R_MERGE, AS IT IS RELATIVELY INSENSITIVE TO DATA MULTIPLICITY, WHEREAS R_MERGE tends to increase with increasing multiplicity, even though the averaged intensities are improving.' Two names for one property, and only one of them tracks it — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concept_edges[0] |
| relation | R meas —distinct-from→ R merge — R_meas is insensitive to multiplicity and R_merge is not - which is why the older statistic degrades as the data improves — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” — “The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity” | concept_edges[0] |
| weight | R meas —distinct-from→ R merge — 0.95 — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concept_edges[0] |
| effect direction | multiplicity —causes→ R merge — increases — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” — “R merge tends to increase with increasing multiplicity” | concept_edges[1] |
| note | multiplicity —causes→ R merge — 'R_MERGE tends to increase with increasing multiplicity, even though the averaged intensities are improving.' The clearest case in this corpus of a quality statistic that moves opposite to quality - and the field reported it for decades before R_meas. The 'even though' is the paper doing the work a cue list cannot: it marks the causal claim AND its perversity in three words — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concept_edges[1] |
| relation | multiplicity —causes→ R merge — increasing multiplicity INCREASES R_merge, while simultaneously improving the averaged intensities it is supposed to report on — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” — “whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving” | concept_edges[1] |
| weight | multiplicity —causes→ R merge — 0.95 — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concept_edges[1] |
| note | AIMLESS —is-a→ classic scaling method — The paper directly states that AIMLESS is a new implementation of a classic scaling method. — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model” | concept_edges[2] |
| note | point group —part-of→ data reduction — Determination of the point group is explicitly included among data-reduction processes. — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity” | concept_edges[3] |
| note | space group —part-of→ data reduction — Determination of the possible space group is explicitly included among data-reduction processes. — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity” | concept_edges[4] |
| note | internal consistency —operationalised-as→ R factors — The paper explicitly says internal consistency has traditionally been measured by R factors. — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h” | concept_edges[5] |
| note | R factors —contrasted-with→ correlation coefficients — The paper contrasts distribution-dependent R factors with less distribution-dependent correlations, while hedging that correlations may be better. — “In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concept_edges[6] |
| weight | R factors —contrasted-with→ correlation coefficients — 0.9 — “In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concept_edges[6] |
| audit | Anisotropic cutoffs —causes→ artefacts in map calculation — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but anisotropic cutoffs 'are likely to cause' artefacts; hedged. — “Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem” | concept_edges[7] |
| effect direction | Anisotropic cutoffs —causes→ artefacts in map calculation — increases — “Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem” | concept_edges[7] |
| evidential status (stated by the tagger, no quotation) | Anisotropic cutoffs —causes→ artefacts in map calculation — methodological risk stated as likely, with the issue left open | concept_edges[7] |
| note | Anisotropic cutoffs —causes→ artefacts in map calculation — The weight reflects the paper's 'likely to cause' hedge. — “Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem” | concept_edges[7] |
| weight | Anisotropic cutoffs —causes→ artefacts in map calculation — 0.7 — “Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem” | concept_edges[7] |
| evidential status (stated by the tagger, no quotation) | distribution of the data —causes→ R factors — mathematical dependence of a statistic on its data distribution | concept_edges[8] |
| note | distribution of the data —causes→ R factors — The paper states that R factors are dependent on the distribution of the data. — “In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concept_edges[8] |
| effect direction | data quality —causes→ model quality — increases — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good” | concept_edges[9] |
| evidential status (stated by the tagger, no quotation) | data quality —causes→ model quality — general dependency claim, not an isolated intervention | concept_edges[9] |
| note | data quality —causes→ model quality — The authors state that model quality depends on data quality. — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good” | concept_edges[9] |
| weight | data quality —causes→ model quality — 0.85 — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good” | concept_edges[9] |
| effect direction | merging many data sets —causes→ signal-to-noise ratio — increases — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good” | concept_edges[10] |
| evidential status (stated by the tagger, no quotation) | merging many data sets —causes→ signal-to-noise ratio — general empirical-methodological claim qualified by 'usually' | concept_edges[10] |
| note | merging many data sets —causes→ signal-to-noise ratio — The paper says merging many data sets usually improves signal-to-noise. — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good” | concept_edges[10] |
| weight | merging many data sets —causes→ signal-to-noise ratio — 0.9 — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good” | concept_edges[10] |
| audit | weak data —causes→ structure determination — Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but extending the data 'may improve' structure determination; hedged. — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concept_edges[11] |
| effect direction | weak data —causes→ structure determination — increases — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” — “extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building” | concept_edges[11] |
| evidential status (stated by the tagger, no quotation) | weak data —causes→ structure determination — limited refinement and model-building tests; the paper says 'may improve' and 'seems' harmless | concept_edges[11] |
| note | weak data —causes→ structure determination — A deliberately low weight preserves the paper's hedging and limited-test basis. — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concept_edges[11] |
| weight | weak data —causes→ structure determination — 0.6 — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concept_edges[11] |
| note | nominal resolution —contrasted-with→ model quality — The paper explicitly rejects nominal resolution as a good indicator of model quality. — “The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness” | concept_edges[12] |
| outcome | control — held — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” — “Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule. With increasing resolution the R factors and D values for experimental data converge towards the values from simulated data, but the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.” | controls[0] |
| outcome | control — partial — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models.” — “The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm.” | controls[1] |
| outcome | control — partial — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity.” — “Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity.” | controls[2] |
| weight | relative B factors → radiation-damage correction — 0.9 — “The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights” | unhoused_relations[1] |
| weight | very weak anomalous signal from sulfur → merging data from many crystals — 0.9 — “merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving” | unhoused_relations[10] |
| no type for this | AIMLESS → SCALA — AIMLESS replaces the earlier SCALA program; replaces is absent from the eight governed types, and the relation clause lacks a differentiation cue for contrasted-with. — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model” | unhoused_relations[0] |
| no type for this | relative B factors → radiation-damage correction — The relative B-factor term is described as largely an average radiation-damage correction; the intervening hedge prevents the gate's strict is-a cue, so the relation is filed rather than forced. — “The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights” | unhoused_relations[1] |
| no type for this | maximum resolution → I /σ — Per-batch maximum resolution is estimated from where I/sigma falls below 1.0; estimated-from is absent from the eight governed types and is not forced through the operationalisation cue gate. — “The ‘maximum resolution’ is estimated from the point at which 〈 I /σ( I )〉 falls below 1.0 for each batch: note that this 〈 I /σ( I )〉 is without averaging multiple measurements (which would not generally occur on the same image)” | unhoused_relations[2] |
| no type for this | CC 1/2 → correlation coefficient — CC 1/2 is described as the correlation coefficient between random half data sets; the definite-article class statement is not admitted by the strict is-a cue, so it is filed rather than weakened. — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS” | unhoused_relations[3] |
| no type for this | POINTLESS → point group — POINTLESS determines the likely point group; determines is absent from the eight governed types. — “POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary” | unhoused_relations[4] |
| no type for this | CTRUNCATE → structure amplitudes | F | — CTRUNCATE calculates structure amplitudes from intensities; calculates/derives is absent from the eight governed types. — “CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | unhoused_relations[5] |
| no type for this | image number → radiation dose — Image or batch number is a proxy for radiation dose; proxy-for is absent and is not a measurement definition strong enough for operationalised-as. — “Analysis of various parameters as a function of batch or image number, a proxy for crystal rotation, time or radiation dose, is useful to determine whether the crystal has suffered unduly from radiation damage or whether there are any other parts of the data which should be discarded” | unhoused_relations[6] |
| no type for this | anisotropy → CC 1/2 — AIMLESS analyses anisotropy using CC 1/2; analysed-using is absent from the eight governed types. — “The anisotropy of the data is analysed in AIMLESS using both CC 1/2 and 〈 I /σ〉. The two or three orthogonal principal directions of anisotropy are constrained by the lattice symmetry: no anisotropy for cubic symmetry, two principal directions, the unique c ( c *) axis and the ab plane, for tetragonal, hexagonal and trigonal, three orthogonal axes for orthorhombic” | unhoused_relations[7] |
| no type for this | Fourier shell correlation → CC 1/2 — Fourier shell correlation is presented as a related statistic to CC 1/2; related-to is absent from the eight governed types. — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range” | unhoused_relations[8] |
| no type for this | resolution cutoff → what the data are to be used for — The appropriate resolution cutoff depends on what the data will be used for; use-dependent-choice is absent from the eight governed types. — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | unhoused_relations[9] |
| no type for this | very weak anomalous signal from sulfur → merging data from many crystals — Merging many crystals is used to enhance the weak sulfur anomalous signal; enhances is absent and the paper does not support a clean intervention-level causes edge here. — “merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving” | unhoused_relations[10] |
| no type for this | nominal resolution → local structural feature — No global score, including nominal resolution, can certify the correctness of a local structural feature; indicator-of/certifies is absent from the eight governed types. — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | unhoused_relations[11] |
| limitation | THE MODEL-BUILDING TEST COULD NOT SEPARATE ANYTHING: `There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions ... there was no consistent pattern over the different resolutions.` A negative result reported as a negative result, on the question the whole paper is about — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models.” | limitations[0] |
| limitation | AND MERGING MORE DATA CAN MAKE IT WORSE: `merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage.` More observations is not always more information, and the paper says where the boundary is unknown rather than guessing at it — “At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage.” | limitations[1] |
| limitation | and the relationship the cutoff is supposed to serve is itself unclear: `using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear).` The parenthesis undercuts the sentence it is inside, and the authors leave it there — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation.” | limitations[2] |
finding · quantity · variable · definition · key-term — grounded in the full text| finding | — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction.” | content_tags.findings[0] |
| finding | — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | content_tags.findings[1] |
| finding | — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | content_tags.findings[2] |
| finding | — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | content_tags.findings[3] |
| finding | — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error.” | content_tags.findings[4] |
| finding | — “Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity.” | content_tags.findings[5] |
| quantity | 1.95 A (CC1/2 = 0.27, <I/sigma> = 0.9) against 2.06 A at <I/sigma> = 2.0 — — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | content_tags.quantities[0] |
| quantity | 2.23, 1.98 and 2.05 A along d1, d2, d3 at <I/sigma> = 2.0 — — “We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06 Å resolution. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutions at which 〈 I /σ〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05” | content_tags.quantities[1] |
| quantity | CC1/2 around 0.2-0.4, or <I/sigma> around 0.5-1.5 — — “Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule. With increasing resolution the R factors and D values for experimental data converge towards the values from simulated data, but the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.” | content_tags.quantities[2] |
| variable | standard error — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity.” | content_tags.variables[0] |
| definition | CC 1/2 — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | content_tags.definitions[0] |
| definition | resolution — “The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm.” | content_tags.definitions[1] |
| concept | R meas — not defined in this paper's own words; the multiplicity-weighted R factor, insensitive to how many times each reflection was measured — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concepts[0] |
| concept | R merge — not defined in this paper's own words; the traditional R factor, which rises with multiplicity even as the averaged intensities improve — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concepts[1] |
| concept | multiplicity — not defined in this paper's own words; how many times each reflection was measured - more of it improves the data and worsens R merge — “Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below.” | concepts[2] |
| concept | resolution cutoff — not defined in this paper's own words; the decision this paper declines to turn into a rule — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction.” | concepts[3] |
| concept | CC 1/2 — not defined in this paper's own words; the correlation between random half data sets, offered as the better resolution criterion — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | concepts[4] |
| concept | data reduction — not defined in this paper's own words; operations converting integrated diffraction intensities into scaled, assessed data — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[5] |
| concept | data-scaling program — not defined in this paper's own words; program class that places measurements on a common scale before merging — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[6] |
| concept | classic scaling method — not defined in this paper's own words; scaling-method class implemented anew in AIMLESS — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[7] |
| concept | POINTLESS — not defined in this paper's own words; program for point-group and likely space-group determination — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[8] |
| concept | symmetry-related reflections — not defined in this paper's own words; reflections whose replicated measurements are averaged after scaling — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[9] |
| concept | data quality — not defined in this paper's own words; quality assessed through scaling and data-processing statistics — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[10] |
| concept | weak high-resolution data — not defined in this paper's own words; observations beyond conventional cutoffs tested for usefulness — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[11] |
| concept | AIMLESS — not defined in this paper's own words; new scaling program and analysis framework — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[12] |
| concept | SCALA — not defined in this paper's own words; earlier scaling program replaced by AIMLESS — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[13] |
| concept | resolution — not defined in this paper's own words; effective information limit of a measured diffraction data set — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[14] |
| concept | data-processing statistics — not defined in this paper's own words; scaling-stage quantities compared with downstream refinement and map tests — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[15] |
| concept | automated model-building — not defined in this paper's own words; downstream trial used to evaluate resolution limits — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[16] |
| concept | common scale — not defined in this paper's own words; shared intensity scale imposed across measurements — “The new scaling program AIMLESS is described and tests of refinements at different resolutions are compared with analyses from the scaling step. Following integration of the observed diffraction spots, the process of ‘data reduction’ initially aims to determine the point-group symmetry of the data and the likely space group. This can be performed with the program POINTLESS . The scaling program then puts all the measurements on a common scale, averages measurements of symmetry-related reflections (using the symmetry determined previously) and produces many statistics that provide the first important measures of data quality. A new scaling program, AIMLESS , implements scaling models similar to those in SCALA but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolution’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statistics with trials of refinement against observed and simulated data, and automated model-building and comparison of maps calculated with different resolution limits. These trials show that adding weak high-resolution data beyond the commonly used limits may make some improvement and does no harm” | concepts[17] |
| concept | X-ray diffraction images — not defined in this paper's own words; images from which spot intensities are integrated — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[18] |
| concept | reflection intensities — not defined in this paper's own words; integrated measurements entering data reduction — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[19] |
| concept | point group — not defined in this paper's own words; symmetry classification determined during reduction — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[20] |
| concept | space group — not defined in this paper's own words; likely crystallographic symmetry group determined during reduction — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[21] |
| concept | consistent indexing — not defined in this paper's own words; agreement of alternative indexing choices — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[22] |
| concept | structure amplitudes | F | — not defined in this paper's own words; amplitudes estimated from measured intensities — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[23] |
| concept | internal consistency — not defined in this paper's own words; agreement among symmetry-related or replicate intensity observations — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[24] |
| concept | experimental conditions — not defined in this paper's own words; varying collection conditions whose intensity effects scaling corrects — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[25] |
| concept | incident-beam intensity — not defined in this paper's own words; collection condition contributing to measured intensity variation — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[26] |
| concept | volume of the crystal illuminated — not defined in this paper's own words; collection-dependent source of intensity variation — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[27] |
| concept | absorption in the primary or secondary beam — not defined in this paper's own words; beam absorption contributing to measured-intensity variation — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[28] |
| concept | average radiation damage — not defined in this paper's own words; collection-time damage contribution addressed by scaling — “Following integration of the spots on a set of X-ray diffraction images to produce a list of reflection intensities, a series of operations are performed on the data, usually referred to as ‘data reduction’. These processes include determination of the point group and if possible the space group, checking for consistent indexing where there are alternatives, putting all of the data on a common scale, deciding whether to reject parts of the collected data or to cut the resolution and estimating the structure amplitude | F | from intensity. Statistics on the internal consistency of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reduction have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; Evans, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditions which vary during data collection, such as variations in the incident-beam intensity, the volume of the crystal illuminated, absorption in the primary or secondary beam and average radiation damage. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible. This paper describes a new data-scaling program, AIMLESS , and discusses criteria for deciding the ‘resolution’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESS is used immediately after the program POINTLESS , which determines the likely point group and possible space group, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (Evans, 2011 ▶ ). 1 AIMLESS is then followed by CTRUNCATE , which calculates the structure amplitudes | F | from the intensities and outputs various intensity statistics mainly to detect twinning” | concepts[29] |
| concept | scale factors — not defined in this paper's own words; parameters putting intensities onto a common scale — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[30] |
| concept | inverse scale — not defined in this paper's own words; observation-associated inverse scaling quantity — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[31] |
| concept | scale model — not defined in this paper's own words; parameterized source of inverse scale values — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[32] |
| concept | crystal rotation angle — not defined in this paper's own words; proxy coordinate used in the scale model — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[33] |
| concept | radiation dose — not defined in this paper's own words; dose or time coordinate represented by rotation angle — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[34] |
| concept | relative B factors — not defined in this paper's own words; average correction terms for radiation damage — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[35] |
| concept | radiation-damage correction — not defined in this paper's own words; correction represented by the relative B-factor term — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[36] |
| concept | Gaussian weights — not defined in this paper's own words; weights interpolating primary scale and B factors — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[37] |
| concept | secondary beam correction — not defined in this paper's own words; direction-dependent correction expanded in spherical harmonics — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[38] |
| concept | spherical harmonic terms — not defined in this paper's own words; basis terms for the secondary-beam correction — “AIMLESS is a new implementation in C++ of a classic scaling method, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALA (Evans, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale model. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scale, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scale g h l comes from the refined scale model and is a function of the crystal rotation angle ϕ as a proxy for primary beam direction s 1 and for radiation dose (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correction. The smoothed primary scale factors g primary (ϕ) and relative B factors B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weights. The secondary beam correction g secondary ( s 2 ) is determined as a sum of spherical harmonic terms” | concepts[39] |
| concept | Parameter restraint terms — not defined in this paper's own words; ties constraining scaling parameters — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[40] |
| concept | sphericity restraint — not defined in this paper's own words; restraint tying spherical-harmonic coefficients toward zero — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[41] |
| concept | standard error estimates — not defined in this paper's own words; per-observation uncertainties optimized during scaling — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[42] |
| concept | outlier rejection — not defined in this paper's own words; repeated removal of discrepant observations — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[43] |
| concept | strong reflections — not defined in this paper's own words; informative subset used to accelerate scaling — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[44] |
| concept | normalized intensities E 2 — not defined in this paper's own words; selection statistic distributing strong reflections across resolution — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[45] |
| concept | merged reflection lists — not defined in this paper's own words; averaged reflection output form — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[46] |
| concept | unmerged reflection lists — not defined in this paper's own words; observation-level reflection output form — “Parameter restraint terms (ties) include a sphericity restraint on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factors. AIMLESS iterates the scaling step with an optimization of the standard error estimates on each observation σ( I h l ) and outlier rejection. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflections. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALA does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALA was written). Sort symmetry-related observations and partial observations together if necessary. (ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values. (iii) Obtain initial rough scale estimates from average intensities. (iv) First-round scaling with a sample of a few thousand strong reflections with I /σ( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection. (v) First outlier rejection, using an algorithm similar to that described in §A5 of Evans (2006 ▶ ). (vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak data and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same. (vii) First optimization of σ( I ) estimates (see § 2.1). (viii) Main scaling with strong reflections chosen on normalized intensities E 2 (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolution ranges. (ix) Second outlier rejection as before. (x) Final optimization of σ( I ) estimates as before. (xi) Final outlier rejection as before. (xii) Accumulate and print statistics. (xiii) Output merged or unmerged reflection lists to files” | concepts[47] |
| concept | detector gain — not defined in this paper's own words; detector units per photon affecting initial error estimates — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[48] |
| concept | Poisson-statistic error estimates — not defined in this paper's own words; counting-error estimates scaled by detector gain — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[49] |
| concept | instrumental instabilities — not defined in this paper's own words; sources of error that grow with intensity — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[50] |
| concept | normalized deviations — not defined in this paper's own words; standardized observation discrepancies used to assess error calibration — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[51] |
| concept | SdFac — not defined in this paper's own words; empirical standard-error correction factor — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[52] |
| concept | SdB — not defined in this paper's own words; empirical correction factor with no obvious physical interpretation — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[53] |
| concept | SdAdd — not defined in this paper's own words; correction factor associated with intensity-proportional instability — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[54] |
| concept | intensity bin — not defined in this paper's own words; range over which normalized-deviation variance is optimized — “Initial estimates of the standard error of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESS , like SCALA , updates the σ( I ) estimates in an attempt to make the average standard error match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimates (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilities which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviations (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimate is then adjusted to optimizing the values of the ‘correction’ factors SdFac, SdB and SdAdd to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity bin and loose restraints on SdB parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfac can be identified primarily with the uncertainty in the detector gain and Sdadd with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damage, for example) and that the correction can be parameterized purely on intensity” | concepts[55] |
| concept | signal-to-noise ratio — not defined in this paper's own words; intensity significance quantity analysed by resolution and image — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[56] |
| concept | I /σ — not defined in this paper's own words; intensity-to-estimated-error ratio used as a signal-to-noise statistic — “Analysis of various parameters as a function of batch or image number, a proxy for crystal rotation, time or radiation dose, is useful to determine whether the crystal has suffered unduly from radiation damage or whether there are any other parts of the data which should be discarded. AIMLESS plots similar graphs of R merge and of scale and relative B factors to those produced by SCALA (see, for example, Fig. 2 of Evans, 2011 ▶ ). Increasing negative values of the relative B factor are an indicator of deterioration with dose, although the B factor is also affected by factors other than radiation damage. AIMLESS adds two new plots against batch number: a rough estimate of the maximum resolution for each image and a cumulative completeness (for all data and anomalous pairs; see Fig. 1 ▶ ). The ‘maximum resolution’ is estimated from the point at which 〈 I /σ( I )〉 falls below 1.0 for each batch: note that this 〈 I /σ( I )〉 is without averaging multiple measurements (which would not generally occur on the same image), so will be smaller than the 〈 I /σ〉 after averaging (§ 3.2.1). The plot shows the noisy values for each batch, as well as a smoothed plot typically averaged over a 5° range. This is only a rough estimate of resolution (see § 4), but serves to illustrate any trends. The cumulative completeness plot helps in deciding whether cutting back data from the end because of radiation damage would compromise the completeness. Such decisions are more complicated if the data have been measured from multiple ‘sweeps’ or multiple crystals” | concepts[57] |
| concept | image number — not defined in this paper's own words; proxy for collection time, rotation, or dose — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[58] |
| concept | radiation damage — not defined in this paper's own words; dose-related deterioration detected across image number — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[59] |
| concept | weak or inconsistent regions of data — not defined in this paper's own words; regions detected by image-number analysis — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[60] |
| concept | internal consistency measures — not defined in this paper's own words; agreement scores that can underestimate true error — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[61] |
| concept | R p.i.m. — not defined in this paper's own words; estimate of data quality after merging observations — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[62] |
| concept | linear correlation coefficient — not defined in this paper's own words; half-set consistency measure preferred to merging R factors — “Once we have a set of scale factors to put all the intensities on a common scale and improved estimates of the error on each intensity, then we can analyse the data for internal consistency and for signal-to-noise ratio. We can do this as a function of image number (equivalent to time or crystal rotation) to detect radiation damage and weak or inconsistent regions of data and against resolution to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measures are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error. Internal consistency has traditionally been measured by R factors relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R meas is an improvement over R merge , as it is relatively insensitive to data multiplicity (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R merge tends to increase with increasing multiplicity, even though the averaged intensities are improving. R p.i.m. provides an estimate of data quality after merging multiple observations. An alternative way of measuring internal consistency for the analysis against resolution is to split the observations randomly into halves and then calculate the linear correlation coefficient between the halves. This is arguably the most reliable measure and is discussed further below” | concepts[63] |
| concept | batch number — not defined in this paper's own words; image-linked coordinate for detecting deterioration and discardable regions — “Analysis of various parameters as a function of batch or image number, a proxy for crystal rotation, time or radiation dose, is useful to determine whether the crystal has suffered unduly from radiation damage or whether there are any other parts of the data which should be discarded. AIMLESS plots similar graphs of R merge and of scale and relative B factors to those produced by SCALA (see, for example, Fig. 2 of Evans, 2011 ▶ ). Increasing negative values of the relative B factor are an indicator of deterioration with dose, although the B factor is also affected by factors other than radiation damage. AIMLESS adds two new plots against batch number: a rough estimate of the maximum resolution for each image and a cumulative completeness (for all data and anomalous pairs; see Fig. 1 ▶ ). The ‘maximum resolution’ is estimated from the point at which 〈 I /σ( I )〉 falls below 1.0 for each batch: note that this 〈 I /σ( I )〉 is without averaging multiple measurements (which would not generally occur on the same image), so will be smaller than the 〈 I /σ〉 after averaging (§ 3.2.1). The plot shows the noisy values for each batch, as well as a smoothed plot typically averaged over a 5° range. This is only a rough estimate of resolution (see § 4), but serves to illustrate any trends. The cumulative completeness plot helps in deciding whether cutting back data from the end because of radiation damage would compromise the completeness. Such decisions are more complicated if the data have been measured from multiple ‘sweeps’ or multiple crystals” | concepts[64] |
| concept | maximum resolution — not defined in this paper's own words; per-image rough limit estimated from unmerged signal-to-noise — “Analysis of various parameters as a function of batch or image number, a proxy for crystal rotation, time or radiation dose, is useful to determine whether the crystal has suffered unduly from radiation damage or whether there are any other parts of the data which should be discarded. AIMLESS plots similar graphs of R merge and of scale and relative B factors to those produced by SCALA (see, for example, Fig. 2 of Evans, 2011 ▶ ). Increasing negative values of the relative B factor are an indicator of deterioration with dose, although the B factor is also affected by factors other than radiation damage. AIMLESS adds two new plots against batch number: a rough estimate of the maximum resolution for each image and a cumulative completeness (for all data and anomalous pairs; see Fig. 1 ▶ ). The ‘maximum resolution’ is estimated from the point at which 〈 I /σ( I )〉 falls below 1.0 for each batch: note that this 〈 I /σ( I )〉 is without averaging multiple measurements (which would not generally occur on the same image), so will be smaller than the 〈 I /σ〉 after averaging (§ 3.2.1). The plot shows the noisy values for each batch, as well as a smoothed plot typically averaged over a 5° range. This is only a rough estimate of resolution (see § 4), but serves to illustrate any trends. The cumulative completeness plot helps in deciding whether cutting back data from the end because of radiation damage would compromise the completeness. Such decisions are more complicated if the data have been measured from multiple ‘sweeps’ or multiple crystals” | concepts[65] |
| concept | cumulative completeness — not defined in this paper's own words; plot used to judge the completeness cost of discarding damaged data — “Analysis of various parameters as a function of batch or image number, a proxy for crystal rotation, time or radiation dose, is useful to determine whether the crystal has suffered unduly from radiation damage or whether there are any other parts of the data which should be discarded. AIMLESS plots similar graphs of R merge and of scale and relative B factors to those produced by SCALA (see, for example, Fig. 2 of Evans, 2011 ▶ ). Increasing negative values of the relative B factor are an indicator of deterioration with dose, although the B factor is also affected by factors other than radiation damage. AIMLESS adds two new plots against batch number: a rough estimate of the maximum resolution for each image and a cumulative completeness (for all data and anomalous pairs; see Fig. 1 ▶ ). The ‘maximum resolution’ is estimated from the point at which 〈 I /σ( I )〉 falls below 1.0 for each batch: note that this 〈 I /σ( I )〉 is without averaging multiple measurements (which would not generally occur on the same image), so will be smaller than the 〈 I /σ〉 after averaging (§ 3.2.1). The plot shows the noisy values for each batch, as well as a smoothed plot typically averaged over a 5° range. This is only a rough estimate of resolution (see § 4), but serves to illustrate any trends. The cumulative completeness plot helps in deciding whether cutting back data from the end because of radiation damage would compromise the completeness. Such decisions are more complicated if the data have been measured from multiple ‘sweeps’ or multiple crystals” | concepts[66] |
| concept | resolution bins — not defined in this paper's own words; groups over which intensity signal-to-noise is averaged — “One obvious way to judge data significance is from the average signal-to-noise ratio of the merged intensities as a function of resolution. This is calculated as [after ‘correcting’ the σ′( I h l ) estimates; § 2.1], i.e. for each reflection h the average intensity over symmetry mates 〈 I h 〉 is divided by its estimated error σ(〈 I h 〉) and this ratio is averaged in resolution bins [reported as Mn(I/sd) in the program output]. Commonly used resolution-cutoff levels are typically in the range 1–2: even in a resolution bin with 〈 I /σ〉 = 1 a proportion of intensities are significantly above the noise level [∼5–7% I > 3σ, ∼20–25% negative]. 〈 I /σ〉 is a good criterion for resolution cutoff, but it does suffer from uncertainties in the estimation of σ( I ), both from inadequacies in the integration program and the necessary σ( I ) ‘correction’ (see § 2.1; Ian Tickle, in a private communication, has pointed out that the major correction applies to large intensities and therefore would not affect the weak high-resolution data relevant to determination of resolution cutoff). It should be noted that 〈 I /σ〉 is not independent of measures of internal consistency because the corrections to σ′( I ) are adjusted to match the scatter of observations. Thus, σ′( I ) estimates are still likely to be underestimates of the true standard deviations” | concepts[67] |
| concept | noise level — not defined in this paper's own words; background relative to which intensity significance is judged — “One obvious way to judge data significance is from the average signal-to-noise ratio of the merged intensities as a function of resolution. This is calculated as [after ‘correcting’ the σ′( I h l ) estimates; § 2.1], i.e. for each reflection h the average intensity over symmetry mates 〈 I h 〉 is divided by its estimated error σ(〈 I h 〉) and this ratio is averaged in resolution bins [reported as Mn(I/sd) in the program output]. Commonly used resolution-cutoff levels are typically in the range 1–2: even in a resolution bin with 〈 I /σ〉 = 1 a proportion of intensities are significantly above the noise level [∼5–7% I > 3σ, ∼20–25% negative]. 〈 I /σ〉 is a good criterion for resolution cutoff, but it does suffer from uncertainties in the estimation of σ( I ), both from inadequacies in the integration program and the necessary σ( I ) ‘correction’ (see § 2.1; Ian Tickle, in a private communication, has pointed out that the major correction applies to large intensities and therefore would not affect the weak high-resolution data relevant to determination of resolution cutoff). It should be noted that 〈 I /σ〉 is not independent of measures of internal consistency because the corrections to σ′( I ) are adjusted to match the scatter of observations. Thus, σ′( I ) estimates are still likely to be underestimates of the true standard deviations” | concepts[68] |
| concept | resolution-cutoff levels — not defined in this paper's own words; commonly used average-signal thresholds — “One obvious way to judge data significance is from the average signal-to-noise ratio of the merged intensities as a function of resolution. This is calculated as [after ‘correcting’ the σ′( I h l ) estimates; § 2.1], i.e. for each reflection h the average intensity over symmetry mates 〈 I h 〉 is divided by its estimated error σ(〈 I h 〉) and this ratio is averaged in resolution bins [reported as Mn(I/sd) in the program output]. Commonly used resolution-cutoff levels are typically in the range 1–2: even in a resolution bin with 〈 I /σ〉 = 1 a proportion of intensities are significantly above the noise level [∼5–7% I > 3σ, ∼20–25% negative]. 〈 I /σ〉 is a good criterion for resolution cutoff, but it does suffer from uncertainties in the estimation of σ( I ), both from inadequacies in the integration program and the necessary σ( I ) ‘correction’ (see § 2.1; Ian Tickle, in a private communication, has pointed out that the major correction applies to large intensities and therefore would not affect the weak high-resolution data relevant to determination of resolution cutoff). It should be noted that 〈 I /σ〉 is not independent of measures of internal consistency because the corrections to σ′( I ) are adjusted to match the scatter of observations. Thus, σ′( I ) estimates are still likely to be underestimates of the true standard deviations” | concepts[69] |
| concept | R factors — not defined in this paper's own words; residual statistics used for internal consistency and refinement — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concepts[70] |
| concept | R cryst — not defined in this paper's own words; refinement R factor tending to a constant for weak data — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concepts[71] |
| concept | R work — not defined in this paper's own words; working-set form of the refinement R factor — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concepts[72] |
| concept | R free — not defined in this paper's own words; held-out refinement R factor used in cutoff trials — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concepts[73] |
| concept | correlation coefficients — not defined in this paper's own words; bounded indicators of linear dependence between data sets — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concepts[74] |
| concept | correlation coefficient — not defined in this paper's own words; bounded statistic relating two random half data sets — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | concepts[75] |
| concept | distribution of the data — not defined in this paper's own words; data distribution on which R-factor behavior depends — “The traditional R factors measuring internal consistency, R merge or better R meas (§ 3), are not suitable measures for setting a resolution cutoff (Evans, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factors cannot be compared with the R factors in refinement, since R merge and R meas both tend to infinity as the data become weaker, while R cryst (either R work or R free ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factor on intensity, which can be measured as zero or negative, and an R factor on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R merge or R meas are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity bin or low-resolution bin) is a good indicator of overall data quality. A large R factor for the strong data may indicate a problem [a serious cause for concern if R merge (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak data. In general, since R factors are dependent on the distribution of the data (see, for example, Murshudov, 2011 ▶ ) they are not good indicators of model quality or internal consistency, whereas the correlation coefficients are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the data, so they may be better indicators” | concepts[76] |
| concept | Fourier shell correlation — not defined in this paper's own words; electron-microscopy analogue of half-set correlation — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | concepts[77] |
| concept | anisotropy — not defined in this paper's own words; directional variation in diffraction-data quality and resolution — “Most data sets are anisotropic to some extent, which complicates analysis and decision making. The anisotropy of the data is analysed in AIMLESS using both CC 1/2 and 〈 I /σ〉. The two or three orthogonal principal directions of anisotropy are constrained by the lattice symmetry: no anisotropy for cubic symmetry, two principal directions, the unique c ( c *) axis and the ab plane, for tetragonal, hexagonal and trigonal, three orthogonal axes for orthorhombic, the unique b ( b *) axis and two orthogonal axes in the ac plane for monoclinic and three general orthogonal axes for the triclinic system. The general directions for triclinic and in the monoclinic ac plane are determined from the eigenvectors of a fitted anisotropic scale factor. Anisotropy is then analysed in cones around the principal axes (default semi-angle 20°) and within the same angle of a principal plane, or alternatively as projections onto the two or three principal directions. In the former case, observations are weighted with a cosine weight declining from 1 along the principal direction to 0 at the edge of the region. Plots of CC 1/2 and 〈 I /σ〉 then allow assessment of resolution in different directions in the same way as for the overall resolution and with the same difficulties” | concepts[78] |
| concept | principal directions of anisotropy — not defined in this paper's own words; symmetry-constrained axes for directional analysis — “Most data sets are anisotropic to some extent, which complicates analysis and decision making. The anisotropy of the data is analysed in AIMLESS using both CC 1/2 and 〈 I /σ〉. The two or three orthogonal principal directions of anisotropy are constrained by the lattice symmetry: no anisotropy for cubic symmetry, two principal directions, the unique c ( c *) axis and the ab plane, for tetragonal, hexagonal and trigonal, three orthogonal axes for orthorhombic, the unique b ( b *) axis and two orthogonal axes in the ac plane for monoclinic and three general orthogonal axes for the triclinic system. The general directions for triclinic and in the monoclinic ac plane are determined from the eigenvectors of a fitted anisotropic scale factor. Anisotropy is then analysed in cones around the principal axes (default semi-angle 20°) and within the same angle of a principal plane, or alternatively as projections onto the two or three principal directions. In the former case, observations are weighted with a cosine weight declining from 1 along the principal direction to 0 at the edge of the region. Plots of CC 1/2 and 〈 I /σ〉 then allow assessment of resolution in different directions in the same way as for the overall resolution and with the same difficulties” | concepts[79] |
| concept | fitted anisotropic scale factor — not defined in this paper's own words; fit whose eigenvectors determine general anisotropy directions — “Most data sets are anisotropic to some extent, which complicates analysis and decision making. The anisotropy of the data is analysed in AIMLESS using both CC 1/2 and 〈 I /σ〉. The two or three orthogonal principal directions of anisotropy are constrained by the lattice symmetry: no anisotropy for cubic symmetry, two principal directions, the unique c ( c *) axis and the ab plane, for tetragonal, hexagonal and trigonal, three orthogonal axes for orthorhombic, the unique b ( b *) axis and two orthogonal axes in the ac plane for monoclinic and three general orthogonal axes for the triclinic system. The general directions for triclinic and in the monoclinic ac plane are determined from the eigenvectors of a fitted anisotropic scale factor. Anisotropy is then analysed in cones around the principal axes (default semi-angle 20°) and within the same angle of a principal plane, or alternatively as projections onto the two or three principal directions. In the former case, observations are weighted with a cosine weight declining from 1 along the principal direction to 0 at the edge of the region. Plots of CC 1/2 and 〈 I /σ〉 then allow assessment of resolution in different directions in the same way as for the overall resolution and with the same difficulties” | concepts[80] |
| concept | cones around the principal axes — not defined in this paper's own words; directional regions used for anisotropy analysis — “Most data sets are anisotropic to some extent, which complicates analysis and decision making. The anisotropy of the data is analysed in AIMLESS using both CC 1/2 and 〈 I /σ〉. The two or three orthogonal principal directions of anisotropy are constrained by the lattice symmetry: no anisotropy for cubic symmetry, two principal directions, the unique c ( c *) axis and the ab plane, for tetragonal, hexagonal and trigonal, three orthogonal axes for orthorhombic, the unique b ( b *) axis and two orthogonal axes in the ac plane for monoclinic and three general orthogonal axes for the triclinic system. The general directions for triclinic and in the monoclinic ac plane are determined from the eigenvectors of a fitted anisotropic scale factor. Anisotropy is then analysed in cones around the principal axes (default semi-angle 20°) and within the same angle of a principal plane, or alternatively as projections onto the two or three principal directions. In the former case, observations are weighted with a cosine weight declining from 1 along the principal direction to 0 at the edge of the region. Plots of CC 1/2 and 〈 I /σ〉 then allow assessment of resolution in different directions in the same way as for the overall resolution and with the same difficulties” | concepts[81] |
| concept | weak data — not defined in this paper's own words; high-resolution observations whose usefulness is uncertain — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[82] |
| concept | structure determination — not defined in this paper's own words; downstream inference that may benefit from retaining weak data — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[83] |
| concept | unwanted noise — not defined in this paper's own words; possible map contribution from insignificant high-resolution observations — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem, with the goal of developing clear protocols” | concepts[84] |
| concept | Anisotropic cutoffs — not defined in this paper's own words; direction-dependent exclusions likely to introduce map artefacts — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem, with the goal of developing clear protocols” | concepts[85] |
| concept | artefacts in map calculation — not defined in this paper's own words; risk attributed to anisotropic cutoffs — “How can we decide where to apply a resolution cutoff? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noise to maps and may lead us to overconfidence in the quality of our model (although the relationship between data quality and model quality is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropy in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffs are likely to cause artefacts in map calculation. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem, with the goal of developing clear protocols” | concepts[86] |
| concept | simulated data — not defined in this paper's own words; synthetic comparison data used to locate the information limit — “By comparing refinement against measured data with refinement against simulated data, we can judge the resolution point at which the measured data become no better than simulated data and compare this with the data-processing statistics. Figs. 2 ▶ ( a )–2 ▶ ( d ) show various analyses for example 1, for which simulated data were generated beyond 2.4 Å resolution in several ways with simulations based on the observed intensity distribution but not on the structure itself (see Appendix A 2 for details of the simulation): (i) the expected value of | F | at the resolution and anisotropic position of each reflection, i.e. all | F |s close together in reciprocal space are the same (denoted F expected ), (ii) a number of data sets with random intensities around the expected intensities with the same distribution as the measured intensities at the same resolution. These simulated intensities were converted to amplitudes (denoted F random ) with the CCP 4 program CTRUNCATE using the same procedure as used for the experimental data (French & Wilson, 1978 ▶ ). The model was then refined with REFMAC (Murshudov et al. , 2011 ▶ ) to 1.83 Å resolution against the observed data ( F obs ) and also against various simulated data sets. As shown in Fig. 2 ▶ ( a ), R free values (and R work ; not shown) for the experimental data increase with increasing resolution as expected, while against the simulated data there is a sudden increase at 2.4 Å resolution where the refinement switches from the experimental data, but beyond about 1.95 Å resolution R free for F obs is no better than that for F expected , while refinement against random data sets (with different errors) gives R free values which converge towards the values from F obs and F expected at higher resolution at around R = 0.42, the expected value (see Appendix A 1 ). We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06” | concepts[87] |
| concept | F expected — not defined in this paper's own words; simulated amplitudes fixed near an expected reciprocal-space value — “By comparing refinement against measured data with refinement against simulated data, we can judge the resolution point at which the measured data become no better than simulated data and compare this with the data-processing statistics. Figs. 2 ▶ ( a )–2 ▶ ( d ) show various analyses for example 1, for which simulated data were generated beyond 2.4 Å resolution in several ways with simulations based on the observed intensity distribution but not on the structure itself (see Appendix A 2 for details of the simulation): (i) the expected value of | F | at the resolution and anisotropic position of each reflection, i.e. all | F |s close together in reciprocal space are the same (denoted F expected ), (ii) a number of data sets with random intensities around the expected intensities with the same distribution as the measured intensities at the same resolution. These simulated intensities were converted to amplitudes (denoted F random ) with the CCP 4 program CTRUNCATE using the same procedure as used for the experimental data (French & Wilson, 1978 ▶ ). The model was then refined with REFMAC (Murshudov et al. , 2011 ▶ ) to 1.83 Å resolution against the observed data ( F obs ) and also against various simulated data sets. As shown in Fig. 2 ▶ ( a ), R free values (and R work ; not shown) for the experimental data increase with increasing resolution as expected, while against the simulated data there is a sudden increase at 2.4 Å resolution where the refinement switches from the experimental data, but beyond about 1.95 Å resolution R free for F obs is no better than that for F expected , while refinement against random data sets (with different errors) gives R free values which converge towards the values from F obs and F expected at higher resolution at around R = 0.42, the expected value (see Appendix A 1 ). We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06” | concepts[88] |
| concept | F random — not defined in this paper's own words; simulated amplitudes generated from random intensities — “By comparing refinement against measured data with refinement against simulated data, we can judge the resolution point at which the measured data become no better than simulated data and compare this with the data-processing statistics. Figs. 2 ▶ ( a )–2 ▶ ( d ) show various analyses for example 1, for which simulated data were generated beyond 2.4 Å resolution in several ways with simulations based on the observed intensity distribution but not on the structure itself (see Appendix A 2 for details of the simulation): (i) the expected value of | F | at the resolution and anisotropic position of each reflection, i.e. all | F |s close together in reciprocal space are the same (denoted F expected ), (ii) a number of data sets with random intensities around the expected intensities with the same distribution as the measured intensities at the same resolution. These simulated intensities were converted to amplitudes (denoted F random ) with the CCP 4 program CTRUNCATE using the same procedure as used for the experimental data (French & Wilson, 1978 ▶ ). The model was then refined with REFMAC (Murshudov et al. , 2011 ▶ ) to 1.83 Å resolution against the observed data ( F obs ) and also against various simulated data sets. As shown in Fig. 2 ▶ ( a ), R free values (and R work ; not shown) for the experimental data increase with increasing resolution as expected, while against the simulated data there is a sudden increase at 2.4 Å resolution where the refinement switches from the experimental data, but beyond about 1.95 Å resolution R free for F obs is no better than that for F expected , while refinement against random data sets (with different errors) gives R free values which converge towards the values from F obs and F expected at higher resolution at around R = 0.42, the expected value (see Appendix A 1 ). We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06” | concepts[89] |
| concept | CTRUNCATE — not defined in this paper's own words; program converting simulated or measured intensities to amplitudes — “By comparing refinement against measured data with refinement against simulated data, we can judge the resolution point at which the measured data become no better than simulated data and compare this with the data-processing statistics. Figs. 2 ▶ ( a )–2 ▶ ( d ) show various analyses for example 1, for which simulated data were generated beyond 2.4 Å resolution in several ways with simulations based on the observed intensity distribution but not on the structure itself (see Appendix A 2 for details of the simulation): (i) the expected value of | F | at the resolution and anisotropic position of each reflection, i.e. all | F |s close together in reciprocal space are the same (denoted F expected ), (ii) a number of data sets with random intensities around the expected intensities with the same distribution as the measured intensities at the same resolution. These simulated intensities were converted to amplitudes (denoted F random ) with the CCP 4 program CTRUNCATE using the same procedure as used for the experimental data (French & Wilson, 1978 ▶ ). The model was then refined with REFMAC (Murshudov et al. , 2011 ▶ ) to 1.83 Å resolution against the observed data ( F obs ) and also against various simulated data sets. As shown in Fig. 2 ▶ ( a ), R free values (and R work ; not shown) for the experimental data increase with increasing resolution as expected, while against the simulated data there is a sudden increase at 2.4 Å resolution where the refinement switches from the experimental data, but beyond about 1.95 Å resolution R free for F obs is no better than that for F expected , while refinement against random data sets (with different errors) gives R free values which converge towards the values from F obs and F expected at higher resolution at around R = 0.42, the expected value (see Appendix A 1 ). We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06” | concepts[90] |
| concept | REFMAC — not defined in this paper's own words; refinement program used in resolution-limit tests — “By comparing refinement against measured data with refinement against simulated data, we can judge the resolution point at which the measured data become no better than simulated data and compare this with the data-processing statistics. Figs. 2 ▶ ( a )–2 ▶ ( d ) show various analyses for example 1, for which simulated data were generated beyond 2.4 Å resolution in several ways with simulations based on the observed intensity distribution but not on the structure itself (see Appendix A 2 for details of the simulation): (i) the expected value of | F | at the resolution and anisotropic position of each reflection, i.e. all | F |s close together in reciprocal space are the same (denoted F expected ), (ii) a number of data sets with random intensities around the expected intensities with the same distribution as the measured intensities at the same resolution. These simulated intensities were converted to amplitudes (denoted F random ) with the CCP 4 program CTRUNCATE using the same procedure as used for the experimental data (French & Wilson, 1978 ▶ ). The model was then refined with REFMAC (Murshudov et al. , 2011 ▶ ) to 1.83 Å resolution against the observed data ( F obs ) and also against various simulated data sets. As shown in Fig. 2 ▶ ( a ), R free values (and R work ; not shown) for the experimental data increase with increasing resolution as expected, while against the simulated data there is a sudden increase at 2.4 Å resolution where the refinement switches from the experimental data, but beyond about 1.95 Å resolution R free for F obs is no better than that for F expected , while refinement against random data sets (with different errors) gives R free values which converge towards the values from F obs and F expected at higher resolution at around R = 0.42, the expected value (see Appendix A 1 ). We could conclude from this that there is no gain in including data beyond about 1.95 Å resolution, at which point CC 1/2 is 0.27 and 〈 I /σ〉 is 0.9: a more conventional cutoff point at 〈 I /σ〉 = 2.0 would be at 2.06” | concepts[91] |
| concept | positive bias — not defined in this paper's own words; weak-amplitude bias introduced by truncation — “The TRUNCATE procedure for inferring | F | from experimentally measured I produces a positive bias for weak intensities, which complicates the comparison with simulated data. To test the effect of this, refinement was also carried out against observed and simulated intensities instead of against amplitudes” | concepts[92] |
| concept | maximum-likelihood scale factor D — not defined in this paper's own words; resolution-shell measure of reflection contribution to density — “Another estimate of the significance of the data is shown by the maximum-likelihood scale factor D . The best electron density after refinement is calculated using coefficients 2 mF o − DF c , where m is dependent on D . The values of D within resolution shells indicate how much these reflections contribute to electron density, with a value close to zero indicating that these reflections make little contribution. Fig. 2 ▶ ( d ) shows that (for example 1) D falls with resolution but is still greater than the values for simulated data even at the resolution edge. Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule” | concepts[93] |
| concept | electron density — not defined in this paper's own words; refined map quantity weighted using D-dependent coefficients — “Another estimate of the significance of the data is shown by the maximum-likelihood scale factor D . The best electron density after refinement is calculated using coefficients 2 mF o − DF c , where m is dependent on D . The values of D within resolution shells indicate how much these reflections contribute to electron density, with a value close to zero indicating that these reflections make little contribution. Fig. 2 ▶ ( d ) shows that (for example 1) D falls with resolution but is still greater than the values for simulated data even at the resolution edge. Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2 has fallen to around 0.2–0.4, or 〈 I /σ〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule” | concepts[94] |
| concept | automated model-building procedures — not defined in this paper's own words; pipelines tested across resolution cutoffs — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement model with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolution between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutions between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutions. However, extending the resolution at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipeline for model building at least is more dependent on phase error rather than quality of structure-factor amplitudes (and hence resolution). In cases of difficulty, it may be worth trying model building with data to different resolutions” | concepts[95] |
| concept | Buccaneer / REFMAC pipeline — not defined in this paper's own words; automated building and refinement workflow — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement model with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolution between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutions between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutions. However, extending the resolution at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipeline for model building at least is more dependent on phase error rather than quality of structure-factor amplitudes (and hence resolution). In cases of difficulty, it may be worth trying model building with data to different resolutions” | concepts[96] |
| concept | experimental phases — not defined in this paper's own words; phase information used in a poor-map building test — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement model with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolution between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutions between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutions. However, extending the resolution at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipeline for model building at least is more dependent on phase error rather than quality of structure-factor amplitudes (and hence resolution). In cases of difficulty, it may be worth trying model building with data to different resolutions” | concepts[97] |
| concept | molecular-replacement model — not defined in this paper's own words; starting model for the complex-building test — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement model with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolution between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutions between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutions. However, extending the resolution at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipeline for model building at least is more dependent on phase error rather than quality of structure-factor amplitudes (and hence resolution). In cases of difficulty, it may be worth trying model building with data to different resolutions” | concepts[98] |
| concept | phase error — not defined in this paper's own words; possible limiting factor for automated building — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement model with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolution between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutions between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutions. However, extending the resolution at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipeline for model building at least is more dependent on phase error rather than quality of structure-factor amplitudes (and hence resolution). In cases of difficulty, it may be worth trying model building with data to different resolutions” | concepts[99] |
| concept | structure-factor amplitudes — not defined in this paper's own words; amplitude quality contrasted with phase error — “There have been anecdotal reports that extending the resolution to include weak data may help automated model-building procedures. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutions or largely failed at all resolutions. Example 2 was used to test model building from a rather poor map with experimental phases to 2.5 Å resolution and model building with the Buccaneer / REFMAC pipeline (Cowtan, 2012 ▶ ) tested at resolutions of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutions had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutions in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement model with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolution between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutions between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutions. However, extending the resolution at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipeline for model building at least is more dependent on phase error rather than quality of structure-factor amplitudes (and hence resolution). In cases of difficulty, it may be worth trying model building with data to different resolutions” | concepts[100] |
| concept | OMIT maps — not defined in this paper's own words; maps testing the visibility of deliberately omitted model regions — “4.3. Electron density in OMIT maps The effect of resolution on the visual appearance of difference maps was tested on regions of the model which were not included in refinement. This is important in manual building and completion of structures. Part of a structure was omitted, the remaining coordinates were perturbed by a random shift of up to 0.3 Å to reduce model bias and the structure was refined in REFMAC with different resolution cutoffs. Fig. 3 ▶ shows two examples of maximum-likelihood difference maps at different resolutions for examples 4 and 1. There is not much difference between the maps, although there may be a slight improvement in sharpness in example 1 (Fig. 3 ▶ b ) on extending from 2.4 to 2.0 Å resolution, consistent with the refinement results in § 4.1 (Fig. 2 ▶ a ). Again, as for the automated model building (§ 4.2), extending the resolution seems at least to do no harm” | concepts[101] |
| concept | difference maps — not defined in this paper's own words; map outputs inspected across resolution cutoffs — “The effect of resolution on the visual appearance of difference maps was tested on regions of the model which were not included in refinement. This is important in manual building and completion of structures. Part of a structure was omitted, the remaining coordinates were perturbed by a random shift of up to 0.3 Å to reduce model bias and the structure was refined in REFMAC with different resolution cutoffs. Fig. 3 ▶ shows two examples of maximum-likelihood difference maps at different resolutions for examples 4 and 1. There is not much difference between the maps, although there may be a slight improvement in sharpness in example 1 (Fig. 3 ▶ b ) on extending from 2.4 to 2.0 Å resolution, consistent with the refinement results in § 4.1 (Fig. 2 ▶ a ). Again, as for the automated model building (§ 4.2), extending the resolution seems at least to do no harm” | concepts[102] |
| concept | model bias — not defined in this paper's own words; bias reduced by perturbing retained coordinates — “The effect of resolution on the visual appearance of difference maps was tested on regions of the model which were not included in refinement. This is important in manual building and completion of structures. Part of a structure was omitted, the remaining coordinates were perturbed by a random shift of up to 0.3 Å to reduce model bias and the structure was refined in REFMAC with different resolution cutoffs. Fig. 3 ▶ shows two examples of maximum-likelihood difference maps at different resolutions for examples 4 and 1. There is not much difference between the maps, although there may be a slight improvement in sharpness in example 1 (Fig. 3 ▶ b ) on extending from 2.4 to 2.0 Å resolution, consistent with the refinement results in § 4.1 (Fig. 2 ▶ a ). Again, as for the automated model building (§ 4.2), extending the resolution seems at least to do no harm” | concepts[103] |
| concept | maximum-likelihood difference maps — not defined in this paper's own words; difference maps compared at different resolutions — “The effect of resolution on the visual appearance of difference maps was tested on regions of the model which were not included in refinement. This is important in manual building and completion of structures. Part of a structure was omitted, the remaining coordinates were perturbed by a random shift of up to 0.3 Å to reduce model bias and the structure was refined in REFMAC with different resolution cutoffs. Fig. 3 ▶ shows two examples of maximum-likelihood difference maps at different resolutions for examples 4 and 1. There is not much difference between the maps, although there may be a slight improvement in sharpness in example 1 (Fig. 3 ▶ b ) on extending from 2.4 to 2.0 Å resolution, consistent with the refinement results in § 4.1 (Fig. 2 ▶ a ). Again, as for the automated model building (§ 4.2), extending the resolution seems at least to do no harm” | concepts[104] |
| concept | cryocooling — not defined in this paper's own words; practice associated with reduced routine merging across crystals — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[105] |
| concept | isomorphism — not defined in this paper's own words; cross-crystal comparability condition for merging data — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[106] |
| concept | very weak anomalous signal from sulfur — not defined in this paper's own words; signal enhanced by merging many crystals — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[107] |
| concept | fast data collection — not defined in this paper's own words; modern synchrotron capability yielding many equivalent data sets — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[108] |
| concept | non-isomorphism — not defined in this paper's own words; cross-data-set difference that complicates merging — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[109] |
| concept | joint distribution of all data sets — not defined in this paper's own words; distribution the authors say should govern merging — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[110] |
| concept | merging many data sets — not defined in this paper's own words; multi-data-set combination that usually improves signal-to-noise — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[111] |
| concept | nominal resolution — not defined in this paper's own words; reflection-count limit often misused as a model-quality indicator — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[112] |
| concept | what the data are to be used for — not defined in this paper's own words; intended downstream use governing cutoff choice — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[113] |
| concept | model quality — not defined in this paper's own words; quality that depends on data but is poorly summarized by nominal resolution — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[114] |
| concept | local structural feature — not defined in this paper's own words; local correctness target not certified by a global score — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[115] |
| concept | paired-refinement — not defined in this paper's own words; external tests supporting inclusion beyond traditional cutoffs — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[116] |
| concept | generous limit — not defined in this paper's own words; recommended cutoff policy that retains real but weak information — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[117] |
| concept | weak noisy data — not defined in this paper's own words; data from which improved procedures may extract more information — “A major cause of user indecision and conflicts with journal referees is the resolution cutoff. We cannot set definite rules for this, as it depends on what the data are to be used for. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropy: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolution statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σ〉 = 2 may improve structure determination, as do the ‘paired-refinement’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak data seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolution as an indicator of model quality, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural feature. Clearly, well measured data to 1.5 Å resolution contain more information than a data set to 3.5 Å resolution and are therefore likely to lead to a more correct structure, but nominal resolution in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoff over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limit so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolution of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy data” | concepts[118] |
| concept | merging data from many crystals — not defined in this paper's own words; multi-crystal combination proposed to enhance weak anomalous sulfur signal — “With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocooling, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystals to enhance the very weak anomalous signal from sulfur. The current tools for checking isomorphism between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collection on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model quality depends on data quality and merging many data sets usually improves the signal-to-noise ratio in the data; however, it is not clear how to merge data when there is severe non-isomorphism or radiation damage. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data sets and to merge using this distribution” | concepts[119] |
| correlation coefficient between half data sets | — “A better measure for assessing the ‘resolution’ of a data set is the correlation coefficient between random half data sets, CC 1/2 (labelled ‘CC_Imean’ in older versions of SCALA ; Evans, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolution in both SCALA and AIMLESS (Fig. 2 ▶ ). A related statistic, Fourier shell correlation, has been used for assessing the resolution of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficient is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2 is generally close to 1 at low resolution and falls sharply to near zero at higher resolution as the intensities become weaker” | content_tags.statistics[0] |
Full text — tagged
The reference list is not part of the text we hold for this paper. Our copy was extracted from the publisher's page and the bibliography did not survive that extraction, so the article below ends before its references. Nothing has been removed by us.
How good are my data and what is the resolutionterm? EvanspersName Philip R. a * MurshudovpersName Garib N. a a MRC Laboratory of Molecular Biology, Hills Road, Cambridge CB2 0QH, England Correspondence e-mail: pre@mrc-lmb.cam.ac.uk 01 7 2013 13 6 2013 69 Pt 7 224279 d130700 1204 1214 07 9 2012 02 1 2013 13 06 2013 28 06 2013 13 05 2024 © EvanspersName & MurshudovpersName 2013 2013 https://creativecommons.org/licenses/by/2.0/uk/ This is an open-access article distributed under the terms of the Creative Commons Attribution Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original authors and source are cited. A full version of this article is available from Crystallography Journals Online. The new scaling program AIMLESSterm is described and tests of refinements at different resolutionsterm are compared with analyses from the scaling step.
Following integration of the observed diffraction spots, the process of ‘data reductionterm’ initially aims to determine the point-group symmetry of the data and the likely space groupterm. This can be performed with the program POINTLESSterm . The scaling program then puts all the measurements on a common scaleterm, averages measurements of symmetry-related reflectionsterm (using the symmetry determined previously) and produces many statistics that provide the first important measures of data qualityterm. A new scaling program, AIMLESSterm , implements scaling models similar to those in SCALAterm but adds some additional analyses. From the analyses, a number of decisions can be made about the quality of the data and whether some measurements should be discarded. The effective ‘resolutionterm’ of a data set is a difficult and possibly contentious question (particularly with referees of papers) and this is discussed in the light of tests comparing the data-processing statisticsterm with trials of refinement against observed and simulated dataterm, and automated model-buildingterm and comparison of maps calculated with different resolutionterm limits. These trials show that adding weak high-resolution dataterm beyond the commonly used limits may make some improvement and does no harm.
data reductionterm data scaling software data statistics Data collection and processing pmc-status-qastatus 0 pmc-status-live yes pmc-status-embargo no pmc-status-released yes pmc-prop-open-access yes pmc-prop-olf no pmc-prop-manuscript no pmc-prop-legally-suppressed no pmc-prop-has-pdf yes pmc-prop-has-supplement no pmc-prop-pdf-only no pmc-prop-suppress-copyright no pmc-prop-is-real-version no pmc-prop-is-scanned-article no pmc-prop-preprint no pmc-prop-in-epmc yes pmc-license-ref CC BY 1. Introduction Following integration of the spots on a set of X-ray diffraction imagesterm to produce a list of reflection intensitiesterm, a series of operations are performed on the data, usually referred to as ‘data reductionterm’. These processes include determination of the point groupterm and if possible the space groupterm, checking for consistent indexingterm where there are alternatives, putting all of the data on a common scaleterm, deciding whether to reject parts of the collected data or to cut the resolutionterm and estimating the structure amplitude | F | from intensity. Statistics on the internal consistencyterm of the data also provide a good indication of the overall quality of the data set. Algorithms and methods for data reductionterm have been well documented in many papers ( e.g. Fox & Holmes, 1966 ▶ ; Otwinowski et al. , 2003 ▶ ; EvanspersName, 2006 ▶ , 2011 ▶ ; Kabsch, 2010 ▶ ) and the details will not be repeated here. Scaling attempts to correct for contributions to the measured intensities arising from experimental conditionsterm which vary during data collection, such as variations in the incident-beam intensityterm, the volume of the crystal illuminatedterm, absorption in the primary or secondary beamterm and average radiation damageterm. This is performed by trying to make all symmetry-related or replicated measurements of a reflection intensity equal, i.e. to make the data as internally consistent as possible.
This paper describes a new data-scaling programterm, AIMLESSterm , and discusses criteria for deciding the ‘resolutionterm’ of a measured data set. In the CCP 4 context (Winn et al. , 2011 ▶ ), AIMLESSterm is used immediately after the program POINTLESSterm , which determines the likely point groupterm and possible space groupterm, as well as optionally combining data from multiple files each containing a ‘sweep’ of data and putting them on a common indexing system if necessary (EvanspersName, 2011 ▶ ). 1 AIMLESSterm is then followed by CTRUNCATEterm , which calculates the structure amplitudes | F |term from the intensities and outputs various intensity statistics mainly to detect twinning.
2. The scaling program AIMLESSterm AIMLESSterm is a new implementation in C++ of a classic scaling methodterm, designed to make it easy to add new scaling models and algorithms. It is a replacement for the earlier CCP 4 program SCALAterm (EvanspersName, 2006 ▶ , 2011 ▶ ) and at present uses a very similar scale modelterm. The function minimized is where I h l is the l th observation of reflection h , g h l is its associated inverse scaleterm, w h l = 1/σ 2 ( I h l ) and 〈 I h 〉 is the weighted average intensity for all observations l of reflection h or its symmetry mates. The inverse scaleterm g h l comes from the refined scale modelterm and is a function of the crystal rotation angleterm ϕ as a proxy for primary beam direction s 1 and for radiation doseterm (or time) and the secondary beam direction s 2 : g = g primary (ϕ)exp[−2 B (ϕ)sin 2 θ/λ 2 ] g secondary ( s 2 ). The relative B -factor term is largely an average radiation-damage correctionterm. The smoothed primary scale factorsterm g primary (ϕ) and relative B factorsterm B (ϕ) are determined at suitable intervals in ϕ and are interpolated using Gaussian weightsterm. The secondary beam correctionterm g secondary ( s 2 ) is determined as a sum of spherical harmonic termsterm. Parameter restraint termsterm (ties) include a sphericity restraintterm on g secondary ( s 2 ), tying all spherical harmonic coefficients to zero and optional ties between adjacent primary scales and relative B factorsterm.
AIMLESSterm iterates the scaling step with an optimization of the standard error estimatesterm on each observation σ( I h l ) and outlier rejectionterm. Note that the scaling process is generally hugely overdetermined (many more observations than parameters, e.g. 45 000 observations for 30 parameters) and that weak intensities do not contain much useful information about the scales, so that the scaling can be made faster (roughly linearly) by working with a selected subset of strong reflectionsterm. The principal steps in the process (in the current version) are as follows. (i) Read all observations into a reflection-list object ( SCALAterm does not store the observations but rereads them for each scaling cycle etc. , as storing large data sets was impracticable when SCALAterm was written). Sort symmetry-related observations and partial observations together if necessary.
(ii) Set up the scaling model depending on what data are present and explicit user-given control instructions (if any). For the smoothly varying scale and B factors, decide on suitable interval for the scales for each ‘run’ or ‘sweep’ of contiguous images, depending on the total length of the sweep and default or specified values.
(iii) Obtain initial rough scale estimates from average intensities.
(iv) First-round scaling with a sample of a few thousand strong reflectionsterm with I /σterm( I ) greater than a suitable minimum value. At this stage the σ( I ) estimates read from the integration program may not be very accurate but are good enough for this selection.
(v) First outlier rejectionterm, using an algorithm similar to that described in §A5 of EvanspersName (2006 ▶ ).
(vi) For data from MOSFLM , which outputs two estimates of each intensity, optimize the level of intensity I mid at which to switch (smoothly) between using the profile-fitted value I prf for weak dataterm and summation integration I sum for strong data, where I ′ is the summation integration intensity before application of the Lorentz and polarization corrections. The exact form of this weighted mean is not critical, as ideally the two estimates are the same.
(vii) First optimization of σ( I ) estimates (see § 2.1).
(viii) Main scaling with strong reflectionsterm chosen on normalized intensities E 2term (typically choosing only observations with 0.8 < E 2 < 5). This gives a subset of data distributed over all resolutionterm ranges.
(ix) Second outlier rejectionterm as before.
(x) Final optimization of σ( I ) estimates as before.
(xi) Final outlier rejectionterm as before.
(xii) Accumulate and print statistics.
(xiii) Output merged or unmerged reflection liststerm to files.
2.1. Standard error estimatesterm Initial estimates of the standard errorterm·var of each intensity observation, σ( I h l ), are generally underestimated by all integration programs, so AIMLESSterm , like SCALAterm , updates the σ( I ) estimates in an attempt to make the average standard errorterm·var match the average scatter of observations as a function of intensity only. The mismatch arises partly from the unknown ‘gain’ of the detector ( i.e. detector units per photon), which scales the Poisson-statistic error estimatesterm (as well as correcting for the detector point-spread function), and partly from a variety of instrumental instabilitiesterm which cause an increase in error with increasing intensity. If the error estimate were correct in explaining the observed discrepancies within the data set, then the normalized deviationsterm (where n h is the number of observations of reflection h and here I h l is the scale-corrected value, i.e. I h l / g h l ) should be distributed with a mean of 0.0 and a standard deviation of 1.0. 2 The standard error estimateterm is then adjusted to optimizing the values of the ‘correction’ factors SdFacterm, SdBterm and SdAddterm to make variance(δ h l ) equal to 1.0 over all intensity ranges. The value of the term inside the square root is (arbitrarily) set to a minimum value of 0.1σ( I h l ) 2 to avoid possible negative values (a rare possibility). A separate set of correction factors is determined for each ‘run’ (usually, although an option is available to use the same value for all runs) and separately for fully recorded and partially recorded observations (if relevant). This is performed by minimizing summed over all intensity ranges i , currently with equal weights w i on each intensity binterm and loose restraints on SdBterm parameters to avoid extreme values. Final values of variance(δ h l ) as a function of intensity for each run are plotted in the output of the program as an indication of the success (or otherwise) of this ‘correction’. Sdfacterm can be identified primarily with the uncertainty in the detector gainterm and Sdaddterm with general instability factors which lead to an error proportional to intensity (see, for example, Diederichs, 2010 ▶ ), but SbB has no obvious physical interpretation. However, this factor helps to flatten the plot of variance(δ h l ) against intensity and may be justified as an empirical ‘correction’ factor. It should be noted that this ‘correction’ to the error estimates is a fairly crude approximation, as it assumes there are no major residual systematic errors (such as those arising from radiation damageterm, for example) and that the correction can be parameterized purely on intensity.
3. Analysis of data qualityterm Once we have a set of scale factorsterm to put all the intensities on a common scaleterm and improved estimates of the error on each intensity, then we can analyse the data for internal consistencyterm and for signal-to-noise ratioterm. We can do this as a function of image numberterm (equivalent to time or crystal rotation) to detect radiation damageterm and weak or inconsistent regions of dataterm and against resolutionterm to decide on a high-resolution cutoff (see §4 ). Note that internal consistency measuresterm are likely to underestimate the true error, since symmetry-related observations may suffer from the same systematic error.
Internal consistencyterm has traditionally been measured by R factorsterm relating an individual observation I h l (after scaling) to the (weighted) average of all symmetry-related or replicate observations of the unique reflection h , 〈 I h 〉. The multiplicity-weighted R measterm is an improvement over R mergeterm , as it is relatively insensitive to data multiplicityterm (Diederichs & Karplus, 1997 ▶ ; Weiss & Hilgenfeld, 1997 ▶ ; Weiss, 2001 ▶ ), whereas R mergeterm tends to increase with increasing multiplicityterm, even though the averaged intensities are improving. R p.i.m.term provides an estimate of data qualityterm after merging multiple observations.
An alternative way of measuring internal consistencyterm for the analysis against resolutionterm is to split the observations randomly into halves and then calculate the linear correlation coefficientterm between the halves. This is arguably the most reliable measure and is discussed further below.
3.1. Analysis against ‘batch’ or image numberterm Analysis of various parameters as a function of batch or image numberterm, a proxy for crystal rotation, time or radiation doseterm, is useful to determine whether the crystal has suffered unduly from radiation damageterm or whether there are any other parts of the data which should be discarded. AIMLESSterm plots similar graphs of R mergeterm and of scale and relative B factorsterm to those produced by SCALAterm (see, for example, Fig. 2 of EvanspersName, 2011 ▶ ). Increasing negative values of the relative B factorterm are an indicator of deterioration with dose, although the B factor is also affected by factors other than radiation damageterm. AIMLESSterm adds two new plots against batch numberterm: a rough estimate of the maximum resolutionterm for each image and a cumulative completenessterm (for all data and anomalous pairs; see Fig. 1 ▶ ). The ‘maximum resolutionterm’ is estimated from the point at which 〈 I /σterm( I )〉 falls below 1.0 for each batch: note that this 〈 I /σterm( I )〉 is without averaging multiple measurements (which would not generally occur on the same image), so will be smaller than the 〈 I /σterm〉 after averaging (§ 3.2.1). The plot shows the noisy values for each batch, as well as a smoothed plot typically averaged over a 5° range. This is only a rough estimate of resolutionterm (see § 4), but serves to illustrate any trends. The cumulative completenessterm plot helps in deciding whether cutting back data from the end because of radiation damageterm would compromise the completeness. Such decisions are more complicated if the data have been measured from multiple ‘sweeps’ or multiple crystals.
3.2. Analysis against resolutionterm In order to estimate the useful ‘resolutionterm’ of the data, i.e. the resolutionterm at which the data may be truncated without losing significant information, AIMLESSterm plots various measures of signal to noise and internal consistencyterm against resolutionterm. There is at present no general consensus on the optimum criteria for interpretation of these plots and how to estimate the point at which adding additional high-resolution data is not adding anything useful: the true ‘resolutionterm’ of a data set has often been a point of contention with referees of papers.
3.2.1. Signal-to-noise ratioterm One obvious way to judge data significance is from the average signal-to-noise ratioterm of the merged intensities as a function of resolutionterm. This is calculated as [after ‘correcting’ the σ′( I h l ) estimates; § 2.1], i.e. for each reflection h the average intensity over symmetry mates 〈 I h 〉 is divided by its estimated error σ(〈 I h 〉) and this ratio is averaged in resolution binsterm [reported as Mn(I/sd) in the program output]. Commonly used resolution-cutoff levelsterm are typically in the range 1–2: even in a resolution binterm with 〈 I /σterm〉 = 1 a proportion of intensities are significantly above the noise levelterm [∼5–7% I > 3σ, ∼20–25% negative]. 〈 I /σterm〉 is a good criterion for resolution cutoffterm, but it does suffer from uncertainties in the estimation of σ( I ), both from inadequacies in the integration program and the necessary σ( I ) ‘correction’ (see § 2.1; Ian Tickle, in a private communication, has pointed out that the major correction applies to large intensities and therefore would not affect the weak high-resolution dataterm relevant to determination of resolution cutoffterm). It should be noted that 〈 I /σterm〉 is not independent of measures of internal consistencyterm because the corrections to σ′( I ) are adjusted to match the scatter of observations. Thus, σ′( I ) estimates are still likely to be underestimates of the true standard deviations.
3.2.2. Measures of internal consistencyterm The traditional R factorsterm measuring internal consistencyterm, R mergeterm or better R measterm (§ 3), are not suitable measures for setting a resolution cutoffterm (EvanspersName, 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ), despite their apparent popularity with referees. As pointed out by Karplus and Diederichs, these R factorsterm cannot be compared with the R factorsterm in refinement, since R mergeterm and R measterm both tend to infinity as the data become weaker, while R crystterm (either R workterm or R freeterm ) tends to a constant (see Appendix A 1 and Luzzati, 1953 ▶ ). This means that there is no sensible way of setting a maximum acceptable level. Note that this is a difference between an R factorterm on intensity, which can be measured as zero or negative, and an R factorterm on amplitude | F |, which cannot be negative and will be biased positive if, for example, the TRUNCATE procedure of French & Wilson (1978 ▶ ) has been applied (or indeed any protocol which sets negative values to positive). R mergeterm or R measterm are useful metrics for monitoring variation with batch (§ 3.1), and their value for the strongest intensities (top intensity binterm or low-resolution bin) is a good indicator of overall data qualityterm. A large R factorterm for the strong data may indicate a problem [a serious cause for concern if R mergeterm (strong) > 0.10; ideally it should be <0.05], but they are not good indicators for weak dataterm. In general, since R factorsterm are dependent on the distribution of the dataterm (see, for example, MurshudovpersName, 2011 ▶ ) they are not good indicators of model qualityterm or internal consistencyterm, whereas the correlation coefficientsterm are indicators of the degree of linear dependence between data sets and are less dependent on the distribution of the dataterm, so they may be better indicators (see Appendix A 1 ).
A better measure for assessing the ‘resolutionterm’ of a data set is the correlation coefficientterm between random half data sets, CC 1/2term (labelled ‘CC_Imean’ in older versions of SCALAterm ; EvanspersName, 2006 ▶ , 2011 ▶ ; Karplus & Diederichs, 2012 ▶ ). This statistic is plotted against resolutionterm in both SCALAterm and AIMLESSterm (Fig. 2 ▶ ). A related statistic, Fourier shell correlationterm, has been used for assessing the resolutionterm of electron-microscopy reconstructions since the early 1980s (see, for example, Rosenthal & Henderson, 2003 ▶ ; Henderson et al. , 2012 ▶ ). The advantage of a correlation coefficientterm is that it has a well defined range: +1.0 for a good correlation and 0 for no correlation. CC 1/2term is generally close to 1 at low resolutionterm and falls sharply to near zero at higher resolutionterm as the intensities become weaker (Fig. 2 ▶ ).
3.2.3. Anisotropyterm Most data sets are anisotropic to some extent, which complicates analysis and decision making. The anisotropyterm of the data is analysed in AIMLESSterm using both CC 1/2term and 〈 I /σterm〉. The two or three orthogonal principal directions of anisotropyterm are constrained by the lattice symmetry: no anisotropyterm for cubic symmetry, two principal directions, the unique c ( c *) axis and the ab plane, for tetragonal, hexagonal and trigonal, three orthogonal axes for orthorhombic, the unique b ( b *) axis and two orthogonal axes in the ac plane for monoclinic and three general orthogonal axes for the triclinic system. The general directions for triclinic and in the monoclinic ac plane are determined from the eigenvectors of a fitted anisotropic scale factorterm. Anisotropyterm is then analysed in cones around the principal axesterm (default semi-angle 20°) and within the same angle of a principal plane, or alternatively as projections onto the two or three principal directions. In the former case, observations are weighted with a cosine weight declining from 1 along the principal direction to 0 at the edge of the region. Plots of CC 1/2term and 〈 I /σterm〉 then allow assessment of resolutionterm in different directions in the same way as for the overall resolutionterm and with the same difficulties.
4. Tests of resolution cutoffsterm How can we decide where to apply a resolution cutoffterm? On the one hand, using high-resolution data which are so weak as to be insignificant will add nothing useful, may add unwanted noiseterm to maps and may lead us to overconfidence in the quality of our model (although the relationship between data qualityterm and model qualityterm is not clear). On the other hand, we do not want to exclude useful data which might aid structure solution and improve the final model. Anisotropyterm in the data complicates this decision, as it is not clear whether it is better to include data based on the best direction, the worst, or something in between. Anisotropic cutoffsterm are likely to cause artefacts in map calculationterm. The problem of anisotropic data and how to deal with them in refinement and map calculation is an open question, and future work needs to address this problem, with the goal of developing clear protocols.
To examine these questions, a number of tests were carried out using data integrated beyond what would normally be considered acceptable using the example data sets listed in Table 1 ▶ .
4.1. Comparison with simulated dataterm By comparing refinement against measured data with refinement against simulated dataterm, we can judge the resolutionterm point at which the measured data become no better than simulated dataterm and compare this with the data-processing statisticsterm. Figs. 2 ▶ ( a )–2 ▶ ( d ) show various analyses for example 1, for which simulated dataterm were generated beyond 2.4 Å resolutionterm in several ways with simulations based on the observed intensity distribution but not on the structure itself (see Appendix A 2 for details of the simulation): (i) the expected value of | F | at the resolutionterm and anisotropic position of each reflection, i.e. all | F |s close together in reciprocal space are the same (denoted F expectedterm ), (ii) a number of data sets with random intensities around the expected intensities with the same distribution as the measured intensities at the same resolutionterm. These simulated intensities were converted to amplitudes (denoted F randomterm ) with the CCP 4 program CTRUNCATEterm using the same procedure as used for the experimental data (French & Wilson, 1978 ▶ ).
The model was then refined with REFMACterm (MurshudovpersName et al. , 2011 ▶ ) to 1.83 Å resolutionterm against the observed data ( F obs ) and also against various simulated dataterm sets. As shown in Fig. 2 ▶ ( a ), R freeterm values (and R workterm ; not shown) for the experimental data increase with increasing resolutionterm as expected, while against the simulated dataterm there is a sudden increase at 2.4 Å resolutionterm where the refinement switches from the experimental data, but beyond about 1.95 Å resolutionterm R freeterm for F obs is no better than that for F expectedterm , while refinement against random data sets (with different errors) gives R freeterm values which converge towards the values from F obs and F expectedterm at higher resolutionterm at around R = 0.42, the expected value (see Appendix A 1 ). We could conclude from this that there is no gain in including data beyond about 1.95 Å resolutionterm, at which point CC 1/2term is 0.27 and 〈 I /σterm〉 is 0.9: a more conventional cutoff point at 〈 I /σterm〉 = 2.0 would be at 2.06 Å resolutionterm. This data set is significantly anisotropic, with orthogonal principal axes along d1 = 0.97 h + 0.23 l , d2 = k , d3 = −0.75 h + 0.67 l , with the resolutionsterm at which 〈 I /σterm〉 = 2.0 along d1 , d2 and d3 being 2.23, 1.98 and 2.05 Å, respectively (Fig. 2 ▶ b ). Analysis of R factorsterm in cones in the same way (§ 3.2.3 and Fig. 2 ▶ b ) shows a similar pattern to the overall values, with a convergence of R factorsterm against F obs and F expectedterm in the range 2.08–1.91 Å.
The TRUNCATE procedure for inferring | F | from experimentally measured I produces a positive biasterm for weak intensities, which complicates the comparison with simulated dataterm. To test the effect of this, refinement was also carried out against observed and simulated intensities instead of against amplitudes: R freeterm values against simulated dataterm were larger from 2.4 Å resolutionterm as before, but had converged by ∼1.98 Å resolutionterm (Fig. 2 ▶ c ). Following refinement against intensities, REFMACterm calculates R factorsterm in a way that mimics R factorsterm on F (MurshudovpersName et al. , 2011 ▶ ), but these R factorsterm rise sharply with resolutionterm (ultimately to infinity), rather than flattening out as do those on | F |.
Another estimate of the significance of the data is shown by the maximum-likelihood scale factor Dterm . The best electron densityterm after refinement is calculated using coefficients 2 mF o − DF c , where m is dependent on D . The values of D within resolutionterm shells indicate how much these reflections contribute to electron densityterm, with a value close to zero indicating that these reflections make little contribution. Fig. 2 ▶ ( d ) shows that (for example 1) D falls with resolutionterm but is still greater than the values for simulated dataterm even at the resolutionterm edge.
Similar tests were carried out for examples 4 and 5 (see Figs. 2 ▶ e and 2 ▶ f ), with similar conclusions that by the time CC 1/2term has fallen to around 0.2–0.4, or 〈 I /σterm〉 to around 0.5–1.5, there is little information remaining, but that it would be hard to make a definite rule. With increasing resolutionterm the R factorsterm and D values for experimental data converge towards the values from simulated dataterm, but the point at which they coalesce relative to the data-processing scores varies between different scores and different data sets.
4.2. Tests with automated model buildingterm There have been anecdotal reports that extending the resolutionterm to include weak dataterm may help automated model-building proceduresterm. Unfortunately, this has been hard to prove: the examples tried here either worked at all resolutionsterm or largely failed at all resolutionsterm. Example 2 was used to test model building from a rather poor map with experimental phasesterm to 2.5 Å resolutionterm and model building with the Buccaneer / REFMAC pipelineterm (Cowtan, 2012 ▶ ) tested at resolutionsterm of 2.3, 2.4, 2.5 and 2.6 Å. Models built at all of these resolutionsterm had some correct and some incorrect parts, with the assigned sequence being largely wrong, but there was no consistent pattern over the different resolutionsterm in the number of residues built or sequence assignment or in the correctness of the models. Another test was performed on example 3, a 2:1 complex, starting with a molecular-replacement modelterm with the two large molecules (595 residues each) and building the smaller 91-residue molecule. In this case the smaller component was built more or less consistently at any resolutionterm between 2.57 and 3.3 Å, although perhaps with fewer errors away from these extremes at between 2.7 and 3.1 Å. Similar results were obtained with example 4, omitting the last domain (207 residues): this could be rebuilt more or less successfully at resolutionsterm between 1.8 and 2.8 Å, although maybe slightly more correctly at higher resolutionsterm. However, extending the resolutionterm at least seemed to do no harm. It might indicate that the Buccaneer / REFMAC pipelineterm for model building at least is more dependent on phase errorterm rather than quality of structure-factor amplitudesterm (and hence resolutionterm). In cases of difficulty, it may be worth trying model building with data to different resolutionsterm.
4.3. Electron densityterm in OMIT mapsterm The effect of resolutionterm on the visual appearance of difference mapsterm was tested on regions of the model which were not included in refinement. This is important in manual building and completion of structures. Part of a structure was omitted, the remaining coordinates were perturbed by a random shift of up to 0.3 Å to reduce model biasterm and the structure was refined in REFMACterm with different resolution cutoffsterm. Fig. 3 ▶ shows two examples of maximum-likelihood difference mapsterm at different resolutionsterm for examples 4 and 1. There is not much difference between the maps, although there may be a slight improvement in sharpness in example 1 (Fig. 3 ▶ b ) on extending from 2.4 to 2.0 Å resolutionterm, consistent with the refinement results in § 4.1 (Fig. 2 ▶ a ). Again, as for the automated model buildingterm (§ 4.2), extending the resolutionterm seems at least to do no harm.
5. Discussion The program AIMLESSterm performs essentially the same task as SCALAterm and gives similar results. However, it is significantly faster (about three times) and is a better framework for adding new scaling models and analyses. In due course, the three programs POINTLESSterm , AIMLESSterm and CTRUNCATEterm may be combined into one.
The extensive statistics produced by AIMLESSterm are mostly similar to those produced by SCALAterm , so the questions and decisions for the user are as discussed in EvanspersName (2011 ▶ ): (i) What is the point groupterm (Laue group)? (ii) What is the space groupterm? (iii) Is there radiation damageterm and should the most damaged regions of data be excluded? (iv) What resolution cutoffterm should be applied (see below)? (v) Is there a detectable anomalous signal? (vi) Are the data twinned? (vii) Is this data set better than those previously collected?
With regard to this last point, one traditional way of improving weak or incomplete data is to merge data from different crystals, provided that they are isomorphous. With the advent of cryocoolingterm, this has fallen out of fashion except for the most desperate cases, but recent work from Hendrickson’s group (Liu et al. , 2012 ▶ , 2013 ▶ ) makes a good case for merging data from many crystalsterm to enhance the very weak anomalous signal from sulfurterm. The current tools for checking isomorphismterm between crystals are rather undeveloped, but this technology is improving (see Giordano et al. , 2012 ▶ ). With the fast data collectionterm on modern synchrotrons, it is common to collect several or many more-or-less equivalent data sets and merging them may be better than just choosing the best. At the end, model qualityterm depends on data qualityterm and merging many data setsterm usually improves the signal-to-noise ratioterm in the data; however, it is not clear how to merge data when there is severe non-isomorphismterm or radiation damageterm. Blindly merging data may do more harm than good. It is necessary to analyse the joint distribution of all data setsterm and to merge using this distribution. In an ideal world all data sets would be used without merging, thus ensuring that the extraction of information from the data would be optimal at all stages of structure analysis: the distribution of the dataterm and the amount of information available at each stage of analysis would define what needs to be used.
A major cause of user indecision and conflicts with journal referees is the resolution cutoffterm. We cannot set definite rules for this, as it depends on what the data are to be used forterm. It is therefore a mistake to prematurely apply a harsh cutoff at the data-reduction stage: data can always be excluded later. It is also unclear how best to handle anisotropyterm: do you choose the best direction or the worst? It is probably best to include data to the limit in the best direction. Tests carried out here to relate the resolutionterm statistics to final model building and refinement do suggest that extending the data somewhat beyond the traditional limits such as 〈 I /σterm〉 = 2 may improve structure determinationterm, as do the ‘paired-refinementterm’ tests of Karplus & Diederichs (2012 ▶ ). At the very least, adding these weak dataterm seems to do no harm for the purposes of either automatic or manual model building. The main problem is that we have become accustomed to using the nominal resolutionterm as an indicator of model qualityterm, and it is not a good indicator, particularly as important biological and chemical conclusions from a structure often depend on local rather than global correctness. Nor indeed can any global score can indicate the correctness of any local structural featureterm. Clearly, well measured data to 1.5 Å resolutionterm contain more information than a data set to 3.5 Å resolutionterm and are therefore likely to lead to a more correct structure, but nominal resolutionterm in itself just tells us how many reflections were used, rather than their quality. From our limited tests here, it seems that changing the resolution cutoffterm over a considerable range ( e.g. from 2.2 to 1.9 Å) makes only a small difference, so the exact cutoff point is not a question to agonize over, but it seems sensible to set a generous limitterm so as not to exclude data containing real (if weak) information. There is no reason to suppose that cutting back the resolutionterm of the data will improve the model. These tests were performed with current programs and our current procedures at all stages could be improved to extract the maximum information from weak noisy dataterm.
1 For the naming of the programs POINTLESSterm and AIMLESSterm , see Gibbons (1932 ▶ ).
2 Note that (as pointed out by a referee) this is only strictly true if all weights used in the calculation of 〈 I h 〉 are equal: this needs further investigation, although some preliminary tests using different weighting schemes (including equal unit weights) showed only small differences.
We would like to thank Stephen Graham and Janet Deane for test data sets and Andrew Leslie for reading the manuscript. PRE was supported by MRC grant U105178845 and GNM by MRC grant MC_UP_A025_1012.
Appendix A Statistical methods A1. Behaviour of crystallographic R values Crystallographic R factorsterm are calculated using the formula where the summation is over the reflections used to calculate the R value (in the case of twinning a generalization of this formula is used; see, for example, MurshudovpersName, 2011 ▶ ). Obviously, the behaviour of this statistic depends on the statistical properties of the structure factors. Therefore, it can be expected that properties of the model, crystal and observed data such as (i) noisy data, (ii) twinning, (iii) modulation in crystals and (iv) model errors will affect the behaviour of the R value. Luzzati (1953 ▶ ) analysed the effect of model errors on R values in the absence of any other peculiarity and came to the conclusion that R values calculated for structure factors calculated from random atoms would be around 0.58 for acentric reflections. MurshudovpersName (2011 ▶ ) carried out a similar analysis for cases of hemihedral twinning and demonstrated that R values for cases of hemihedral twinning are systematically lower than those for single crystals. Here, we analyse the effect of the procedure used to estimate the amplitude | F | from the measured intensity I when data are very noisy. Since weak intensities may be measured as negative, while the true amplitude | F | cannot be negative, | F | is generally estimated using the TRUNCATE procedure (French & Wilson, 1978 ▶ ). Under the assumption that true structure factors come from a crystal filled with atoms randomly distributed over the unit cell and the noise in the experimental intensities has a normal distribution, the TRUNCATE procedure estimates the amplitudes of structure factors using a Bayesian estimation with the formula where P ( J ; I o , crystal) is the conditional distribution of ideal intensities of structure factors ( J ) when observed intensities ( I o ) are known and it is known that the data came from a crystal. Noting that | F | = J 1/2 , and using the explicit form of P ( J ; I o , crystal), the conditional distribution for | F | can be written where ∊Σ = E (| F | 2 ), the expected value of | F | 2 , is estimated using the data in the resolution binsterm, I o is the experimental observed intensity and σ is its standard deviation. Thus, the expected values of the amplitudes of structure factors are estimated using the formula Although this formulation has served the community well over the years, it has certain problems. These problems include the following. (i) It is assumed that Σ is a smooth function of resolutionterm, which breaks down in the presence of pseudo-translation, DNA/RNA helices etc. (ii) It is assumed that the data are from single crystals. In cases of twinning the formulation may not work, although if the twinning fraction is known and there is no noncrystallographic rotation parallel to the twin operators then it is straightforward to account for twinning. However, in general not all properties of the crystal/data are known or possible to model. (iii) It is assumed that the observed data have a normal distribution. This assumption may break down, especially for weak reflections where profiles of neighbourhood spots are used for integration.
When the data are very noisy ( i.e. the standard deviation of the observation becomes very large) this procedure produces the expected value of Wilson’s distribution (Wilson, 1949 ▶ ), Thus, in the limiting case if all estimation of parameters proceeds smoothly and there are no crystal-growth peculiarities, then the TRUNCATE procedure would give the expected value of the Wilson distribution. It is interesting to analyse the crystallographic R values for these cases. Let us assume that the R value is calculated in the resolution binsterm where Σ was estimated. Then, in the limiting case of noisy data the R value would have the following form (here, we assume that reciprocal-space points are sufficiently dense and the summation can be replaced by the integration), Now if we use the fact that the distribution of | F c | is the same as the distribution of | F |, that is the Wilson distribution, and denote μ = E (| F |) = E (| F c |), then after some manipulation of integrals we can derive where erfc is the complementary error function, Thus, we see that if structure factors are replaced by the expected value of the Wilson distribution then it can be expected that the calculated R values will be around 0.42. This is exactly what happens with observed values from the TRUNCATE procedure when errors in the experimental intensities become very large. It should be noted that this behaviour of R values is a property of data from single crystals with no other peculiarities.
Note that for perfect hemihedral twinning If the perfect twinning assumption is used in the TRUNCATE procedure then for very noisy data we can obtain A2. Generation of random intensities from Gaussian χ 2 distribution Under the assumption that the ‘true’ structure factors came from the population with a Wilson distribution and experimental intensities have a normal distribution with mean value equal to the ‘true’ intensities and with experimental uncertainties equal to σ, the distribution of observed intensities can be written To use this formula for random intensity generation it is necessary to estimate the unknown parameters (Σ). If we want to generate ‘data’ beyond the resolutionterm of the observed data we need to parameterize Σ as a smooth function of resolutionterm. We use the parameterization where k is the overall scale, B is the overall isotropic temperature factor, f ( s ) is the empirical intensity curve designed by Popov & Bourenkov (2003 ▶ ), s is a reciprocal-space vector, | s | is the length of the reciprocal-space vector and U is the overall anisotropic U value with properties where tr is the trace, R sym is the rotation part of a symmetry operator (here, we use the orthogonal version of the symmetry operators) and the superscript T denotes the transpose of the operator. The second condition in (22 ) is for all symmetry operators of the crystal. Since (21 ) is a continuous function of Σ, it can be used for any resolutionterm including resolutionsterm beyond the observed resolutionterm.
The procedure for estimation of parameters and generation of random intensities is as follows. (i) Using E ( I o ) = ∊Σ, var( I o ) = (∊Σ) 2 , build a Gaussian approximation for the distribution of the observed intensities and estimate parameters of Σ as defined by (21 ).
(ii) Using the distribution (20 ), build the likelihood function and improve the estimation of the parameters of Σ using maximum-likelihood estimation.
(iii) Generate expected values of the amplitudes of structure factors for reflections within defined resolutionterm using the formula E (| F |) = (π∊Σ) 1/2 /2.
(iv) Generate random intensity from the population defined by the distribution (20 ). For this, a two-stage procedure is used: ( a ) generate a random number from the exponential distribution with mean ∊Σ and denote it I exp and ( b ) generate a random number from the normal distribution with mean I exp and standard deviation σ. Σ is extrapolated to the given resolutionterm and σ is taken from the observed data or from the defined signal-to-noise ratioterm.
(v) Generate random numbers from the population with Wilson distribution with the parameter ∊Σ.