Search NASA⌕ Search

SEARCH · Search NASA

Results for “structured data”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

An efficient and portable SIMD algorithm for charge/current deposition in Particle-In-Cell codes

In current computer architectures, data movement (from die to network) is by far the most energy consuming part of an algorithm (≈20pJ/word on-die to ≈10,000 pJ/word on the network). To increase memory locality at the hardware level and reduce energy consumption related to data movement, future exascale computers tend to use many-core processors on each compute nodes that will have a reduced clock speed to allow for efficient cooling. To compensate for frequency decrease, machine vendors are making use of long SIMD instruction registers that are able to process multiple data with one arithmetic operator in one clock cycle. SIMD register length is expected to double every four years. As a consequence, Particle-In-Cell (PIC) codes will have to achieve good vectorization to fully take advantage of these upcoming architectures. In this paper, we present a new algorithm that allows for efficient and portable SIMD vectorization of current/charge deposition routines that are, along with the field gathering routines, among the most time consuming parts of the PIC algorithm. Our new algorithm uses a particular data structure that takes into account memory alignment constraints and avoids gather/scat;ter instructions that can significantly affect vectorization performances on current CPUs. The new algorithm was successfully implemented in the 3D skeleton PIC code PICSAR and tested on Haswell Xeon processors (AVX2-256 bits wide data registers). Results show a factor of ×2 to ×2.5 speed-up in double precision for particle shape factor of orders 1–3. The new algorithm can be applied as is on future KNL (Knights Landing) architectures that will include AVX-512 instruction sets with 512 bits register lengths (8 doubles/16 singles). Program summary Program Title: vec_deposition Program Files doi:http://dx.doi.org/10.17632/nh77fv9k8c.1 Licensing provisions: BSD 3-Clause Programming language: Fortran 90 External routines/libraries: OpenMP > 4.0 Nature of problem: Exascale architectures will have many-core processors per node with long vector data registers capable of performing one single instruction on multiple data during one clock cycle. Data register lengths are expected to double every four years and this pushes for new portable solutions for efficiently vectorizing Particle-In-Cell codes on these future many-core architectures. One of the main hotspot routines of the PIC algorithm is the current/charge deposition for which there is no efficient and portable vector algorithm. Solution method: Here we provide an efficient and portable vector algorithm of current/charge deposition routines that uses a new data structure, which significantly reduces gather/scatter operations. Vectorization is controlled using OpenMP 4.0 compiler directives for vectorization which ensures portability across different architectures. Restrictions: Here we do not provide the full PIC algorithm with an executable but only vector routines for current/charge deposition. These scalar/vector routines can be used as library routines in your 3D Particle-In-Cell code. However, to get the best performances out of vector routines you have to satisfy the two following requirements: (1) Your code should implement particle tiling (as explained in the manuscript) to allow for maximized cache reuse and reduce memory accesses that can hinder vector performances. The routines can be used directly on each particle tile. (2) You should compile your code with a Fortran 90 compiler (e.g Intel, gnu or cray) and provide proper alignment flags and compiler alignment directives (more details in README file).

97 MATHEMATICS AND COMPUTING↗

Productive Programming of Distributed Systems with the SHAD C++ Library

High-performance computing (HPC) is often perceived as a matter of making large-scale systems (e.g., clusters) run as fast as possible, regardless the required programming effort. However, the idea of "bringing HPC to the masses" has recently emerged. Inspired by this vision, we have designed SHAD, the Scalable High-performance Algorithms and Data-structures library. SHAD is open source software, written in C++, for C++ developers. Unlike other HPC libraries for distributed systems, which rely on SPMD models, SHAD adopts a shared-memory programming abstraction, to make C++ programmers feel at home. Underneath, SHAD manages tasking and data-movements, moving the computation where data resides and taking advantage of asynchrony to tolerate network latency. At the bottom of his stack, SHAD can interface with multiple runtime systems: this not only improves developer’s productivity, by hiding the complexity of such software and of the underlying hardware, but also greatly enhance code portability. Thanks to its abstraction layers, SHAD can indeed target different systems, ranging from laptops to HPC clusters, without any need for modifying the user-level code. We have prototyped and open-sourced the implementation of (a subset of) the C++ standard library (STL) targeting multi-node HPC clusters. Our work allows plain STL-based C++ code to scale on HPC systems, with no need for rewriting the code to exploit the complex hardware. SHAD is available under Apache v2 License at https://github.com/pnnl/SHAD. In this paper we overview the design of the SHAD library, depicting its main components: runtime systems abstractions for tasking; parallel and distributed data-structures; STL-compliant interfaces and algorithms.

Castellana, Vito G.↗

Automated Data Cleansing in Data Harvesting and Data Migration

In the proposal for this project, we noted how the explosion of digitized information available through corporate databases, data stores and online search systems has resulted in the knowledge worker being bombarded by information. Knowledge workers typically spend more than 20-30% of their time seeking and sorting information, only finding the information 50-60% of the time . This information exists as unstructured, semi-structured and structured data. The problem of information overload is compounded by the production of duplicate or near-duplicate information. In addition, near-duplicate items frequently have different origins, creating a situation in which each item may have unique information of value, but their differences are not significant enough to justify maintaining them as separate entities. Effective tools can be provided to eliminate duplicate and near-duplicate information. The proposed approach was to extract unique information from data sets and consolidation that information into a single comprehensive file.

97 MATHEMATICS AND COMPUTING↗

Nuclear Data Sheets for A = 179

Nuclear structure data pertaining to all nuclei with mass number A = 179 (Yb, Lu, Hf, Ta, W, Re, Os, Ir, Pt, Au, Hg, Tl) have been compiled and evaluated, and incorporated into the ENSDF database. This evaluation for A = 179, which considers data available by 15 November 2008, supersedes the previous complete publication (E. Browne, Nuclear Data Sheets55, 483 (1988), cutoff September 1987) and the update-mode publication (C. Baglin, Nuclear Data Sheets72, 617 (1994), cutoff date September 1994), as well as the subsequent evaluations of Ta, Ir and Tl by C. Baglin (literature cutoff dates January 2000, October 1998 and February 2001, respectively). The newly evaluated literature provides new Coulomb excitation data for Hf, transfer reaction data for Hf and Ta, new information on Au and Hg from {alpha} decay and significant (HI,xn{gamma}) reaction data for Hf, Ta, Re, Au and Hg. At the time of the 1994 evaluation, no {gamma}-ray information was available for Au or Hg; that situation has now changed dramatically, although additional work on details of the low-lying structure of Au could be instructive.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Refining HPCToolkit for application performance analysis at exascale

As part of the US Department of Energy’s Exascale Computing Project (ECP), Rice University has been refining its HPCToolkit performance tools to better support measurement and analysis of applications executing on exascale supercomputers. To efficiently collect performance measurements of GPU-accelerated applications, HPCToolkit employs novel non-blocking data structures to communicate performance measurements between tool threads and application threads. To attribute performance information in detail to source lines, loop nests, and inlined call chains, HPCToolkit performs parallel analysis of large CPU and GPU binaries involved in the execution of an exascale application to rapidly recover mappings between machine instructions and source code. To analyze terabytes of performance measurements gathered during executions at exascale, HPCToolkit employs distributed-memory parallelism, multithreading, sparse data structures, and out-of-core streaming analysis algorithms. To support interactive exploration of profiles up to terabytes in size, HPCToolkit’s hpcviewer graphical user interface uses out-of-core methods to visualize performance data. The result of these efforts is that HPCToolkit now supports collection, analysis, and presentation of profiles and traces of GPU-accelerated applications at exascale. These improvements have enabled HPCToolkit to efficiently measure, analyze and explore terabytes of performance data for executions using as many as 64K MPI ranks and 64K GPU tiles on ORNL’s Frontier supercomputer. HPCToolkit’s support for measurement and analysis of GPU-accelerated applications has been employed to study a collection of open-science applications developed as part of ECP. This paper reports on these experiences, which provided insight into opportunities for tuning applications, strengths and weaknesses of HPCToolkit itself, as well as unexpected behaviors in executions at exascale.

Adhianto, Laksono↗

Implementing a neural network interatomic model with performance portability for emerging exascale architectures

The two main thrusts of computational science are increasingly accurate predictions and faster calculations; to this end, the zeitgeist in molecular dynamics (MD) simulations is pursuing machine learned and data driven interatomic models, e.g. neural network potentials, and novel hardware architectures, e.g. GPUs. Current implementations of neural network potentials are orders of magnitude slower than traditional interatomic models and while looming exascale computing offers the ability to run large, accurate simulations with these models, achieving portable performance for MD with new and varied exascale hardware requires rethinking traditional algorithms, using novel data structures, and library solutions. We re-implement a neural network interatomic model in CabanaMD, an MD proxy application, built on libraries developed for performance portability. Our implementation shows significantly improved thread scaling in this complex kernel as compared to a current LAMMPS implementation, across both strong and weak scaling. Our single-source solution enables simulations up to 20 million atoms on a single CPU node and 4 million atoms with improved performance on a single GPU. Furthermore, we also explore parallelism and data layout choices (using flexible data structures called AoSoAs) and their effect on performance, seeing up to ~50% and ~5% improvements in performance on a GPU by choosing the right level of parallelism and data layout respectively.

97 MATHEMATICS AND COMPUTING↗

Experiences with string matching on the Fermi Architecture

String matching is at the core of many real-world applications, such as security, bioinformatic, data mining. All these applications requires the ability to match always growing data sets against large dictionaries effectively, fastly and possibly in real time. Unfortunately, string matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. Graphic Processing Units (GPU) have become an interesting target for such high-throughput applications, but the algorithms and the data structures need to be redesigned to be parallelized and adapted to the underlining hardware, coping with the limitations imposed by these architectures. In this paper we present an efficient implementation of the Aho-Corasick string matching algorithm on GPU, showing how we progressively redesigned the algorithm and the data structures to fit on the architecture. We then evaluate the implementation on single and multiple Tesla C2050 (T20 ``Fermi'' based) boards, comparing them to the previous Tesla C1060 (T10 based) solutions and equivalent multicore implementations on x86 CPUs. We discuss the various tradeoffs of the different architectures.

99 GENERAL AND MISCELLANEOUS↗

Evidence for small-molecule-mediated loop stabilization in the structure of the isolated Pin1 WW domain

Two structures of a small protein with a defined tertiary fold, the isolated Pin1 WW domain, have been determined via racemic crystallization with small-molecule additives. These additives, which are either racemic or achiral, appear to stabilize a dynamic loop region of the structure. The human Pin1 WW domain is a small autonomously folding protein that has been useful as a model system for biophysical studies of β-sheet folding. This domain has resisted previous attempts at crystallization for X-ray diffraction studies, perhaps because of intrinsic conformational flexibility that interferes with the formation of a crystal lattice. Here, the crystal structure of the human Pin1 WW domain has been obtained via racemic crystallization in the presence of small-molecule additives. Both enantiomers of a 36-residue variant of the Pin1 WW domain were synthesized chemically, and the l- and d-polypeptides were combined to afford diffracting crystals. The structural data revealed packing interactions of small carboxylic acids, either achiral citrate or a d,l mixture of malic acid, with a mobile loop region of the WW-domain fold. These interactions with solution additives may explain our success in crystallization of this protein racemate. Molecular-dynamics simulations starting from the structure of the Pin1 WW domain suggest that the crystal structure closely resembles the conformation of this domain in solution. The structural data presented here should provide a basis for further studies of this important model system.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Heterolytic Cleavage of Hydrogen by an Iron Hydrogenase Model: An Fe-H - - - H-N Dihydorgen Bond Characterized by Neutron Diffraction

Use of hydrogen as a fuel by [FeFe]-hydrogenase enzymes in nature requires heterolytic cleavage of the H-H bond into a proton (H+) and hydride (H-), a reaction that is also a critical step in homogeneous catalysts for hydrogenation of C=O and C=N bonds. An understanding of the catalytic oxidation of H2 by hydrogenases provides insights into the design of synthetic catalysts that are sought as cost-effective alternatives to the use of the precious metal platinum in fuel cells. Crystallographic studies on the [FeFe]-hydrogenase enzyme were critical to understanding of its reactivity, but the key H-H cleavage step is not readily observed experimentally in natural hydrogenases. Synthetic biomimics have provided evidence for H2 cleavage leading to hydride transfer to the metal and proton transfer to an amine. Limitations on the precise location of hydrogen atoms by x-ray diffraction can be overcome by use of neutron diffraction, though its use is severely limited by the difficulty of obtaining suitable crystals and by the scarcity of neutron sources. Here we show that an iron complex with a pendant amine in the diphosphine ligand cleaves hydrogen heterolytically under mild conditions, leading to [CpC5F4NFeH(PtBu2NtBu2H)]+BArF4-, [PtBu2NtBu2 = 1,5-di(tert-butyl)-3,7-di(tert-butyl)-1,5-diaza-3,7-diphosphacyclooctane; ArF = 3,5-bis(trifluoromethyl)phenyl]. The Fe-H- - - H-N moiety has a strong dihydrogen bond, with a remarkably short H • • • H distance of 1.489(10) Å between the protic N-Hδ+ and hydridic Fe-Hδ-. The structural data for [CpC5F4NFeH(PtBu2NtBu2H)]+ provide a glimpse of how the H-H bond is oxidized or generated in hydrogenase enzymes, with the pendant amine playing a key role as a proton relay. The iron complex [CpC5F4NFeH(PtBu2NtBu2H)]+BArF4- is an electrocatalyst for oxidation of H2 (1 atm) at 22 °C, so the structural data are obtained on a complex that is a functional model for catalysis by [FeFe]-hydrogenase enzymes. This research was supported as part of the Center for Molecular Electrocatalysis, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences. Pacific Northwest National Laboratory is operated by Battelle for the U.S. Department of Energy.

36 MATERIALS SCIENCE↗

Two-stage formation-energy correction (NbZr, TaZr, VZr)

This bundle contains the scripts, the raw and corrected per-structure data, and the manuscript plots for the NbZr / TaZr / VZr BCC binary formation energies and the associated RMSDs. Why a two-stage correction is necessary: The "raw" formation energy of every relaxed VASP configuration is computed in the usual way, FE_raw(c) = E_alloy(c) - sum_i x_i * E_pure_i , where E_pure_i are the per-atom total energies of the pure-element reference structures (Nb, Ta, V, Zr in the same BCC supercell, with identical INCAR / KPOINTS / PAW choices). With perfectly consistent reference runs the raw FE should vanish at the two pure-element endpoints (x = 0 and x = 1) by construction. In practice this does not hold for two reasons that are present in our dataset: 1. Reference-energy inconsistency (composition-dependent bias). Even with identical input parameters, the pure-element runs (stored in `corrected_DFT_pure_element_runs/`) differ slightly from the values that would be implied by the alloy runs at near-pure compositions (a few meV/atom). This bias is approximately linear in concentration, because the residual error in E_pure_Nb (or E_pure_Ta / E_pure_V) propagates into FE_raw(c) as (1 - x) * dE_pure_1, and the corresponding error in E_pure_Zr propagates as x * dE_pure_2. Left uncorrected, this produces a non-physical "tilt" of FE_raw(x) and shifts the entire FE-vs-x cloud away from zero at the endpoints. 2. Endpoint anchoring against the audited true endpoints. The strict endpoint values (FE_x0_meVatom, FE_x1_meVatom in `corrected_fe_strict_endpoints_20260518/strict_endpoint_check_20260518.csv`) were re-derived from an independent cross-check of the pure-element runs. After stage 1 removes the linear bias, the near-pure compositions in the alloy dataset still extrapolate to values that differ slightly from these audited endpoints — because stage 1 is fit from a few near-end alloy bins, not from the audited pure-element references themselves. The README.txt file discusses how these issues are addressed by the two-stage correction, and describes folder layout, pipeline summary, and how to re-run.

36 MATERIALS SCIENCE↗

SU-E-T-558: Monte Carlo Photon Transport Simulations On GPU with Quadric Geometry

Purpose: Monte Carlo simulation on GPU has experienced rapid advancements over the past a few years and tremendous accelerations have been achieved. Yet existing packages were developed only in voxelized geometry. In some applications, e.g. radioactive seed modeling, simulations in more complicated geometry are needed. This abstract reports our initial efforts towards developing a quadric geometry module aiming at expanding the application scope of GPU-based MC simulations. Methods: We defined the simulation geometry consisting of a number of homogeneous bodies, each specified by its material composition and limiting surfaces characterized by quadric functions. A tree data structure was utilized to define geometric relationship between different bodies. We modified our GPU-based photon MC transport package to incorporate this geometry. Specifically, geometry parameters were loaded into GPU’s shared memory for fast access. Geometry functions were rewritten to enable the identification of the body that contains the current particle location via a fast searching algorithm based on the tree data structure. Results: We tested our package in an example problem of HDR-brachytherapy dose calculation for shielded cylinder. The dose under the quadric geometry and that under the voxelized geometry agreed in 94.2% of total voxels within 20% isodose line based on a statistical t-test (95% confidence level), where the reference dose was defined to be the one at 0.5cm away from the cylinder surface. It took 243sec to transport 100million source photons under this quadric geometry on an NVidia Titan GPU card. Compared with simulation time of 99.6sec in the voxelized geometry, including quadric geometry reduced efficiency due to the complicated geometry-related computations. Conclusion: Our GPU-based MC package has been extended to support photon transport simulation in quadric geometry. Satisfactory accuracy was observed with a reduced efficiency. Developments for charged particle transport in this geometry are currently in progress.

61 RADIATION PROTECTION AND DOSIMETRY↗

Atacama Cosmology Telescope: Multiprobe cosmology with unWISE galaxies and ACT DR6 CMB lensing

We present a joint analysis of the cosmic microwave background (CMB) lensing power spectra measured from the Data Release 6 of the Atacama Cosmology Telescope (ACT) and Planck PR4, cross-correlations between the ACT and Planck lensing reconstruction and galaxy clustering from unWISE, and the unWISE clustering auto-spectrum. We obtain 1.5% constraints on the matter density fluctuations at late times parametrized by the best constrained parameter combination 𝑆$^{3⁢x⁢2⁢pt}_{8}$ ≡ 𝜎 8 ⁢(Ω 𝑚 /0.3) 0.4 = 0.815 ± 0.012. The commonly used 𝑆 8 ≡ 𝜎 8⁢ (Ω 𝑚 /0.3) 0.5 parameter is constrained to 𝑆 8 = 0.816 ± 0.015. In combination with baryon acoustic oscillation (BAO) measurements we find 𝜎 8 = 0.815 ± 0.012. We also present sound-horizon-independent estimates of the present day Hubble rate of 𝐻 0 = 66.4$^{+3.2}_{−3.7}$ km s −1 Mpc −1 from our large scale structure data alone and 𝐻 0 = 64.3$^{+2.1}_{−2.4}$ km s −1 Mpc −1 in combination with uncalibrated supernovae from Pantheon+. Using parametric estimates of the evolution of matter density fluctuations, we place constraints on cosmic structure in a range of high redshifts typically inaccessible with cross-correlation analyses. Combining lensing cross- and autocorrelations, we derive a 3.3% constraint on the integrated matter density fluctuations above 𝑧 = 2.4, one of the tightest constraints in this redshift range and fully consistent with a Λ cold dark matter (Λ⁢CDM) model fit to the primary CMB from Planck. Finally, combining with primary CMB observations and using the extended low redshift coverage of these combined datasets we derive constraints on a variety of extensions to the Λ⁢CDM model including massive neutrinos, spatial curvature, and dark energy. We find in flat Λ⁢CDM⁢ ∑𝑚 𝜈 < 0.12 eV at 95% confidence using the large scale structure data, BAO measurements from Sloan Digital Sky Survey, and primary CMB observations.

79 ASTRONOMY AND ASTROPHYSICS↗

BEAST DB: Grand-Canonical Database of Electrocatalyst Properties

We present BEAST DB, an open-source database comprised of ab initio electrochemical data computed using grand-canonical density functional theory in implicit solvent at consistent calculation parameters. The database contains over 20,000 surface calculations and covers a broad set of heterogeneous catalyst materials and electrochemical reactions. Calculations were performed at self-consistent fixed potential as well as constant charge to facilitate comparisons to the computational hydrogen electrode. This article presents common use cases of the database to rationalize trends in catalyst activity, screen catalyst material spaces, understand elementary mechanistic steps, analyze the electronic structure, and train machine learning models to predict higher fidelity properties. Users can interact graphically with the database by querying for individual calculations to gain a granular understanding of reaction steps or by querying for an entire reaction pathway on a given material using an interactive reaction pathway tool. BEAST DB will be periodically updated, with planned future updates to include advanced electronic structure data, surface speciation studies, and greater reaction coverage.

database↗

Development of reactive force fields using ab initio molecular dynamics simulation minimally biased to experimental data

Incorporation of quantum mechanical electronic structure data is necessary to properly capture the physics of many chemical processes. Proton hopping in water, which involves rearrangement of chemical and hydrogen bonds, is one such example of an inherently quantum mechanical process. Standard ab initio molecular dynamics (AIMD) methods, however, do not yet accurately predict the structure of water and are therefore less than optimal for developing force fields. We have instead utilized here a recently developed method which minimally biases AIMD simulations to match limited experimental data to develop novel multiscale reactive molecular dynamics (MS-RMD) force fields by using relative entropy minimization. In this paper, we present two new MS-RMD models using such a parameterization: one which employs water with harmonic internal vibrations and another which uses anharmonic water. We show that the newly developed MS-RMD models very closely reproduce the solvation structure of the hydrated excess proton in the target AIMD data. We also find that the use of anharmonic water increases proton hopping, thereby increasing the proton diffusion constant.

74 ATOMIC AND MOLECULAR PHYSICS↗

Memory access optimization for particle operations in computational fluid dynamics-discrete element method simulations

Computational Fluid Dynamics - Discrete Element Method is used to model gas-solid systems in several applications in energy, pharmaceutical and petrochemical industries. Computational performance bottlenecks often limit the problem sizes that can be simulated at industrial scale. The data structures used to store several millions of particles in such large-scale simulations have a large memory footprint that does not fit into the processor cache hierarchies on current high-performance-computing platforms, leading to reduced computational performance. This paper specifically addresses this aspect of memory access bottlenecks in industrial scale simulations. The use of space-filling curves to improve memory access patterns is described and their impact on computational performance is quantified in both shared and distributed memory parallelization paradigms. The Morton space filling curve applied to uniform grids and k-dimensional tree partitions are used to reorder the particle data-structure thus improving spatial and temporal locality in memory. The performance impact of these techniques when applied to two benchmark problems, namely the homogeneous-cooling-system and a fluidized-bed, are presented. We report these optimization techniques lead to approximately two-fold performance improvement in particle focused operations such as neighbor-list creation and data-exchange, with ~ 1.5 times overall improvement in a fluidization simulation with 1.27 million particles.

97 MATHEMATICS AND COMPUTING↗

Nuclear Data Sheets for A = 81

Nuclear structure data pertaining to all nuclei with mass number A = 81 (Zn, Ga, Ge, As, Se, Br, Kr, Rb, Sr, Y, Zr, Nb) have been compiled and evaluated and incorporated into the ENSDF data file. This publication for A = 81 supersedes the previous publication (Coral M. Baglin, Nuclear Data Sheets79, 447 (1996), literature cutoff 1 November 1996) and the subsequent updates by C. Baglin for {sup 81}Y (literature cutoff 8 October 1998) and {sup 81}Zr (literature cutoff 24 March 2000). All literature available prior to 15 August 2008 has been considered. Subsequent to previous A = 81 evaluations, excited states have been reported for the first time in {sup 81}Ga, and knowledge of excited state properties for {sup 81}Y and {sup 81}Zr has been significantly expanded. However, the expected {epsilon}+{beta}{sup +} decay of {sup 81}Zr has yet to be studied.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

LR: Compact connectivity representation for triangle meshes

We propose LR (Laced Ring) - a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearly-Hamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.

97 MATHEMATICS AND COMPUTING↗

Fragment-based determination of a proteinase K structure from MicroED data using ARCIMBOLDO_SHREDDER

Structure determination of novel biological macromolecules by X-ray crystallography can be facilitated by the use of small structural fragments, some of only a few residues in length, as effective search models for molecular replacement to overcome the phase problem. Independence from the need for a complete pre-existing model with sequence similarity to the crystallized molecule is the primary appeal of ARCIMBOLDO , a suite of programs which employs this ab initio algorithm for phase determination. Here, the use of ARCIMBOLDO is investigated to overcome the phase problem with the electron cryomicroscopy (cryoEM) method known as microcrystal electron diffraction (MicroED). The results support the use of the ARCIMBOLDO_SHREDDER pipeline to provide phasing solutions for a structure of proteinase K from 1.6 Å resolution data using model fragments derived from the structures of proteins sharing a sequence identity of as low as 20%. ARCIMBOLDO_SHREDDER identified the most accurate polyalanine fragments from a set of distantly related sequence homologues. Alternatively, such templates were extracted in spherical volumes and given internal degrees of freedom to refine towards the target structure. Both modes relied on the rotation function in Phaser to identify or refine fragment models and its translation function to place them. Model completion from the placed fragments proceeded through phase combination of partial solutions and/or density modification and main-chain autotracing using SHELXE . The combined set of fragments was sufficient to arrive at a solution that resembled that determined by conventional molecular replacement using the known target structure as a search model. This approach obviates the need for a single, complete and highly accurate search model when phasing MicroED data, and permits the evaluation of large fragment libraries for this purpose.

59 BASIC BIOLOGICAL SCIENCES↗