An account is given of the development of the SHELX system of computer programs from SHELX-76 to the present day. In addition to identifying useful innovations that have come into general use through their implementation in SHELX, a critical analysis is presented of the less-successful features, missed opportunities and desirable improvements for future releases of the software. An attempt is made to understand how a program originally designed for photographic intensity data, punched cards and computers over 10000 times slower than an average modern personal computer has managed to survive for so long. SHELXL is the most widely used program for small-molecule refinement and SHELXS and SHELXD are often employed for structure solution despite the availability of objectively superior programs. SHELXL also finds a niche for the refinement of macromolecules against high-resolution or twinned data; SHELXPRO acts as an interface for macromolecular applications. SHELXC, SHELXD and SHELXE are proving useful for the experimental phasing of macromolecules, especially because they are fast and robust and so are often employed in pipelines for high-throughput phasing. This paper could serve as a general literature citation when one or more of the open-source SHELX programs (and the Bruker AXS version SHELXTL) are employed in the course of a crystal-structure determination.

/pdf/a-short-history-of-shelx-2p8xg3qghr.pdf

A short history of SHELX

The new computer program SHELXT employs a novel dual-space algorithm to solve the phase problem for single-crystal reflection data expanded to the space group P1. Missing data are taken into account and the resolution extended if necessary. All space groups in the specified Laue group are tested to find which are consistent with the P1 phases. After applying the resulting origin shifts and space-group symmetry, the solutions are subject to further dual-space recycling followed by a peak search and summation of the electron density around each peak. Elements are assigned to give the best fit to the integrated peak densities and if necessary additional elements are considered. An isotropic refinement is followed for non-centrosymmetric space groups by the calculation of a Flack parameter and, if appropriate, inversion of the structure. The structure is assembled to maximize its connectivity and centred optimally in the unit cell. SHELXT has already solved many thousand structures with a high success rate, and is optimized for multiprocessor computers. It is, however, unsuitable for severely disordered and twinned structures because it is based on the assumption that the structure consists of atoms.

/pdf/shelxt-integrated-space-group-and-crystal-structure-4xay59p0jx.pdf

SHELXT - Integrated space-group and crystal- structure determination

SIR97 is the integration of two programs, SIR92 and CAOS, the first devoted to the solution of crystal structures by direct methods, the second to refinement via least-squares–Fourier procedures. Several new features have been introduced in SIR97 with respect to the previous version, SIR92: greater automatization, increased efficiency of the direct methods section, and a powerful graphics interface. The program also provides publication tables and CIF files.

SIR97: a new tool for crystal structure determination and refinement

SIR2004 is the evolution of the SIR2002 program [Burla, Camalli, Carrozzini, Cascarano, Giacovazzo, Polidori & Spagna (2003). J. Appl. Cryst. 36, 1103]. It is devoted to the solution of crystal structures by direct and Patterson methods. Several new features implemented in SIR2004 make this program efficient: it is able to solve ab initio both small/medium-size structures as well as macromolecules (up to 2000 atoms in the asymmetric unit). In favourable circumstances, the program is also able to solve protein structures with data resolution up to 1.4–1.5 A, and to provide interpretable electron density maps. A powerful user-friendly graphical interface is provided.

SIR2004: an improved tool for crystal structure determination and refinement

Iterative dual-space direct methods based on phase refinement in reciprocal space and peak picking in real space are able to locate relatively large numbers of anomalous scatterers efficiently from MAD or SAD data. Truncation of the data at a particular resolution, typically in the range 3.0–3.5 A, can be critical to success. The efficiency can be improved by roughly an order of magnitude by Patterson-based seeding instead of starting from random phases or sites; Patterson superposition methods also provide useful validation. The program SHELXD implementing this approach is available as part of the SHELX package.

Substructure solution with SHELXD.

A theory of phase determination for the four types of non-centrosymmetric space groups 1P222, 2P22, 3P12, 3P22

Solution of the phase problem

The Shake-and-Bake method of structure determination is a new direct methods phasing algorithm based on a minimum-variance, phase invariant residual, which is referred to as the minimal principle. Previously, the algorithm had been applied only to known structures. This algorithm has now been applied to two previously unknown structures that contain 105 and 110 non-hydrogen atoms, respectively. This report focuses on (i) algorithmic and parametric optimizations of Shake-and-Bake and (ii) the determination of two previously unknown structures. Traditional tangent formula phasing techniques were unable to unravel these two new structures.

https://science.sciencemag.org/content/sci/259/5100/1430.full.pdf

On the application of the minimal principle to solve unknown structures

The minimal function, R(ϕ), has been used to provide the basis for a new computer-intensive direct-methods procedure that shows potential for providing fully automatic routine solutions for structures in the 200–400 atom range. This procedure, which has been called shake-and-bake, is an iterative process in which real-space filtering is alternated with phase refinement using a technique that reduces the value of R(ϕ). It has been successfully tested using experimental data for a dozen known structures ranging in size from 25 to 317 atoms and crystallizing in a variety of space groups. The details of this procedure, the parameters used and the results of these applications are described.

Herbert A. Hauptman

Papers

A theory of phase determination for the four types of non-centrosymmetric space groups 1P222, 2P22, 3P12, 3P22

Solution of the phase problem

On the application of the minimal principle to solve unknown structures

Structure solution by minimal‐function phase refinement and Fourier filtering. II. Implementation and applications

The phases and magnitudes of the structure factors