NobleBlocks
San Diego Supercomputer Center logo

San Diego Supercomputer Center

facilitySan Diego, California, United States

Research output, citation impact, and the most-cited recent papers from San Diego Supercomputer Center (United States). Aggregated across the NobleBlocks index of 300M+ scholarly works.

Total works
3.3K
Citations
551.0K
h-index
312
i10-index
3.5K
Also known as
San Diego Supercomputer Center

Top-cited papers from San Diego Supercomputer Center

Planck 2018 results
N. Aghanim, Y. Akrami, M. Ashdown, J. Aumont +4 more
2020· Astronomy and Astrophysics14.6Kdoi:10.1051/0004-6361/201833910

We present cosmological parameter results from the final full-mission Planck measurements of the cosmic microwave background (CMB) anisotropies, combining information from the temperature and polarization maps and the lensing reconstruction. Compared to the 2015 results, improved measurements of large-scale polarization allow the reionization optical depth to be measured with higher precision, leading to significant gains in the precision of other correlated parameters. Improved modelling of the small-scale polarization leads to more robust constraints on many parameters, with residual modelling uncertainties estimated to affect them only at the 0.5 σ level. We find good consistency with the standard spatially-flat 6-parameter ΛCDM cosmology having a power-law spectrum of adiabatic scalar perturbations (denoted “base ΛCDM” in this paper), from polarization, temperature, and lensing, separately and in combination. A combined analysis gives dark matter density Ω c h 2 = 0.120 ± 0.001, baryon density Ω b h 2 = 0.0224 ± 0.0001, scalar spectral index n s = 0.965 ± 0.004, and optical depth τ = 0.054 ± 0.007 (in this abstract we quote 68% confidence regions on measured parameters and 95% on upper limits). The angular acoustic scale is measured to 0.03% precision, with 100 θ * = 1.0411 ± 0.0003. These results are only weakly dependent on the cosmological model and remain stable, with somewhat increased errors, in many commonly considered extensions. Assuming the base-ΛCDM cosmology, the inferred (model-dependent) late-Universe parameters are: Hubble constant H 0 = (67.4 ± 0.5) km s −1 Mpc −1 ; matter density parameter Ω m = 0.315 ± 0.007; and matter fluctuation amplitude σ 8 = 0.811 ± 0.006. We find no compelling evidence for extensions to the base-ΛCDM model. Combining with baryon acoustic oscillation (BAO) measurements (and considering single-parameter extensions) we constrain the effective extra relativistic degrees of freedom to be N eff = 2.99 ± 0.17, in agreement with the Standard Model prediction N eff = 3.046, and find that the neutrino mass is tightly constrained to ∑ m ν < 0.12 eV. The CMB spectra continue to prefer higher lensing amplitudes than predicted in base ΛCDM at over 2 σ , which pulls some parameters that affect the lensing amplitude away from the ΛCDM model; however, this is not supported by the lensing reconstruction or (in models that also change the background geometry) BAO data. The joint constraint with BAO measurements on spatial curvature is consistent with a flat universe, Ω K = 0.001 ± 0.002. Also combining with Type Ia supernovae (SNe), the dark-energy equation of state parameter is measured to be w 0 = −1.03 ± 0.03, consistent with a cosmological constant. We find no evidence for deviations from a purely power-law primordial spectrum, and combining with data from BAO, BICEP2, and Keck Array data, we place a limit on the tensor-to-scalar ratio r 0.002 < 0.06. Standard big-bang nucleosynthesis predictions for the helium and deuterium abundances for the base-ΛCDM cosmology are in excellent agreement with observations. The Planck base-ΛCDM results are in good agreement with BAO, SNe, and some galaxy lensing observations, but in slight tension with the Dark Energy Survey’s combined-probe results including galaxy clustering (which prefers lower fluctuation amplitudes or matter density parameters), and in significant, 3.6 σ , tension with local measurements of the Hubble constant (which prefer a higher value). Simple model extensions that can partially resolve these tensions are not favoured by the Planck data.

Creating the CIPRES Science Gateway for inference of large phylogenetic trees
Mark A. Miller, Wayne Pfeiffer, Terri Schwartz
201011.5Kdoi:10.1109/gce.2010.5676129

Understanding the evolutionary history of living organisms is a central problem in biology. Until recently the ability to infer evolutionary relationships was limited by the amount of DNA sequence data available, but new DNA sequencing technologies have largely removed this limitation. As a result, DNA sequence data are readily available or obtainable for a wide spectrum of organisms, thus creating an unprecedented opportunity to explore evolutionary relationships broadly and deeply across the Tree of Life. Unfortunately, the algorithms used to infer evolutionary relationships are NP-hard, so the dramatic increase in available DNA sequence data has created a commensurate increase in the need for access to powerful computational resources. Local laptop or desktop machines are no longer viable for analysis of the larger data sets available today, and progress in the field relies upon access to large, scalable high-performance computing resources. This paper describes development of the CIPRES Science Gateway, a web portal designed to provide researchers with transparent access to the fastest available community codes for inference of phylogenetic relationships, and implementation of these codes on scalable computational resources. Meeting the needs of the community has included developing infrastructure to provide access, working with the community to improve existing community codes, developing infrastructure to insure the portal is scalable to the entire systematics community, and adopting strategies that make the project sustainable by the community. The CIPRES Science Gateway has allowed more than 1800 unique users to run jobs that required 2.5 million Service Units since its release in December 2009. (A Service Unit is a CPU-hour at unit priority).

A Rapid Bootstrap Algorithm for the RAxML Web Servers
Alexandros Stamatakis, Paul Hoover, Jacques Rougemont
2008· Systematic Biology7.1Kdoi:10.1080/10635150802429642

Despite recent advances achieved by application of high-performance computing methods and novel algorithmic techniques to maximum likelihood (ML)-based inference programs, the major computational bottleneck still consists in the computation of bootstrap support values. Conducting a probably insufficient number of 100 bootstrap (BS) analyses with current ML programs on large datasets-either with respect to the number of taxa or base pairs-can easily require a month of run time. Therefore, we have developed, implemented, and thoroughly tested rapid bootstrap heuristics in RAxML (Randomized Axelerated Maximum Likelihood) that are more than an order of magnitude faster than current algorithms. These new heuristics can contribute to resolving the computational bottleneck and improve current methodology in phylogenetic analyses. Computational experiments to assess the performance and relative accuracy of these heuristics were conducted on 22 diverse DNA and AA (amino acid), single gene as well as multigene, real-world alignments containing 125 up to 7764 sequences. The standard BS (SBS) and rapid BS (RBS) values drawn on the best-scoring ML tree are highly correlated and show almost identical average support values. The weighted RF (Robinson-Foulds) distance between SBS- and RBS-based consensus trees was smaller than 6% in all cases (average 4%). More importantly, RBS inferences are between 8 and 20 times faster (average 14.73) than SBS analyses with RAxML and between 18 and 495 times faster than BS analyses with competing programs, such as PHYML or GARLI. Moreover, this performance improvement increases with alignment size. Finally, we have set up two freely accessible Web servers for this significantly improved version of RAxML that provide access to the 200-CPU cluster of the Vital-IT unit at the Swiss Institute of Bioinformatics and the 128-CPU cluster of the CIPRES project at the San Diego Supercomputer Center. These Web servers offer the possibility to conduct large-scale phylogenetic inferences to a large part of the community that does not have access to, or the expertise to use, high-performance computing resources.

Content-based image retrieval at the end of the early years
A.W.M. Smeulders, Marcel Worring, Simone Santini, Amarnath Gupta +1 more
2000· IEEE Transactions on Pattern Analysis and Machine Intelligence6.1Kdoi:10.1109/34.895972

Presents a review of 200 references in content-based image retrieval. The paper starts with discussing the working conditions of content-based retrieval: patterns of use, types of pictures, the role of semantics, and the sensory gap. Subsequent sections discuss computational steps for image retrieval systems. Step one of the review is image processing for retrieval sorted by color, texture, and local geometry. Features for retrieval are discussed next, sorted by: accumulative and global features, salient points, object and shape features, signs, and structural combinations thereof. Similarity of pictures and objects in pictures is reviewed for each of the feature types, in close connection to the types and means of feedback the user of the systems is capable of giving by interaction. We briefly discuss aspects of system engineering: databases, system architecture, and evaluation. In the concluding section, we present our view on: the driving force of the field, the heritage from computer vision, the influence on computer vision, the role of similarity and of interaction, the need for databases, the problem of evaluation, and the role of the semantic gap.

The Astropy Project : Sustaining and Growing a Community-oriented Open-source Project and the Latest Major Release (v5.0) of the Core Package*
The Astropy Collaboration, Adrian M. Price-Whelan, Pey Lian Lim, N. Earl +4 more
2022· Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)5.0Kdoi:10.3847/1538-4357/ac7c74

Full list of authors: Price-Whelan, Adrian M.; Lim, Pey Lian; Earl, Nicholas; Starkman, Nathaniel; Bradley, Larry; Shupe, David L.; Patil, Aarya A.; Corrales, Lia; Brasseur, C. E.; Noethe, Maximilian; Donath, Axel; Tollerud, Erik; Morris, Brett M.; Ginsburg, Adam; Vaher, Eero; Weaver, Benjamin A.; Tocknell, James; Jamieson, William; van Kerkwijk, Marten H.; Robitaille, Thomas P.; Merry, Bruce; Bachetti, Matteo; Gunther, H. Moritz; Aldcroft, Thomas L.; Alvarado-Montes, Jaime A.; Archibald, Anne M.; Bodi, Attila; Bapat, Shreyas; Barentsen, Geert; Bazan, Juanjo; Biswas, Manish; Boquien, Mederic; Burke, D. J.; Cara, Daria; Cara, Mihai; Conroy, Kyle E.; Conseil, Simon; Craig, Matthew W.; Cross, Robert M.; Cruz, Kelle L.; D'Eugenio, Francesco; Dencheva, Nadia; Devillepoix, Hadrien A. R.; Dietrich, Jorg P.; Eigenbrot, Arthur Davis; Erben, Thomas; Ferreira, Leonardo; Foreman-Mackey, Daniel; Fox, Ryan; Freij, Nabil; Garg, Suyog; Geda, Robel; Glattly, Lauren; Gondhalekar, Yash; Gordon, Karl D.; Grant, David; Greenfield, Perry; Groener, Austen M.; Guest, Steve; Gurovich, Sebastian; Handberg, Rasmus; Hart, Akeem; Hatfield-Dodds, Zac; Homeier, Derek; Hosseinzadeh, Griffin; Jenness, Tim; Jones, Craig K.; Joseph, Prajwel; Kalmbach, J. Bryce; Karamehmetoglu, Emir; Kaluszynski, Mikolaj; Kelley, Michael S. P.; Kern, Nicholas; Kerzendorf, Wolfgang E.; Koch, Eric W.; Kulumani, Shankar; Lee, Antony; Ly, Chun; Ma, Zhiyuan; MacBride, Conor; Maljaars, Jakob M.; Muna, Demitri; Murphy, N. A.; Norman, Henrik; O'Steen, Richard; Oman, Kyle A.; Pacifici, Camilla; Pascual, Sergio; Pascual-Granado, J.; Patil, Rohit R.; Perren, Gabriel, I; Pickering, Timothy E.; Rastogi, Tanuj; Roulston, Benjamin R.; Ryan, Daniel F.; Rykoff, Eli S.; Sabater, Jose; Sakurikar, Parikshit; Salgado, Jesus; Sanghi, Aniket; Saunders, Nicholas; Savchenko, Volodymyr; Schwardt, Ludwig; Seifert-Eckert, Michael; Shih, Albert Y.; Jain, Anany Shrey; Shukla, Gyanendra; Sick, Jonathan; Simpson, Chris; Singanamalla, Sudheesh; Singer, Leo P.; Singhal, Jaladh; Sinha, Manodeep; Sipocz, Brigitta M.; Spitler, Lee R.; Stansby, David; Streicher, Ole; Sumak, Jani; Swinbank, John D.; Taranu, Dan S.; Tewary, Nikita; Tremblay, Grant R.; De Val-Borro, Miguel; Vasovic, Zlatan; Van Kooten, Samuel J.; Verma, Shresth; Cardoso, Jose Vinicius de Miranda; Williams, Peter K. G.; Wilson, Tom J.; Winkel, Benjamin; Wood-Vasey, W. M.; Xue, Rui; Yoachim, Peter; Zhang, Chen; Zonca, Andrea; Astropy Project Contributors; TARDIS Collaboration; Astropy Coordination Comm.--This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted reuse, distribution, and reproduction in any medium, provided the original work is properly cited.

Routine Microsecond Molecular Dynamics Simulations with AMBER on GPUs. 2. Explicit Solvent Particle Mesh Ewald
Romelia Salomón–Ferrer, Andreas W. Götz, Duncan Poole, Scott Le Grand +1 more
2013· Journal of Chemical Theory and Computation3.6Kdoi:10.1021/ct400314y

We present an implementation of explicit solvent all atom classical molecular dynamics (MD) within the AMBER program package that runs entirely on CUDA-enabled GPUs. First released publicly in April 2010 as part of version 11 of the AMBER MD package and further improved and optimized over the last two years, this implementation supports the three most widely used statistical mechanical ensembles (NVE, NVT, and NPT), uses particle mesh Ewald (PME) for the long-range electrostatics, and runs entirely on CUDA-enabled NVIDIA graphics processing units (GPUs), providing results that are statistically indistinguishable from the traditional CPU version of the software and with performance that exceeds that achievable by the CPU version of AMBER software running on all conventional CPU-based clusters and supercomputers. We briefly discuss three different precision models developed specifically for this work (SPDP, SPFP, and DPDP) and highlight the technical details of the approach as it extends beyond previously reported work [Götz et al., J. Chem. Theory Comput. 2012, DOI: 10.1021/ct200909j; Le Grand et al., Comp. Phys. Comm. 2013, DOI: 10.1016/j.cpc.2012.09.022].We highlight the substantial improvements in performance that are seen over traditional CPU-only machines and provide validation of our implementation and precision models. We also provide evidence supporting our decision to deprecate the previously described fully single precision (SPSP) model from the latest release of the AMBER software package.

XSEDE: Accelerating Scientific Discovery
John Towns, T.M. Cockerill, Maytal Dahan, Ian Foster +4 more
2014· Computing in Science & Engineering3.3Kdoi:10.1109/mcse.2014.80

Computing in science and engineering is now ubiquitous: digital technologies underpin, accelerate, and enable new, even transformational, research in all domains. Access to an array of integrated and well-supported high-end digital services is critical for the advancement of knowledge. Driven by community needs, the Extreme Science and Engineering Discovery Environment (XSEDE) project substantially enhances the productivity of a growing community of scholars, researchers, and engineers (collectively referred to as "scientists"' throughout this article) through access to advanced digital services that support open research. XSEDE's integrated, comprehensive suite of advanced digital services federates with other high-end facilities and with campus-based resources, serving as the foundation for a national e-science infrastructure ecosystem. XSEDE's e-science infrastructure has tremendous potential for enabling new advancements in research and education. XSEDE's vision is a world of digitally enabled scholars, researchers, and engineers participating in multidisciplinary collaborations to tackle society's grand challenges.

An overview of the Amber biomolecular simulation package
Romelia Salomón–Ferrer, David A. Case, Ross C. Walker
2012· Wiley Interdisciplinary Reviews Computational Molecular Science2.7Kdoi:10.1002/wcms.1121

Abstract Molecular dynamics (MD) allows the study of biological and chemical systems at the atomistic level on timescales from femtoseconds to milliseconds. It complements experiment while also offering a way to follow processes difficult to discern with experimental techniques. Numerous software packages exist for conducting MD simulations of which one of the widest used is termed Amber. Here, we outline the most recent developments, since version 9 was released in April 2006, of the Amber and AmberTools MD software packages, referred to here as simply the Amber package. The latest release represents six years of continued development, since version 9, by multiple research groups and the culmination of over 33 years of work beginning with the first version in 1979. The latest release of the Amber package, version 12 released in April 2012, includes a substantial number of important developments in both the scientific and computer science arenas. We present here a condensed vision of what Amber currently supports and where things are likely to head over the coming years. Figure 1 shows the performance in ns/day of the Amber package version 12 on a single‐core AMD FX‐8120 8‐Core 3.6GHz CPU, the Cray XT5 system, and a single GPU GTX680. © 2012 John Wiley & Sons, Ltd. This article is categorized under: Software > Molecular Modeling

The Protein Data Bank
Helen M. Berman, Tammy Battistuz, Talapady N. Bhat, Wolfgang F. Bluhm +4 more
2002· Acta Crystallographica Section D Biological Crystallography2.7Kdoi:10.1107/s0907444902003451

The Protein Data Bank [PDB; Berman, Westbrook et al. (2000), Nucleic Acids Res. 28, 235-242; http://www.pdb.org/] is the single worldwide archive of primary structural data of biological macromolecules. Many secondary sources of information are derived from PDB data. It is the starting point for studies in structural bioinformatics. This article describes the goals of the PDB, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource. The reader should come away with an understanding of the scope of the PDB and what is provided by the resource.

Planck 2018 results
Y. Akrami, F. Arroja, M. Ashdown, J. Aumont +4 more
2019· Astronomy and Astrophysics2.5Kdoi:10.1051/0004-6361/201833887

We report on the implications for cosmic inflation of the 2018 release of the Planck cosmic microwave background (CMB) anisotropy measurements. The results are fully consistent with those reported using the data from the two previous Planck cosmological releases, but have smaller uncertainties thanks to improvements in the characterization of polarization at low and high multipoles. Planck temperature, polarization, and lensing data determine the spectral index of scalar perturbations to be n s = 0.9649 ± 0.0042 at 68% CL. We find no evidence for a scale dependence of n s , either as a running or as a running of the running. The Universe is found to be consistent with spatial flatness with a precision of 0.4% at 95% CL by combining Planck with a compilation of baryon acoustic oscillation data. The Planck 95% CL upper limit on the tensor-to-scalar ratio, r 0.002 < 0.10, is further tightened by combining with the BICEP2/Keck Array BK15 data to obtain r 0.002 < 0.056. In the framework of standard single-field inflationary models with Einstein gravity, these results imply that: (a) the predictions of slow-roll models with a concave potential, V ″( ϕ ) < 0, are increasingly favoured by the data; and (b) based on two different methods for reconstructing the inflaton potential, we find no evidence for dynamics beyond slow roll. Three different methods for the non-parametric reconstruction of the primordial power spectrum consistently confirm a pure power law in the range of comoving scales 0.005 Mpc −1 ≲ k ≲ 0.2 Mpc −1 . A complementary analysis also finds no evidence for theoretically motivated parameterized features in the Planck power spectra. For the case of oscillatory features that are logarithmic or linear in k , this result is further strengthened by a new combined analysis including the Planck bispectrum data. The new Planck polarization data provide a stringent test of the adiabaticity of the initial conditions for the cosmological fluctuations. In correlated, mixed adiabatic and isocurvature models, the non-adiabatic contribution to the observed CMB temperature variance is constrained to 1.3%, 1.7%, and 1.7% at 95% CL for cold dark matter, neutrino density, and neutrino velocity, respectively. Planck power spectra plus lensing set constraints on the amplitude of compensated cold dark matter-baryon isocurvature perturbations that are consistent with current complementary measurements. The polarization data also provide improved constraints on inflationary models that predict a small statistically anisotropic quadupolar modulation of the primordial fluctuations. However, the polarization data do not support physical models for a scale-dependent dipolar modulation. All these findings support the key predictions of the standard single-field inflationary models, which will be further tested by future cosmological observations.

Routine Microsecond Molecular Dynamics Simulations with AMBER on GPUs. 1. Generalized Born
Andreas W. Götz, Mark J. Williamson, Dong Xu, Duncan Poole +2 more
2012· Journal of Chemical Theory and Computation2.2Kdoi:10.1021/ct200909j

We present an implementation of generalized Born implicit solvent all-atom classical molecular dynamics (MD) within the AMBER program package that runs entirely on CUDA enabled NVIDIA graphics processing units (GPUs). We discuss the algorithms that are used to exploit the processing power of the GPUs and show the performance that can be achieved in comparison to simulations on conventional CPU clusters. The implementation supports three different precision models in which the contributions to the forces are calculated in single precision floating point arithmetic but accumulated in double precision (SPDP), or everything is computed in single precision (SPSP) or double precision (DPDP). In addition to performance, we have focused on understanding the implications of the different precision models on the outcome of implicit solvent MD simulations. We show results for a range of tests including the accuracy of single point force evaluations and energy conservation as well as structural properties pertainining to protein dynamics. The numerical noise due to rounding errors within the SPSP precision model is sufficiently large to lead to an accumulation of errors which can result in unphysical trajectories for long time scale simulations. We recommend the use of the mixed-precision SPDP model since the numerical results obtained are comparable with those of the full double precision DPDP model and the reference double precision CPU implementation but at significantly reduced computational cost. Our implementation provides performance for GB simulations on a single desktop that is on par with, and in some cases exceeds, that of traditional supercomputers.

Protein structure alignment by incremental combinatorial extension (CE) of the optimal path
Ilya N. Shindyalov, Philip E. Bourne
1998· Protein Engineering Design and Selection2.1Kdoi:10.1093/protein/11.9.739

A new algorithm is reported which builds an alignment between two protein structures. The algorithm involves a combinatorial extension (CE) of an alignment path defined by aligned fragment pairs (AFPs) rather than the more conventional techniques using dynamic programming and Monte Carlo optimization. AFPs, as the name suggests, are pairs of fragments, one from each protein, which confer structure similarity. AFPs are based on local geometry, rather than global features such as orientation of secondary structures and overall topology. Combinations of AFPs that represent possible continuous alignment paths are selectively extended or discarded thereby leading to a single optimal alignment. The algorithm is fast and accurate in finding an optimal structure alignment and hence suitable for database scanning and detailed analysis of large protein families. The method has been tested and compared with results from Dali and VAST using a representative sample of similar structures. Several new structural similarities not detected by these other methods are reported. Specific one-on-one alignments and searches against all structures as found in the Protein Data Bank (PDB) can be performed via the Web at http://cl.sdsc.edu/ce.html.

AmberTools
David A. Case, Hasan Metin Aktulga, Kellon Belfon, David S. Cerutti +4 more
2023· Journal of Chemical Information and Modeling2.1Kdoi:10.1021/acs.jcim.3c01153

High Resolution Image Download MS PowerPoint Slide AmberTools is a free and open-source collection of programs used to set up, run, and analyze molecular simulations. The newer features contained within AmberTools23 are briefly described in this Application note.

A comprehensive classification system for lipids
Eoin Fahy, Shankar Subramaniam, H. Alex Brown, Christopher K. Glass +4 more
2005· Journal of Lipid Research1.8Kdoi:10.1194/jlr.e400004-jlr200

Lipids are produced, transported, and recognized by the concerted actions of numerous enzymes, binding proteins, and receptors. A comprehensive analysis of lipid molecules, "lipidomics," in the context of genomics and proteomics is crucial to understanding cellular physiology and pathology; consequently, lipid biology has become a major research target of the postgenomic revolution and systems biology. To facilitate international communication about lipids, a comprehensive classification of lipids with a common platform that is compatible with informatics requirements has been developed to deal with the massive amounts of data that will be generated by our lipid community. As an initial step in this development, we divide lipids into eight categories (fatty acyls, glycerolipids, glycerophospholipids, sphingolipids, sterol lipids, prenol lipids, saccharolipids, and polyketides) containing distinct classes and subclasses of molecules, devise a common manner of representing the chemical structures of individual lipids and their derivatives, and provide a 12 digit identifier for each unique lipid molecule. The lipid classification scheme is chemically based and driven by the distinct hydrophobic and hydrophilic elements that compose the lipid. This structured vocabulary will facilitate the systematization of lipid biology and enable the cataloging of lipids and their properties in a way that is compatible with other macromolecular databases.

Planck 2018 results
N. Aghanim, Y. Akrami, M. Ashdown, J. Aumont +4 more
2021· Astronomy and Astrophysics1.8Kdoi:10.1051/0004-6361/201833910e

In the original version, the bounds given in Eqs. (87a) and (87b) on the contribution to the early-time optical depth, (15,30), contained a numerical error in deriving the 95th percentile from the Monte Carlo samples. The corrected 95% upper bounds are: τ(15,30) < 0:018 (lowE, flat τ(15, 30), FlexKnot), (1) τ(15, 30) < 0:023 (lowE, flat knot, FlexKnot): (2) These bounds are a factor of 3 larger than the originally reported results. Consequently, the new bounds do not significantly improve upon previous results from Planck data presented in Millea & Bouchet (2018) as was stated, but are instead comparable. Equations (1) and (2) give results that are now similar to those of Heinrich & Hu (2021), who used the same Planck 2018 data to derive a 95% upper bound of 0.020 using the principal component analysis (PCA) model and uniform priors on the PCA mode amplitudes.

Update of the LIPID MAPS comprehensive classification system for lipids
Eoin Fahy, Shankar Subramaniam, Robert C. Murphy, Masahiro Nishijima +4 more
2008· Journal of Lipid Research1.8Kdoi:10.1194/jlr.r800095-jlr200

In 2005, the International Lipid Classification and Nomenclature Committee under the sponsorship of the LIPID MAPS Consortium developed and established a "Comprehensive Classification System for Lipids" based on well-defined chemical and biochemical principles and using an ontology that is extensible, flexible, and scalable. This classification system, which is compatible with contemporary databasing and informatics needs, has now been accepted internationally and widely adopted. In response to considerable attention and requests from lipid researchers from around the globe and in a variety of fields, the comprehensive classification system has undergone significant revisions over the last few years to more fully represent lipid structures from a wider variety of sources and to provide additional levels of detail as necessary. The details of this classification system are reviewed and updated and are presented here, along with revisions to its suggested nomenclature and structure-drawing recommendations for lipids.

Structures of the CXCR4 Chemokine GPCR with Small-Molecule and Cyclic Peptide Antagonists
Beili Wu, Ellen Y. T. Chien, Clifford D. Mol, Gustavo Fenalti +4 more
2010· Science1.8Kdoi:10.1126/science.1194396

Chemokine receptors are critical regulators of cell migration in the context of immune surveillance, inflammation, and development. The G protein-coupled chemokine receptor CXCR4 is specifically implicated in cancer metastasis and HIV-1 infection. Here we report five independent crystal structures of CXCR4 bound to an antagonist small molecule IT1t and a cyclic peptide CVX15 at 2.5 to 3.2 angstrom resolution. All structures reveal a consistent homodimer with an interface including helices V and VI that may be involved in regulating signaling. The location and shape of the ligand-binding sites differ from other G protein-coupled receptors and are closer to the extracellular surface. These structures provide new clues about the interactions between CXCR4 and its natural ligand CXCL12, and with the HIV-1 glycoprotein gp120.

Crystal Structure of the Catalytic Subunit of Cyclic Adenosine Monophosphate-Dependent Protein Kinase
Daniel R. Knighton, Jianhua Zheng, Lynn F. Ten Eyck, V. Ashford +3 more
1991· Science1.8Kdoi:10.1126/science.1862342

The crystal structure of the catalytic subunit of cyclic adenosine monophosphate-dependent protein kinase complexed with a 20-amino acid substrate analog inhibitor has been solved and partially refined at 2.7 A resolution to an R factor of 0.212. The magnesium adenosine triphosphate (MgATP) binding site was located by difference Fourier synthesis. The enzyme structure is bilobal with a deep cleft between the lobes. The cleft is filled by MgATP and a portion of the inhibitor peptide. The smaller lobe, consisting mostly of amino-terminal sequence, is associated with nucleotide binding, and its largely antiparallel beta sheet architecture constitutes an unusual nucleotide binding motif. The larger lobe is dominated by helical structure with a single beta sheet at the domain interface. This lobe is primarily involved in peptide binding and catalysis. Residues 40 through 280 constitute a conserved catalytic core that is shared by more than 100 protein kinases. Most of the invariant amino acids in this conserved catalytic core are clustered at the sites of nucleotide binding and catalysis.

ElliPro: a new structure-based tool for the prediction of antibody epitopes
Julia Ponomarenko, Huynh‐Hoa Bui, Wei Li, Nicholas Fusseder +3 more
2008· BMC Bioinformatics1.8Kdoi:10.1186/1471-2105-9-514

BACKGROUND: Reliable prediction of antibody, or B-cell, epitopes remains challenging yet highly desirable for the design of vaccines and immunodiagnostics. A correlation between antigenicity, solvent accessibility, and flexibility in proteins was demonstrated. Subsequently, Thornton and colleagues proposed a method for identifying continuous epitopes in the protein regions protruding from the protein's globular surface. The aim of this work was to implement that method as a web-tool and evaluate its performance on discontinuous epitopes known from the structures of antibody-protein complexes. RESULTS: Here we present ElliPro, a web-tool that implements Thornton's method and, together with a residue clustering algorithm, the MODELLER program and the Jmol viewer, allows the prediction and visualization of antibody epitopes in a given protein sequence or structure. ElliPro has been tested on a benchmark dataset of discontinuous epitopes inferred from 3D structures of antibody-protein complexes. In comparison with six other structure-based methods that can be used for epitope prediction, ElliPro performed the best and gave an AUC value of 0.732, when the most significant prediction was considered for each protein. Since the rank of the best prediction was at most in the top three for more than 70% of proteins and never exceeded five, ElliPro is considered a useful research tool for identifying antibody epitopes in protein antigens. ElliPro is available at http://tools.immuneepitope.org/tools/ElliPro. CONCLUSION: The results from ElliPro suggest that further research on antibody epitopes considering more features that discriminate epitopes from non-epitopes may further improve predictions. As ElliPro is based on the geometrical properties of protein structure and does not require training, it might be more generally applied for predicting different types of protein-protein interactions.

Planck 2018 results
N. Aghanim, Y. Akrami, Frederico Arroja, M. Ashdown +4 more
2019· Astronomy and Astrophysics1.7Kdoi:10.1051/0004-6361/201833880

The European Space Agency’s Planck satellite, which was dedicated to studying the early Universe and its subsequent evolution, was launched on 14 May 2009. It scanned the microwave and submillimetre sky continuously between 12 August 2009 and 23 October 2013, producing deep, high-resolution, all-sky maps in nine frequency bands from 30 to 857 GHz. This paper presents the cosmological legacy of Planck , which currently provides our strongest constraints on the parameters of the standard cosmological model and some of the tightest limits available on deviations from that model. The 6-parameter ΛCDM model continues to provide an excellent fit to the cosmic microwave background data at high and low redshift, describing the cosmological information in over a billion map pixels with just six parameters. With 18 peaks in the temperature and polarization angular power spectra constrained well, Planck measures five of the six parameters to better than 1% (simultaneously), with the best-determined parameter ( θ * ) now known to 0.03%. We describe the multi-component sky as seen by Planck , the success of the ΛCDM model, and the connection to lower-redshift probes of structure formation. We also give a comprehensive summary of the major changes introduced in this 2018 release. The Planck data, alone and in combination with other probes, provide stringent constraints on our models of the early Universe and the large-scale structure within which all astrophysical objects form and evolve. We discuss some lessons learned from the Planck mission, and highlight areas ripe for further experimental advances.