 1. Introduction
 2. Previous approaches
 3. Derivation
 4. Pixelwise diffraction pattern prediction
 5. Merging using integrated peak intensities
 6. Discussion and conclusion
 A1. Peak shape on the detector
 B1. Maximum flux of a virtual reflection in the range (h±½, k±½, l±½)
 B2. One frame in a rotation series
 References
 1. Introduction
 2. Previous approaches
 3. Derivation
 4. Pixelwise diffraction pattern prediction
 5. Merging using integrated peak intensities
 6. Discussion and conclusion
 A1. Peak shape on the detector
 B1. Maximum flux of a virtual reflection in the range (h±½, k±½, l±½)
 B2. One frame in a rotation series
 References
research papers
Crystal diffraction prediction and partiality estimation using Gaussian basis functions
^{a}Center for FreeElectron Laser Science CFEL, Deutsches ElektronenSynchrotron DESY, Notkestrasse 85, 22607 Hamburg, Germany, ^{b}Department of Physics, Universität Hamburg, Luruper Chaussee 149, 22761 Hamburg, Germany, and ^{c}The Hamburg Centre for Ultrafast Imaging, Luruper Chaussee 149, 22761 Hamburg, Germany
^{*}Correspondence email: wolfgang.brehm@desy.de, henry.chapman@cfel.de
The recent diversification of macromolecular crystallographic experiments including the use of pink beams, convergent electron diffraction and serial snapshot crystallography has shown the limitations of using the
for diffraction prediction. This article gives a computationally efficient way of calculating approximate crystal diffraction patterns given varying distributions of the incoming beam, crystal shapes and other potentially hidden parameters. This approach models each pixel of a diffraction pattern and improves data processing of integrated peak intensities by enabling the correction of partially recorded reflections. The fundamental idea is to express the distributions as weighted sums of Gaussian functions. The approach is demonstrated on serial femtosecond crystallography data sets, showing a significant decrease in the required number of patterns to refine a structure to a given error.1. Introduction
Macromolecular crystallography is most commonly performed using a monochromatic Xray or electron source and with at most a few crystals. In conventional rotation measurements each crystal is rotated, exposing it to the beam over a range of about 180°, integrating the diffraction over small angular wedges. Under those circumstances the
have been sufficient approximations for the diffraction condition. They stipulate that the differences between the wavevector of the diffracted beam and the wavevector of the incident beam are integer linear combinations of the reciprocal unitcell vectors , and :Given the unitcell parameters, initial crystal orientation and experimental geometry, the equation can be rearranged to give the crystal orientation and the point on the detector where a given reflection can be observed most intensely. Conversely, for a random orientation of the crystal, the probability of any reflection (except the direct beam) being in its optimal diffraction condition is zero because the integer indices on the right side of equation (1) are an infinitesimal subset of the attainable rational vectors on the left side. Experimentally however, there is a neighbourhood close to the ideal diffraction condition where diffraction can be observed at reduced intensity even though the are not satisfied. Not knowing which reflections will be observable for a given orientation, and how intensely, is known as the partiality problem. Several definitions of partiality are conceivable. In the following the partiality of an observation will be the ratio between the measured intensity and the maximally attainable intensity for a given crystal and beam but changing the orientation of the crystal. This paper introduces a way to estimate that neighbourhood and the reduction in intensity, thereby addressing the partiality problem computationally.
Exposing the crystal to the radiation during rotation and recording images over small angular wedges solves this problem too, which is why the rotation method was adopted in the first place. The rotation ensures that almost all reflections within the observable resolution range of the diffractometer will reach their optimum at some point during the rotation and can be fully recorded. The process of calculating any or all aspects of diffraction patterns (peak position, shape, intensity or full diffraction patterns), given unitcell parameters and experimental geometry, is called `prediction' in the context of macromolecular crystallography data processing. For monochromatic rotational crystallography the deviations between measured and predicted peak positions are usually small, except for reflections whose reflection condition is not affected significantly by the rotation. (Those few measurements are typically discarded.) The rotation of the crystal during the exposure about a known axis and with a known angular increment acts as a strong constraint for parameter estimation during the processing of rotational crystallographic data. Using this information, the intensity of a reflection can be integrated and corrected to yield the corresponding squared structurefactor amplitude.
In the last decades in macromolecular crystallography, methods have been employed, which, for various reasons, deviate from the rotational crystallography setup in significant ways. The most notable among these methods is serial crystallography, where crystals are recorded once each and consequently many crystals are needed for a complete data set (Schlichting, 2015; Spence, 2017). An important subclass is serial snapshot crystallography, where the crystals are illuminated without rotation. Without the rotation it becomes indispensable to consider not just the ideal diffraction condition, but the partial intensity that can be observed when close enough to the ideal diffraction condition.
We know there is a steep falloff of intensity with deviation from the exact condition in a monochromatic experiment with well ordered crystals. This steep falloff makes it easy to define a small range that contains almost all observations of the same et al., 2011). However, for the Monte Carlo integration to converge to an average with a small standard deviation, each reflection needs to be measured multiple times. This approach assumes that the partialities follow the same distribution, with finite first and second moments, for all reflections of a given resolution shell. From this assumption it follows that the average converges to a value proportional to the nonpartial intensity, that is the structurefactor amplitudes squared. Assuming polarization correction has been applied before averaging, no additional correction factors are needed, unless the inclusion criterion varies or fails to capture a significant portion of the intensity, and in fact no Lorentz factor is applied in practice.
and hardly any observations of anything else, even without knowing the shape of the falloff. Computing the average of these observations with unknown partiality is called Monte Carlo integration in the context of serial crystallography. It has been used to work around the problem of unknown partial intensities with great success (KirianThe development of new methods has not stopped there, however. Serial snapshot crystallography has since been carried out with polychromatic, or socalled pink beam, sources (Meents et al., 2017), electron beams (Bücker et al., 2020) and mosaic crystals. More exotic experiments are surely already planned. In these more general cases the are not sufficient, because inaccurate predictions of the peak positions and elongated peak shapes cannot necessarily be overcome by just measuring several times more data to make use of Monte Carlo integration. The assume pointlike peak shapes. In monochromatic experiments the peaks are narrow and compact, so small integration radii or boxes are typically employed, and the are sufficient. But when two or more different and equally significant distributions are at play, elongated peak shapes can be observed.
Fig. 1 depicts the distributions that are assumed to be relevant and their effect on the diffraction geometry. In polychromatic experiments the distribution of wavelengths, the width of which is called bandwidth, together with a distribution in crystal orientation, called mosaicity, can lead to elongated peak shapes. The other relevant distributions affecting the diffraction are the size and shape of the crystal (reciprocal peak size), convergence (or divergence) of the beam, and different strain throughout the crystal (which is a variation of unitcell parameters throughout the crystal volume). Once there is more than one relevant distribution, the exact location of the peak on the detector can no longer be determined solely by rearranging the This paper shows how to model diffraction efficiently in a way that generalizes to these different conditions, by first introducing an approximation for calculating full diffraction patterns and then deriving from that peak locations, shapes and estimates for their total intensity. Two applications of this model are presented in Sections 4 and 5. In Section 4 diffraction patterns are approximated in full detail, pixel by pixel. Optimizing the free parameters of the model to fit the diffraction pattern in each pixel should determine the structurefactor amplitudes in the most efficient way, in terms of diffraction data needed and achievable precision. This may provide an insight into the relatively small heterogeneity between samples, which has proven to be elusive in the presence of large data processing artifacts and measurement errors. The second application is more conventional. In Section 5 an expression for the partial intensity of a reflection in a `still' diffraction pattern (that is, one recorded from a static crystal without rotation) is derived and used to correct serial crystallographic data sets, improving the convergence rate of merging the intensity data to determine the structure factors.
2. Previous approaches
The earliest approaches to dealing with partially recorded reflections relied upon the redundancy afforded by rotation experiments, which makes them inapplicable in serial crystallography. Under those conditions the partiality as a function of the crystal rotation can be reconstructed as a smooth function, because it is overdetermined by the diffraction data. Using the reconstructed profile, the partially observed reflections can be corrected (Diamond, 1969; Grant & Gabe, 1978; Winkler et al., 1979).
An early approach in dealing with partial reflections that can be applied to single diffraction patterns (Rossmann et al., 1979) assumed reciprocal peaks to be spheres. While the diffraction process is modelled similarly to the earlier approaches with the intersection of these small spheres with the here the rocking curve is determined entirely by the intersection of the with the reciprocallattice spheres. The reduction allows us to use this model even for single diffraction patterns. Greenhough and Helliwell continued this approach and have generalized it to ellipsoidal shapes (Greenhough & Helliwell, 1982a,b; Greenhough et al., 1983). Andrews et al. (1987) showed that this approach can even be applied to Laue diffraction (with very high polychromaticity). The model of Rossmann et al. was generalized by Ginn et al. (2015) with a superGaussian distribution of Ewald spheres given by the distribution of wavelengths and incidence angles, requiring a numerical integration that is efficiently implemented in CrystFEL (White et al., 2016) as the partiality model xsphere. This model has 11 free parameters per crystal in total: nine for the unavoidable unitcell matrix and one each for the mosaicity radius and the profile radius.
Holton et al. (2014) modelled the most relevant contributions, save the crystal shape transform, based on the principles laid out by Greenhough & Helliwell (1983) and Winkler et al. (1979) (modelling mosaicity with the intersection of a disc with the Ewald sphere). They also used Gaussian basis functions, but instead of analytical integration of the different distributions, they computed numerical integrals to combine different effects with automatic sampling. No attempt to match measured diffraction data with the proposed model was described; on the contrary, the message of the publication was the `untapped potential' that should be realized if a method could be found to fit the simulation to experimental data.
The program package nXDS (Kabsch, 2014) is another software suite to process serial crystallographic data. The partiality model used assumes an isotropic Gaussian decay of the partiality with the angular offset from the ideal diffraction condition, making for simple symbolic expressions using Gaussians in 1D and a straightforward optimization of the parameters.
A different approach to computing the integrals that are required for estimating the partiality of reflections in still diffraction patterns uses raytracing principles (KroonBatenburg et al., 2015). This approach is much closer to what would be called Monte Carlo integration outside of crystallography.
An isotropic and simplified partiality model using multidimensional but isotropic Gaussian basis functions has been implemented in CrystFEL and is the default for predicting spot locations and qualitative visibility since version 0.9.0. It uses a simplified version of equation (33) below, but without squaring the exponential term. The scalar projection of the covariance matrix orthogonal to the is especially simple to calculate in this case. This model can also be used as a partiality model like xsphere and it is selected with the keyword ggpm. This model is most comparable with the one used in nXDS (Kabsch, 2014). Notable differences to that model are the formulation using the 3D Gaussian function and the concept of reciprocal peak width, which ascribes an additional constant width to peaks in independently of beam parameters and mosaicity, an effect that is especially significant at low resolution.
The Gaussianlike appearance of peaks on the detector possibly inspired Mendez et al. (2020) to impose a Gaussian decay of intensity with distance from the ideal diffraction condition on the detector. The result in equation (4) of Mendez et al. (2020) is seen to be proportional to a special case of equation (14) of this work when the covariance matrix is uniform in all dimensions and scaled appropriately. Conversely, the result presented in this paper can be seen as a multidimensional generalization of the approach of Mendez et al. (2020). The significance of this difference becomes most obvious when considering elongated peak shapes in pinkbeam experiments, which cannot be modelled by the approach of Mendez et al. (2020), owing to the isotropic nature of that model.
Dilanian et al. (2016) imposed a peak shape on the detector to fit the whole pattern in a similar manner to Mendez et al. (2020), but instead of an isotropic Gaussian shape they used an isotropic pseudoVoigt shape. PseudoVoigt functions allow more heavy tailed shapes, and are thereby able to match shape transforms better with their asymptotically inversequadratic decay. However, their derivation does not connect these peak shapes with anything but the shape transform of the crystals. Our method generalizes a similar approach to nonisotropic peak shapes and connects them to mosaicity, nonmonochromaticity, the crystal shape transform, the convergence and allows arbitrary compositions thereof. However, it is less general in the sense that only Gaussian shapes are employed. This is a deliberate limitation, because of the analytical difficulties that would be encountered with operations on anisotropic Cauchy distributions.
3. Derivation
3.1. Underlying diffraction theory
The incident wave interacts with a 3D object, which is described by its scattering potential, which in turn is mainly determined by its electron density ρ. In the Born approximation and a monochromatic incident wave with J_{0} (in units of energy per area), the density j (in units of energy density as a function of solid angle) at each point on the detector can be described as the Fourier transform of the electron density , evaluated at points corresponding to the difference between the incident wavevector and scattering wavevector , a term C correcting for polarization effects (Cowley, 1995) and the scattering as a proportionality constant.
The vectors lie on a sphere with a radius ν reciprocal to the wavelength λ. This sphere is called the and an equivalent result is known as the Fourier diffraction theorem (Slaney & Kak, 1985):
In this approximation diffraction is a linear operation, which means that the superposition principle applies to the complex wavefunction of the diffraction. The diffraction of several objects is the sum of the diffraction of these objects. The diffraction of an object by multiple sources is the sum of the diffraction of the object by each source. Depending on whether there is a fixed phase relation between the different contributions to the total diffraction, the contributions add incoherently (assuming an integration over a time interval several times the duration of the oscillation of the wave), that is as modulus squares, or coherently, which is in the complex domain, before the modulus square operation. For a derivation of the resulting average amplitudes of coherently and incoherently interacting waves see Section 1.3.2. of Cowley (1995).
3.2. Decomposition into Gaussian basis functions
Distributions of the sources and the objects are just an even further generalization of the superposition principle; combining these distributions amounts to convolutions of the distributions. However, 3D integrals of distributions over potentially curved paths do not, in general, have a closed solution. Numerical solutions are easy to determine, but compounded, derivative or derived properties (such as those required for leastsquares minimization) grow in complexity, exponentially. Once one step is numerical, the next steps will most likely have to be numerical too. It is therefore useful and more insightful to have simple closedform approximations. Gaussian distributions, as well as products and sums thereof, have closed and simple integrals when integrated over the whole domain or along a cut or a projection. Such integrals can likewise be expressed as a sum of Gaussian functions and a constant term. Also their Fourier transforms are well behaved. This way, integrating over multiple distributions still increases the complexity of the result, but starting from a less complex baseline. This means that if one can express all distributions in the model as a sum or series of Gaussian kernels, the conditional integration of the resulting distribution can be achieved symbolically. While not every distribution is suitably expressed as a weighted sum of Gaussian distributions, a large family is (Sorenson & Alspach, 1971). Many natural distributions belong to this family. And for most distributions used in the application of the method discussed here, the number of Gaussian basis functions, for sufficient approximation, is very low. The probability density function of a Gaussian distribution will be abbreviated with when convenient. All vectors are given in bold font and are column vectors unless transposed with a superscript T. The multiplication sign is omitted, except when equations are broken over more than one line, and multiplications between vectors or matrices are matrix multiplications by default.
where ϕ is the probability density function of a Gaussian distribution, x is a point in space, is the mean vector, Σ is the covariance matrix.
When the Gaussian basis functions are scaled appropriately, we refer to them as Gaussian kernels, as they are not normalized to one, like Gaussian distributions would be. This paper uses some common properties of probability distributions in general and Gaussian distributions in particular, which are summarized here. The joint probability of several uncorrelated outcomes is given by the product of their probabilities. By analogy, the probability density that satisfies all individual probability distributions is computed by a pointwise product of the individual densities. The product of Gaussian distributions is a scaled Gaussian with a mean given by the weighted arithmetic mean of the individual means and a new covariance given by the inverse of the sum of those weights:
This result can be simplified further, when both densities are identical:
The probability distribution for the sum of two independent random variables is given by the convolution of the individual distributions. The rules for combining the means and variances are equivalent to the commonly employed error propagation: the means add, just like the variances.
If the individual distributions are correlated, the means still add to form the sum, but there is an additional summand for the variance of the sum, = . In case of a correlation of 1 this reduces to .
The identities of equations (4) and (5) can be used to compose the expected in a particular diffraction direction from the individual contributions of the source and of the object (see Fig. 1). As mentioned above, the formulation of this composition depends on whether the distributions are assumed to be in a fixed phase relation (coherent), or to have a randomly varying and uncorrelated phase shift (incoherent).
The following two identities, each first expressed using exponential functions and then in terms of ϕ, are at the core of the method for analytical integration used in this work. The first is the integral of the product of two Gaussian densities, which is then squared (for coherent integration):
For incoherent integration the integration and squaring operations are reversed:
In equations (7) and (8) we have used the definitions:
As can be seen from the above expressions, the difference between coherent and incoherent integration amounts to only a difference in scaling when both of the two distributions are single Gaussian distributions (that is, not sums of several Gaussians). As a simplification and because the linear scaling factor is hardly of any consequence, incoherent integration will be the default in the following, but the procedure can be applied with minor modifications for coherent integration as well. Partial coherence can be dealt with by splitting the coherent and the incoherent components into separate Gaussian functions and propagating them appropriately, or by interpolating between the coherent and the incoherent solutions based on the degree of coherence, but this will not be considered any further in this work.
3.3. Parametrization of the basis functions
3.3.1. The illumination
The diffraction condition, indicating the spatial frequencies of the object that contribute to the diffraction pattern and which is given by equation (2), forms a spherical shell that passes through the origin, which we have referred to above as the If the incident beam is convergent or divergent, there is a distribution of incoming directions, leading to a nest of spherical shells of equal radius in whose centres lie on a spherical cap such that they all intersect at the origin. The normal at the centre of this cap is parallel to the mean beam direction (see Fig. 2). The covariance matrix of due to convergence or divergence alone cannot really be simplified in general, but if the distribution is isotropic, it can be written as
where is the standard deviation of the incidence angles (i.e. the convergence), I is the identity matrix and vectors are unit vectors describing beam directions, derived from the wavevectors :
Each beam direction, in theory, would need its own polarization correction, and this could be achieved by integrating the polarization correction term for all the beam directions, but as small angles are assumed, the polarization correction of the main beam direction is deemed sufficient for all.
If there are multiple sources with different wavelengths, i.e. if the wavelength distribution has a finite bandwidth, the Ewald spheres have different radii and consequently the distribution of sphere centres, previously on a spherical cap, is broadened radially. The 3D distribution of sphere centres is approximated as a sum of Gaussian kernels. If the angular distribution is assumed to be small and independent of the distribution of wavelengths, it can be calculated by convolving the angle and wavelength distributions to form a cumulative distribution. The convolution of Gaussian kernels amounts to a summation of the respective covariance matrices [see equation (6)].
The distribution of that samples the Fourier transform of the object in equation (2) and contributes to diffraction in a given direction, i.e. a point on the detector, can be derived from the distribution of sphere centres. The distribution of will be approximated as a Gaussian distribution with mean and covariance matrix . Since the diffraction process does not change the wavelength, the outgoing wave distribution is perfectly correlated in wavelength with the corresponding incoming wave distribution. Differences of fully correlated Gaussian distributions require taking the difference of the square root of the respective covariance matrices. Given and are approximated as Gaussian distributions, is distributed as a Gaussian around the mean value corresponding to the difference between the mean of and . The covariance matrix of the distribution of can be computed as the correlated difference between the distribution of with covariance matrix and the distribution of with covariance matrix in that particular direction:
The distribution of with the covariance matrix = is not affected by divergence and only contains the wavelength distribution along , and where is the bandwidth. The distribution of is affected by both the wavelength distribution and the angular distribution of incident beams, possibly correlated. In the slightly less general case, where it is assumed that the angular distribution of the incident beam is isotropic and is not correlated to its wavelength, the distribution of entirely due to polychromaticity is
Combining this equation with equation (9) gives a way to estimate under simplified conditions:
If we cannot assume that wavelength and incident angle are uncorrelated, can be treated as a free parameter instead, and can be derived by rotating the component of that is due to polychromaticity and therefore in line with the incidentbeam direction to each . The distribution of given is therefore
where rotate is the rotation matrix of the rotation around the axis orthogonal to and , that would align to . Then is given by equation (10).
3.3.2. The crystal
Due to its periodicity, the Fourier transform of a crystal is concentrated in peaks. As discussed above, these peaks are broadened by properties of the crystal, such as the finite width of the crystal, mosaicity and strain. Here we define the separate effects that are modelled.
Mosaicity is commonly used to describe a rotational disorder of the crystal and can be seen as a distribution of orientations of the Rotational disorder of an object in 3D will have six in general: rotational disorder around three orthogonal axes and three covariance terms between them.
Strain is the distribution of contractions of unit cells. Generally, for each realspace lattice point in 3D, there can be a different distribution of displacements in the direction of the origin and transverse to it. In general, this is a 3D tensor. In the following we will assume that the changes of the structure factors due to strain are negligible.
Mosaicity and strain taken together, considering correlations of the effects in 3D, require a higherdimensional tensor that maps each point of ) will however be applicable with and without this simplification.
to a crosscorrelation matrix. In the following, however, mosaicity and strain will be taken as uncorrelated and mosaicity will be assumed to be isotropic. This means that mosaicity is assumed to be equal in all angular directions and mutually independent of crystal strain. The integration in the following subsection (Section 3.4Reciprocal peak shape is the parameter that describes the distribution of each lattice point in possibly due to the transform of the shape of a finite crystal, before being broadened by the effects of mosaicity and strain. In general this is a free parameter, but e.g. if the shape transform is (the Fourier transform of a cube), it could be approximated by a Gaussian distribution with covariance . Because of the approximately quadratic decay in the observed diffraction, as opposed to the of the Gaussian, shape transforms are not approximated by sums of Gaussian functions efficiently. Therefore, if the reciprocal peak shape is the predominant effect that is broadening the diffraction condition, the approximate nature of the proposed model becomes most obvious. The strength of the proposed method is the ability to combine different effects analytically, where the convolved distributions naturally become smoother.
Integer multiples of the reciprocal unitcell matrix R span the locations of the peaks in the Fourier transform of the crystal:
The density around is approximated to be a Gaussian distribution with the covariance matrix . The cumulative distribution results from the convolution of the individual distributions. Its covariance is therefore the sum of the covariance matrix describing the shape transform, the effect of isotropic mosaicity , and the effect of uncorrelated strain . Here quantifies the mosaicity as the standard deviation of rotational disorder, and quantifies the strain as the standard deviation of the relative unitcell size variation.
3.4. Evaluation of integrals
Given the distributions defined in Sections 3.3.1 and 3.3.2, we are now in a position to compute the diffracted in a given direction . This is done by evaluating particular integrals for each pair of Gaussian basis functions of the distributions, as given below.
Polarization and scaling terms were left out at this point for clarity, because they are not affected by the integration. If at least one of the distributions is assumed to have random or chaotic phases, the integration is incoherent, so using equation (8) and the definition of ϕ in equation (3) we get the following result:
If all contributions to the diffraction described by the two distributions have a constant phase relation, the integration is coherent:
where
The result of equation (15) is applied below in Section 4 to compute a diffraction pattern that matches the observed pattern. This requires the appropriate scaling and polarization correction. All in all there are 17 parameters describing each Gaussian kernel of the crystal (nine for the six for the shape transform and one each for mosaicity and strain) and nine describing each Gaussian kernel in the source (three parameters for the direction and six for a possibly correlated distribution of illumination angles and wavelengths). The source will typically not change for many crystals in a serial crystallography experiment and one Gaussian kernel will give enough to describe the diffraction of each crystal.
4. Pixelwise diffraction pattern prediction
The first way our approach can be used to process data is to model each pixel of a diffraction pattern, making use of as many constraints as possible in determining the hidden parameters and the structurefactor amplitudes. A still diffraction pattern can be calculated using the result of equation (15) for each point on the detector, by applying a polarization correction C and scaling with the intensity of the incoming beam and with the respective structurefactor modulus square of each reflection:
where J_{0} is the incidentbeam p the degree of polarization, n the normal to the polarization plane and F the The measured in a pixel is the integral over all directions that fall into the solid angle of that pixel summed up for all with significant excitation. If the predicted was constant over this area, the integral would be just proportional to the solid angle that the pixel occupies.
The detector is assumed to be composed of rigid panels. Each panel has its own 2D coordinate system consisting of the dimensions fs and ss defined in terms of the memory order, where fs (short for fast scan) is the dimension of values stored consecutively and ss (short for slow scan) is the dimension that is not. Each panel has a local coordinate system given by a 3 × 2 matrix D for the two dimensions in the plane of the panel and an offset vector o for the absolute position in space of the corner corresponding to the origin of the coordinate system of this panel. The solid angle of a pixel can be approximated using the derivative of the normed directionality vector with respect to the detector coordinates:
where is the direction in which diffraction is to be predicted, D is the matrix translating between panel coordinates and spatial coordinates, o represents spatial coordinates of the reciprocalspace origin in detector coordinates, are the coordinates of the pixel on the detector.
For the following two derivations it will be useful to know the derivative of the direction with respect to its two coordinates in the detector panel's coordinate system:
The solid angle Ω is approximated by the length of the cross product of the pixel sides projected onto the unit sphere:
(Note that everywhere else besides in this equation the symbol × denotes a multiplication.) However, the predicted peaks can be very narrow, and therefore the predicted ) with a covariance matrix corresponding to ½ the extent of a pixel, or for greater accuracy, by oversampling the pixel and applying the same procedure to the subpixels. Simply put, this smooths the prediction to a level where sampling it discretely only introduces minor artifacts, the main effect being a slightly reduced contrast. The constant ½, of the aforementioned pixel extent, minimizes the maximum Kullback–Leibler divergence (Kullback & Leibler, 1951) between the desired proper integral (b) involving the error function and the estimate (c).
can vary substantially within a single pixel. To enable an efficient integration over the area, the predicted can be smoothed analytically without changing the total of the whole diffraction pattern. This is achieved by introducing a Gaussian point spread function for the detector (the blue arrows in Fig. 1Equation (23) shows a proof in one dimension, that can be generalized to higher dimensions for all shapes for which an orthogonalizing coordinate transform can be found. It is natural to assume that the same constant approximately minimizes this difference even when the sides are not strictly parallel. The is an asymmetric measure for the difference of probability distributions taking into account that underestimating a probability is more detrimental than overestimating it. It was chosen because the predicted is a scaled probability density.
where P is the precise probability distribution, Q the approximation, μ the mean value, σ the standard deviation from the mean, σ_{+} the constant to be solved for. Using the results in equations (23) and (21) the resulting covariance matrix of the smoothing function is
We now have a way of modelling the ν, which is proportional to the impinging photon energy.
of each pixel. This is good enough for monochromatic experiments, but to model polychromatic experiments we need to take into account that detector response signals of integrating detectors are proportional to the total photon energy impinging on the detector. Integrating detectors are commonly chosen over counting detectors for SX (serial crystallography) experiments as they are not limited to measuring one photon per pixel at a time. The following derivation uses wavenumberThe average wavenumber of the polychromatic diffracted beam at the particular location of a given pixel can be estimated from the mean point of the joint distribution of the source and the peak of the crystal in ]. This is achieved by rescaling the component collinear to the incident beam. We are only interested in the collinear component because the deviation of in any other direction is not due to the wavelength distribution but due to other factors like convergence. The rescaling is necessary, because the correlated difference between and , which necessarily have equal wavelengths, leads to a covariance matrix of that appears sheared with respect to the covariance of and compressed along the beam direction. A geometric visualization is offered with Fig. 3 in lieu of a mathematical proof. The cosine of the angle of diffraction equals the scalar product between the normalized incoming and outgoing wavevectors, leading to the following expression:
[compare equation (4)Having a distribution of photons of different wavelengths does not change the Poisson by projecting to the incoming beam and rescaling. This is analogous to the expected wavenumber in equation (25).
statistic, but it leads to an additional variance in the measured intensity proportional to the width of this distribution, because each photon measured can have a different energy. The width of the wavenumber distribution in each pixel can be estimated from the shape of the product of the two Gaussians in equation (14)From the expected g describing the detector response as detector counts per wavenumber, the expected detector reading for a given pixel is given as the product
the expected wavelength and the constantTo model the α and β) error model to predict the total variance:
statistic, whose variance scales with the expected photon count, and all degrees of systematic errors, of which the variance is assumed to scale quadratically with the predicted we employ the following twoparameter (This error model is essentially equivalent to equation (3) of Diederichs (2010).
To connect the prediction with the measured data y we introduce a probability distribution described by the density function f(y), which enables a optimization. The probability distribution is a mixed distribution of a smoothed Gaussian that approximates a discrete Gaussian with the additional variance 1 / 2^{2} using the result in equation (23) and a superheavytailed outlier distribution u(y) that models even extreme outliers like defective pixels:
u(y) is a smoother version of Rissanen's universal prior for integers (Rissanen, 1983), ε is the outlier probability.
Crystal diffraction is sparse and most pixels will not see significant diffraction. The pixels with significant diffraction can be estimated conservatively by finding the potentially excited indices using a region growing algorithm (see Appendix B) and then projecting the peak shape onto the detector [using equation (41)]. This accelerates the prediction greatly while not affecting the result in any significant way. Because derivatives can be computed analytically, the predicted diffraction pattern can be optimized using pseudoNewton optimization methods like BFGS (Broyden, 1970; Fletcher, 1970; Goldfarb, 1970; Schanno, 1970) or gradient descent. In theory, this should make the optimization straightforward and efficient, but the target function has many local minima and plateaus.
Together with the associated computational cost, this is the reason why pixelwise and 5. Table 1 lists the parameters that were optimized.
of the Gaussian sum model proposed in this paper so far has only been applied to individual diffraction patterns and not full data sets. This method also depends on a pixelwise background estimate and a detector geometry that is determined well enough, such that predicted pixels coincide mostly with measured pixels. This demands the computation of about 8 kpx for a 4 Mpx detector. This makes it computationally expensive, requiring on the order of 10 singlecore computing hours per pattern (4 GHz AMD A12). Therefore, this method has not yet connected with structure directly, but is used to show visually that different diffraction patterns can be predicted accurately. Examples of successful pixelwise diffraction pattern prediction after parameter optimization can be found in Figs. 4

5. Merging using integrated peak intensities
This section describes the second application of the model presented in Section 3: merge Gaussian partiality corrected integrated intensities (MGPCII). First we derive an expression for the total intensity of a reflection in a still diffraction pattern and then we describe a method of how to use this expression to reduce the detrimental impact of partially recorded reflections on the estimates of structure factors.
5.1. An expression for integated peak intensities
The total photon energy of one reflection can be computed by integrating the result of equation (15) over all directions. This integral can be approximated when considering that the angular extent of a reflection on the detector is small and the curvature as well as the change in width of the is negligible for the integral over a single reflection. The density of the distribution of Ewald spheres can therefore be approximated as a planar (Winkler et al., 1979) Gaussian, decaying along the direction of diffraction, but constant orthogonal to it. First the double integral is restated using equation (14). Then the integral along all possible outgoing wave directions is approximated with a projection onto the outgoing wave direction with the highest intensity , which can be found by function optimization:
where , d is the width of the at the projection point. The of each reflection in each pattern is estimated as the product of the result of equation (33) with the incident J_{0}, the structurefactor amplitude squared, a linear scaling factor a, a Bfactor correction term modelling a Gaussian decay of intensities due to random atomic displacements, and a term for the polarization correction [equation (19)]. This leads to an expression analogous to equation (18), but with an explicit linear and Bfactor scaling instead of implicitly assigning those as terms in the structure factors:
The calculation of the mean wavenumber is analogous to equation (25):
The width of the predicted wavenumber distribution is analogous to equation (26):
The expected detector count for each reflection is the product of wavenumber, . Its variance is estimated with the same twoparameter error model as for the pixelwise prediction in equation (28).
and a detector constant, as in equation (27)5.2. Parameter optimization for merging
The purpose of merging is to produce accurate estimates of the scattering intensities, proportional to the modulus squares of the structure factors, from a set of observed integrated peak intensities. To that end, to make use of equation (33), its free parameters need to be determined. The scattering intensities are among the parameters to be determined; the other parameters are listed in Table 2. To find the parameters we have chosen a approach because it can be more robust than least squares, but it is still relatively easy to optimize. The probability distribution to be optimized for each observation is f(y). Probabilities are assumed to follow a mixed distribution of a Gaussian distribution and an outlier distribution o(y). The outlier distribution should be chosen so as to best describe all measured intensities in general, without prediction or scaling. In many cases, a Cauchy distribution is a good choice because it fits the shape of the distribution of integrated intensities well for frequently observed values and has an inverse quadratic decay like the positive intensities. The exact shape of the outlier distribution is less relevant; its most important feature is a slow asymptotic decay to make the approach robust.
where o is outlier distribution, ε is outlier probability (1/16), γ is the scale parameter of the Cauchy distribution and y_{0} is 0.

5.3. Tests on experimental data
To show that equation (33) can be used to correct partially recorded reflections to improve the data quality, two serial femtosecond crystallography data sets were chosen. Data set 1 is a calibration data set of granulin microcrystals. This data set has not previously been published and was measured in October 2020 at the SPB beamline of the European XFEL in preparation for bacterial insecticide crystals, by a team led by Dominik Oberthür and Colin Berry. It has been deposited in the CXIDB with the ID 203. Data set 2 (Nass, 2020) allows SAD (singlewavelength anomalous diffraction) phasing.
The diffraction patterns of both data sets were indexed and integrated using indexamajig of CrystFEL 0.9.1. To get a baseline for comparison with our method, the integrated intensities were merged with partialator 0.9.1 and partialator 0.8.0 using the partiality models ggpm, xsphere and unity, and the merged intensities were chosen that produced the best structure results. The data sets were processed once with and once without overprediction, which is also integrating peaks further away from the diffraction condition, via the commandline option  overpredict. The effect of overprediction is shown for the first data set in Fig. 6 and, as can be seen, the additional reflections are mostly of low intensity. Overprediction was not helpful when merging using partialator in any of the combinations of options that were tested. Therefore, overprediction is not enabled in the data points used as a comparison with the new method. However, it consistently led to better structure results when correcting partialities using the generalized Gaussian diffraction model and parameter optimization during merging. This is why overprediction is enabled for that method.
The method described in Section 5.2 was applied to both data sets and the quality of the intensities was compared with the partialator baseline. In addition, data set 1 was investigated in more detail, with regards to overfitting, to the correlation of prediction and measurement and the distribution of estimated partialities, while the second data set was used to test how much SAD phasing could be improved.
After optimization of the scaling parameters (in Table 2) for data set 1, the correlation between prediction and measurement is high (Fig. 7), but the relative error between prediction and measurement still is about 25% and much larger than the error.
The comparison of predicted and measured partialities in Figs. 8 and 9 shows a strong correlation, which is exploited when correcting the measurements using the partiality estimate. Unknown partialities increase the variance of the intensities before merging and therefore of the merged intensities too. The variance can be reduced by partiality correction.
As would be expected for the smoothed distribution of the function values of a Gaussian function with uniform input (for a derivation of the distribution before smoothing see Appendix D), the histogram of the measured partialities (Fig. 10) has an optimum at 0, corresponding to a reflection that was not observable (most reflections in a given crystal orientation are not observable), and also a very faint optimum at 1. The optimum at 1 corresponds to the flat top of the intensity curve of an observation near its maximum intensity.
To test the amount of overfitting, data set 1 was split randomly in two halves. The first half was used to optimize the parameters of the scaling and partiality model in Table 2 and the second half was used to test the correspondence of prediction and measurement. The median correlation of 256 random prediction–measurement pairs (to increase the robustness of the correlation, as there are outliers that skew the correlation to 0, −1 or 1 randomly) decreased from 0.59 to 0.56; the reduction in correlation can be observed by comparing Fig. 11 with Fig. 12. This is evidence of some degree of overfitting, but also means that even half the number of peaks is sufficient to arrive at roughly the same prediction. So even though the method of partiality correction of integrated intensities would likely profit from additional constraints (among the constraints that were left unused are the peak positions on the detector and the fact that the different unitcell matrices are mainly just different rotations of each other), it still reduced the number of diffraction patterns necessary to achieve a given data quality by about a factor of 2. R factors after automatic (Fig. 13) were consistently lower for MGPCII than for partialator.
Data set 2 is of the adenosine receptor A_{2A}, measured at LCLS (Linac Coherent Light Source) using a wavelength of 2.7 Å (Nass, 2020). The protein contains 22 sulphur atoms and the wavelength is close enough to the to make SAD phasing possible. This makes this data set suitable to see to what extent partiality correction would improve phasing success. For all merged intensity files a SAD phasing attempt was run using phenix.autosol (Liebschner et al., 2019) and the known protein sequence and a resolution cutoff of 2.3 Å.
As can be seen from the hybrid and the R factors that the automatic structure building and achieved (Fig. 15), the improved merging efficiency is reproduced for the anomalous signal too.
search (HySS) in Fig. 146. Discussion and conclusion
Using Gaussian basis functions, approximations were developed that have enough R factor by about a factor of 2 compared with CrystFEL's partialator. In the second example SSAD phasing succeeded with about a quarter of the diffraction patterns. The range of data sets that were tested is not comprehensive, however, and partialator is not the only alternative, nor necessarily the best program, just the most commonly used.
to describe most of the significant effects in macromolecular crystallographic experiments. These approximations were used to simulate diffraction patterns, which were visually very similar to measured diffraction patterns. Partiality estimation and postrefinement using these functions have reduced the number of measurements necessary for a given data quality in merged intensities. In the first example it reduced the number of patterns required to achieve a givenThere are many differences between our method and partialator, partiality estimation being only one of them. Without exhaustive testing we are not able to tell precisely which differences provide the greatest improvement. A significant improvement can however be attributed to the error model used, which has been shown to improve merging on its own using a different approach (Brewster et al., 2019). Another important difference is that our method profits strongly from overprediction, adding many measurements with mostly insignificant intensities, by integrating reflections even if they are further removed from the ideal diffraction condition. It may seem that overprediction should not improve the precision of the merged result as strongly as it does, especially when the added intensities are mostly small or negative. However, we find that the small intensity values outside the diffraction condition act as a powerful constraint for determining reciprocal peak shape, mosaicity and strain.
Even though polychromatic diffraction of mosaic crystals can be described qualitatively, automatic diffBragg (Mendez et al., 2020), should lead to even better merging efficiency and a more precise detector geometry at the cost of more computation time. The model could also be used to predict the intensity of peaks per frame in a rotation series and therefore simplify the visual examination of the effectiveness of data processing, especially for peaks lying along the axis of rotation.
has proven to be difficult so far because predicted peak positions can vary by more than half the interBragg distances. There are many more applications for approximating diffraction with Gaussian basis functions in the way we described that remain to be explored. Pixelwise refinements, as done in the programIntegrated peak intensities are less demanding for numerical optimization than pixelwise intensities because there are many pixels per reflection. Furthermore, because peak intensities are integrated over a larger pixel area on the detector, the geometry description only needs to be accurate enough for most of the peak intensity to fall within the integration area. A consequence of integration is the drastic reduction of the number of constraints. Whereas pixelwise optimization uses thousands of pixels, albeit with somewhat degenerate information (in a single Gaussian approximation each peak on the detector can be described with six variables: height, x and y coordinates of the centre, major and minor axis and orientation of the elliptical shape; oversampling the shape does not add constraints in this approximation), the number of constraints in a traditional cell parameter and orientation during merging of serial crystallographic data sets is just high enough to be clearly overdefined. This might mean that for data sets of very weakly diffracting crystals and without additional constraints a pixelwise is the only option.
Lastly we want to emphasize the generality of this model. The same model can be used to simulate diffraction patterns and integrated intensities of serial monochromatic and polychromatic crystallography experiments. The analytical nature of this model makes analytical derivatives available, which is useful for mathematical optimization. It also makes deriving properties like peak locations and shapes and integrals over angular ranges and areas practical. Together this opens up a wide range of experiments where this model can be applied.
APPENDIX A
Derivatives and derived properties
A1. Peak shape on the detector
Looking at the predicted intensity as a function of the position on the detector, and assuming that the peak intensity falls into a small angular range (<10°) where the covariance matrices can be approximated as locally constant with good accuracy, an approximation of the peak shape on the detector can be derived by factoring out the (approximately) constant terms from the exponential. For straightforward computation and best approximation, the direction with the highest intensity should be determined; this can be achieved with any function optimization algorithm. Newton's method is equivalent to iteratively completing the square for the exponential term and, because the target function can be made very nearly quadratic by taking the logarithm, it converges very quickly. The detector coordinate system is commonly given by a 2by3 transformation matrix D and an offset vector o. The outgoing wave direction is therefore given by the normed position vector:
The point denotes the peak position on the detector, i.e. the position of maximum Using the normed directionality vector can be approximated to first order as
Equation (14) for the on the detector can be expressed as a scaled Gaussian (or a sum thereof), and using the linearized expression for the directionality vector the intensity on the detector can be expressed as
with c the proportionality constant.
The scaled Gaussian, which only appears to be 3D, can be rearranged to show the 2D form using suitable substitutions:
if the outgoing wave vector was optimal,
The peak on the detector can therefore be approximated by a scaled 2D Gaussian (or several), potentially broadened by the point spread function of the detector. The shape (without broadening) is given by the 2D covariance matrix .
APPENDIX B
Asymptotically optimal prediction of a diffraction image in areas with
above thresholdThe naive approach to calculating a diffraction image of a snapshot would be to compute the multiplication of the source with the object and the convolution with the Green's function via the FFT (fast Fourier transform). This holds in general in kinetic farfield approximation even for noncrystals. For a crystal the Fourier transform is sparse and this is usually exploited by iterating over the O(N_{h}N_{k}N_{l}) where N is the number of indices to be considered in each direction. Because the essentially is 2D we can come up with a solution to compute this in O(N^{2}) by using a region growing approach. Every reflection that exceeds a threshold has at least one neighbouring which has a virtual reflection at most as far as half the interBragg distance that would exceed the threshold. Fig. 16 pictures a curve with some width going through a mesh. The curve intersects only some nodes of the mesh, but for every node that it does there is at least one face (or enclosed volume for higher dimensions) that it intersects. The path of the curve can be traced by testing neighbouring faces (or volumes) for intersection iteratively.
The computational complexity isTo implement the set operations efficiently and to actually achieve O(N^{2}) asymptotic complexity, the hash table patchmap (Brehm, 2019) was used, but most other data structures with amortized constant lookups and insertions would do as well because the limiting step is checking the overlap in step 4.
B1. Maximum of a virtual reflection in the range (h±½, k±½, l±½)
The maximum (h,k,l) than any other can be conservatively estimated by taking the reflection at (h,k,l), and convolving its location with a width equal to one unit of (h,k,l) in while not changing the normalization of equation (33). This distance corresponds to a covariance matrix equal to half the reciprocal times half the reciprocal transposed – note the similarity to the result in equation (23). The approximation is not sensitive to the assumed direction of maximum diffraction intensity , a rough estimate is sufficient. For compactness the term will be combined as :
of any virtual reflection with fractional coordinates closer to a givenB2. One frame in a rotation series
The integrated intensity in a given outgoing direction can be expressed as proportional to a Gaussian function [see equation (8)]. The intensity integrated over an oscillation range is then proportional to
where is the rotation matrix with angle α, U is the unitcell matrix (real space). It can be evaluated by first finding the index values that will be excited to a significant degree in the outgoing arc section described by the position on the detector, the axis of rotation and the oscillation range. Then the target function can be approximated by a 1D Gaussian by developing a smallangle approximation around the rotation with the highest predicted intensity and factoring out the constant terms of the 3D Gaussian. This 1D Gaussian integrated for the given range yields a difference between two error functions: is the rotation matrix that yields maximal diffraction,
A similar result is stated with equation (37) in section 3.6 of Kabsch (2014).
APPENDIX C
Pixelwise backgound estimation
Background estimation for the pixelwise diffraction prediction was done by minimizing the following function that acts similarly to a boxed median filter or a boxed mean of the middle 75%, which are both much easier to compute, but less flexible and slightly less smooth:
α was typically 1/4, u is the outlier distribution from equation (30) and y_{i} are the pixel values. The function is minimized by finding the optimal values for and . The indices enumerate the pixels and the second sum goes over all pairs of adjacent pixels. This approach is very likely overcomplicated, but it did not turn out to be a bottleneck and was good enough.
APPENDIX D
Theoretical distribution of partialities
If the intensities of reflections decline like a Gaussian function when leaving the optimal diffraction condition, and because the diffraction condition is essentially random, the distribution of partialities should look like the distribution of function values of a Gaussian distribution with uniform input. The Gaussian function, scaled to a peak height and variance of 1, is . Its inverse function, not to be confused with the inverse Gaussian distribution, is = . There is an ambiguity because g(X) is not strictly increasing or decreasing, but it is symmetric around the axis X = 0, and we can therefore restrict the analysis to the increasing branch only. The random variable X is assumed to be uniformly distributed on some region symmetric to 0 on a support . The probability density therefore is f(x)=1 / 2a and the cumulative distribution function . The cumulative distribution function of the random variable Y=g(X) is the distribution function of X applied to the inverse function of g: = = , which is . The density function is its derivative, . In the limit of a large interval this is not a proper density function any more, as the integral is divergent.
Acknowledgements
We thank Dominik Oberthür, Oleksandr Yefanov, Alke Meents, Janina Sprenger, Alexandra Tolstikova (all of DESY) for providing data, and help with data processing and structure
Open access funding enabled and organized by Projekt DEAL.Funding information
We acknowledge support from DESY (Deutsches ElektronenSynchrotron, Hamburg, Germany) (award No. 390715994), a member of the Helmholtz Association HGF, and the Cluster of Excellence `CUI: Advanced Imaging of Matter' of the Deutsche Forschungsgemeinschaft (DFG), EXC 2056.
References
Andrews, S. J., Hails, J. E., Harding, M. M. & Cruickshank, D. W. J. (1987). Acta Cryst. A43, 70–73. CrossRef CAS Web of Science IUCr Journals Google Scholar
Brehm, W. (2019). INFOCOMP J. Comput. Sci. 18, 20–25. Google Scholar
Brewster, A. S., Bhowmick, A., Bolotovsky, R., Mendez, D., Zwart, P. H. & Sauter, N. K. (2019). Acta Cryst. D75, 959–968. Web of Science CrossRef IUCr Journals Google Scholar
Broyden, C. G. (1970). IMA J. Appl. Math. 6, 76–90. CrossRef Google Scholar
Bücker, R., HoganLamarre, P., Mehrabi, P., Schulz, E. C., Bultema, L. A., Gevorkov, Y., Brehm, W., Yefanov, O., Oberthür, D., Kassier, G. H. & Dwayne Miller, R. J. (2020). Nat. Commun. 11, 996. Web of Science PubMed Google Scholar
Cowley, J. M. (1995). Diffraction Physics. Amsterdam: Elsevier Science B. V. Google Scholar
Diamond, R. (1969). Acta Cryst. A25, 43–55. CrossRef CAS IUCr Journals Web of Science Google Scholar
Diederichs, K. (2010). Acta Cryst. D66, 733–740. Web of Science CrossRef CAS IUCr Journals Google Scholar
Dilanian, R. A., Williams, S. R., Martin, A. V., Streltsov, V. A. & Quiney, H. M. (2016). IUCrJ, 3, 127–138. Web of Science CrossRef CAS PubMed IUCr Journals Google Scholar
Fletcher, R. (1970). Comput. J. 13, 317–322. CrossRef Web of Science Google Scholar
Ginn, H. M., Brewster, A. S., Hattne, J., Evans, G., Wagner, A., Grimes, J. M., Sauter, N. K., Sutton, G. & Stuart, D. I. (2015). Acta Cryst. D71, 1400–1410. Web of Science CrossRef IUCr Journals Google Scholar
Goldfarb, D. (1970). Am. Math. Soc. 24, 23. Google Scholar
Grant, D. F. & Gabe, E. J. (1978). J. Appl. Cryst. 11, 114–120. CrossRef CAS IUCr Journals Web of Science Google Scholar
Greenhough, T. J. & Helliwell, J. R. (1982a). J. Appl. Cryst. 15, 493–508. CrossRef CAS IUCr Journals Google Scholar
Greenhough, T. J. & Helliwell, J. R. (1982b). J. Appl. Cryst. 15, 338–351. CrossRef CAS IUCr Journals Google Scholar
Greenhough, T. J. & Helliwell, J. R. (1983). Prog. Biophys. Mol. Biol. 41, 67–123. CrossRef CAS PubMed Google Scholar
Greenhough, T. J., Helliwell, J. R. & Rule, S. A. (1983). J. Appl. Cryst. 16, 242–250. CrossRef CAS Web of Science IUCr Journals Google Scholar
Holton, J. M., Classen, S., Frankel, K. A. & Tainer, J. A. (2014). FEBS J. 281, 4046–4060. Web of Science CrossRef CAS PubMed Google Scholar
Kabsch, W. (2014). Acta Cryst. D70, 2204–2216. Web of Science CrossRef IUCr Journals Google Scholar
Kirian, R. A., White, T. A., Holton, J. M., Chapman, H. N., Fromme, P., Barty, A., Lomb, L., Aquila, A., Maia, F. R. N. C., Martin, A. V., Fromme, R., Wang, X., Hunter, M. S., Schmidt, K. E. & Spence, J. C. H. (2011). Acta Cryst. A67, 131–140. Web of Science CrossRef CAS IUCr Journals Google Scholar
KroonBatenburg, L. M. J., Schreurs, A. M. M., Ravelli, R. B. G. & Gros, P. (2015). Acta Cryst. D71, 1799–1811. Web of Science CrossRef IUCr Journals Google Scholar
Kullback, S. & Leibler, R. A. (1951). Ann. Math. Stat. 22, 79–86. CrossRef Web of Science Google Scholar
LCLS (2022). LCLS CXI Specifications. https://lcls.slac.stanford.edu/instruments/cxi/specifications. Google Scholar
Liebschner, D., Afonine, P. V., Baker, M. L., Bunkóczi, G., Chen, V. B., Croll, T. I., Hintze, B., Hung, L.W., Jain, S., McCoy, A. J., Moriarty, N. W., Oeffner, R. D., Poon, B. K., Prisant, M. G., Read, R. J., Richardson, J. S., Richardson, D. C., Sammito, M. D., Sobolev, O. V., Stockwell, D. H., Terwilliger, T. C., Urzhumtsev, A. G., Videau, L. L., Williams, C. J. & Adams, P. D. (2019). Acta Cryst. D75, 861–877. Web of Science CrossRef IUCr Journals Google Scholar
Liu, W., Wacker, D., Gati, C., Han, G. W., James, D., Wang, D., Nelson, G., Weierstall, U., Katritch, V., Barty, A., Zatsepin, N. A., Li, D., Messerschmidt, M., Boutet, S., Williams, G. J., Koglin, J. E., Seibert, M. M., Wang, C., Shah, S. T. A., Basu, S., Fromme, R., Kupitz, C., Rendek, K. N., Grotjohann, I., Fromme, P., Kirian, R. A., Beyerlein, K. R., White, T. A., Chapman, H. N., Caffrey, M., Spence, J. C. H., Stevens, R. C. & Cherezov, V. (2013). Science, 342, 1521–1524. Web of Science CrossRef CAS PubMed Google Scholar
Meents, A., Wiedorn, M. O., Srajer, V., Henning, R., Sarrou, I., Bergtholdt, J., Barthelmess, M., Reinke, P. Y. A., Dierksmeyer, D., Tolstikova, A., Schaible, S., Messerschmidt, M., Ogata, C. M., Kissick, D. J., Taft, M. H., Manstein, D. J., Lieske, J., Oberthuer, D., Fischetti, R. F. & Chapman, H. N. (2017). Nat. Commun. 8, 1281. Web of Science CrossRef PubMed Google Scholar
Mendez, D., Bolotovsky, R., Bhowmick, A., Brewster, A. S., Kern, J., Yano, J., Holton, J. M. & Sauter, N. K. (2020). IUCrJ, 7, 1151–1167. Web of Science CrossRef CAS PubMed IUCr Journals Google Scholar
Nass, K. (2020). Advances in longwavelength native phasing at Xray freeelectron lasers. https://www.osti.gov/servlets/purl/1650020/. Google Scholar
Pazy, Y., Kulik, T., Bayer, E. A., Wilchek, M. & Livnah, O. (2002). J. Biol. Chem. 277, 30892–30900. Web of Science CrossRef PubMed CAS Google Scholar
Rissanen, J. (1983). Ann. Statist. 11, 416–431. CrossRef Google Scholar
Rossmann, M. G., Leslie, A. G. W., AbdelMeguid, S. S. & Tsukihara, T. (1979). J. Appl. Cryst. 12, 570–581. CrossRef CAS IUCr Journals Web of Science Google Scholar
Schanno, J. (1970). Math. Comput. 24, 647–650. Google Scholar
Schlichting, I. (2015). IUCrJ, 2, 246–255. Web of Science CrossRef CAS PubMed IUCr Journals Google Scholar
Slaney, M. & Kak, A. C. (1985). Imaging with Diffraction Tomography. Purdue University Department of Electrical and Computer Engineering Technical Reports 540, https://docs.lib.purdue.edu/ecetr/540/. Google Scholar
Sorenson, H. & Alspach, D. (1971). Automatica, 7, 465–479. CrossRef Google Scholar
Spence, J. C. H. (2017). IUCrJ, 4, 322–339. Web of Science CrossRef CAS PubMed IUCr Journals Google Scholar
White, T. A., Mariani, V., Brehm, W., Yefanov, O., Barty, A., Beyerlein, K. R., Chervinskii, F., Galli, L., Gati, C., Nakane, T., Tolstikova, A., Yamashita, K., Yoon, C. H., Diederichs, K. & Chapman, H. N. (2016). J. Appl. Cryst. 49, 680–689. Web of Science CrossRef CAS IUCr Journals Google Scholar
Winkler, F. K., Schutt, C. E. & Harrison, S. C. (1979). Acta Cryst. A35, 901–911. CrossRef CAS IUCr Journals Web of Science Google Scholar
This is an openaccess article distributed under the terms of the Creative Commons Attribution (CCBY) Licence, which permits unrestricted use, distribution, and reproduction in any medium, provided the original authors and source are cited.