Status of the crystallography beamlines at Elettra

Elettra is one of the first 3rd-generation storage rings, recently upgraded to routinely operate in top-up mode at both 2.0 and 2.4 GeV. The facility hosts four dedicated beamlines for crystallography, two open to the users and two under construction, and expected to be ready for public use in 2015. In service since 1994, XRD1 is a general-purpose diffraction beamline. The light source for this wide (4-21 keV) energy range beamline is a permanent magnet wiggler. XRD1 covers experiments ranging from grazing incidence X-ray diffraction to macromolecular crystallography, from industrial applications of powder diffraction to X-ray phasing with long wavelengths. The bending magnet powder diffraction beamline MCX has been open to users since 2009, with a focus on microstructural investigations and studies under non-ambient conditions. A superconducting wiggler delivers a high photon flux to a new fully automated beamline dedicated to macromolecular crystallography and to a branch beamline hosting a high-pressure powder X-ray diffraction station (both currently under construction). Users of the latter experimental station will have access to a specialized sample preparation laboratory, shared with the SISSI infrared beamline. A high throughput crystallization platform equipped with an imaging system for the remote viewing, evaluation and scoring of the macromolecular crystallization experiments has also been established and is open to the user community.

Chemical Shifts to Metabolic Pathways: Identifying Metabolic Pathways Directly from a Single 2D NMR Spectrum

Identifying cellular processes in terms of metabolic pathways is one of the avowed goals of metabolomics studies. Currently, this is done after relevant metabolites are identified to allow their mapping onto specific pathways. This task is daunting due to the complex nature of cellular processes and the difficulty in establishing the identity of individual metabolites. We propose here a new method: ChemSMP (Chemical Shifts to Metabolic Pathways), which facilitates rapid analysis by identifying the active metabolic pathways directly from chemical shifts obtained from a single two-dimensional (2D) C-13-H-1] correlation NMR spectrum without the need for identification and assignment of individual metabolites. ChemSMP uses a novel indexing and scoring system comprised of a ``uniqueness score'' and a ``coverage score''. Our method is demonstrated on metabolic pathways data from the Small Molecule Pathway Database (SMPDB) and chemical shifts from the Human Metabolome Database (HMDB). Benchmarks show that ChemSMP has a positive prediction rate of >90% in the presence of deduttered data and can sustain the same at 60-70% even in the presence of noise, such as deletions of peaks and chemical shift deviations. The method tested on NMR data acquired for a mixture of 20 amino acids shows a success rate of 93% in correct recovery of pathways. When used on data obtained from the cell lysate of an unexplored oncogenic cell line, it revealed active metabolic pathways responsible for regulating energy homeostasis of cancer cells. Our unique tool is thus expected to significantly enhance analysis of NMIR-based metabolomics data by reducing existing impediments.

Kernelization complexity of possible winner and coalitional manipulation problems in voting

In the POSSIBLE WINNER problem in computational social choice theory, we are given a set of partial preferences and the question is whether a distinguished candidate could be made winner by extending the partial preferences to linear preferences. Previous work has provided, for many common voting rules, fixed parameter tractable algorithms for the POSSIBLE WINNER problem, with number of candidates as the parameter. However, the corresponding kernelization question is still open and in fact, has been mentioned as a key research challenge 10]. In this paper, we settle this open question for many common voting rules. We show that the POSSIBLE WINNER problem for maximin, Copeland, Bucklin, ranked pairs, and a class of scoring rules that includes the Borda voting rule does not admit a polynomial kernel with the number of candidates as the parameter. We show however that the COALITIONAL MANIPULATION problem which is an important special case of the POSSIBLE WINNER problem does admit a polynomial kernel for maximin, Copeland, ranked pairs, and a class of scoring rules that includes the Borda voting rule, when the number of manipulators is polynomial in the number of candidates. A significant conclusion of our work is that the POSSIBLE WINNER problem is harder than the COALITIONAL MANIPULATION problem since the COALITIONAL MANIPULATION problem admits a polynomial kernel whereas the POSSIBLE WINNER problem does not admit a polynomial kernel. (C) 2015 Elsevier B.V. All rights reserved.