Global malnutrition overlaps with pollinator-dependent micronutrient production

Pollinators contribute around 10% of the economic value of crop production globally, but the contribution of these pollinators to human nutrition is potentially much higher. Crops vary in the degree to which they benefit from pollinators, and many of the most pollinator-dependent crops are also among the richest in micronutrients essential to human health. This study examines regional differences in the pollinator-dependence of crop micronutrient content and reveals overlaps between this dependency and the severity of micronutrient deficiency in people around the world. As much as 50% of the production of plant-derived sources of vitamin A requires pollination throughout much of Southeast Asia, while other essential micronutrients such as iron and folate have lower dependencies, scattered throughout Africa, Asia and Central America. Micronutrient deficiencies are three times as likely to occur in areas of highest pollination dependence for vitamin A and iron, suggesting that disruptions in pollination could have serious implications for the accessibility of micronutrients for public health. These regions of high nutritional vulnerability are understudied in the pollination literature, and should be priority areas for research related to ecosystem services and human well-being

The 3-Base Periodicity and Codon Usage of Coding Sequences Are Correlated with Gene Expression at the Level of Transcription Elongation

Background: Gene transcription is regulated by DNA transcriptional regulatory elements, promoters and enhancers that are located outside the coding regions. Here, we examine the characteristic 3-base periodicity of the coding sequences and analyse its correlation with the genome-wide transcriptional profile of yeast. Principal Findings: The analysis of coding sequences by a new class of indices proposed here identified two different sources of 3-base periodicity: the codon frequency and the codon sequence. In exponentially growing yeast cells, the codon-frequency component of periodicity accounts for 71.9 % of the variability of the cellular mRNA by a strong association with the density of elongating mRNA polymerase II complexes. The mRNA abundance explains most of the correlation between the codon-frequency component of periodicity and protein levels. Furthermore, pyrimidine-ending codons of the four-fold degenerate small amino acids alanine, glycine and valine are associated with genes with double the transcription rate of those associated with purine-ending codons. Conclusions: We demonstrate that the 3-base periodicity of coding sequences is higher than expected by the codon usage frequency (CUF) and that its components, associated with codon bias and amino acid composition, are correlated with gene expression, principally at the level of transcription elongation. This indicates a role of codon sequences in maximising the transcription efficiency in exponentially growing yeast cells. Moreover, the results contrast with the common Darwinia

Structural Analysis of Papain-Like NlpC/P60 Superfamily Enzymes with a Circularly Permuted Topology Reveals Potential Lipid Binding Sites

NlpC/P60 superfamily papain-like enzymes play important roles in all kingdoms of life. Two members of this superfamily, LRAT-like and YaeF/YiiX-like families, were predicted to contain a catalytic domain that is circularly permuted such that the catalytic cysteine is located near the C-terminus, instead of at the N-terminus. These permuted enzymes are widespread in virus, pathogenic bacteria, and eukaryotes. We determined the crystal structure of a member of the YaeF/YiiX-like family from Bacillus cereus in complex with lysine. The structure, which adopts a ligand-induced, “closed” conformation, confirms the circular permutation of catalytic residues. A comparative analysis of other related protein structures within the NlpC/P60 superfamily is presented. Permutated NlpC/P60 enzymes contain a similar conserved core and arrangement of catalytic residues, including a Cys/His-containing triad and an additional conserved tyrosine. More surprisingly, permuted enzymes have a hydrophobic S1 binding pocket that is distinct from previously characterized enzymes in the family, indicative of novel substrate specificity. Further analysis of a structural homolog, YiiX (PDB 2if6) identified a fatty acid in the conserved hydrophobic pocket, thus providing additional insights into possible function of these novel enzymes

Analysis of Pools of Targeted Salmonella Deletion Mutants Identifies Novel Genes Affecting Fitness during Competitive Infection in Mice

Pools of mutants of minimal complexity but maximal coverage of genes of interest facilitate screening for genes under selection in a particular environment. We constructed individual deletion mutants in 1,023 Salmonella enterica serovar Typhimurium genes, including almost all genes found in Salmonella but not in related genera. All mutations were confirmed simultaneously using a novel amplification strategy to produce labeled RNA from a T7 RNA polymerase promoter, introduced during the construction of each mutant, followed by hybridization of this labeled RNA to a Typhimurium genome tiling array. To demonstrate the ability to identify fitness phenotypes using our pool of mutants, the pool was subjected to selection by intraperitoneal injection into BALB/c mice and subsequent recovery from spleens. Changes in the representation of each mutant were monitored using T7 transcripts hybridized to a novel inexpensive minimal microarray. Among the top 120 statistically significant spleen colonization phenotypes, more than 40 were mutations in genes with no previously known role in this model. Fifteen phenotypes were tested using individual mutants in competitive assays of intraperitoneal infection in mice and eleven were confirmed, including the first two examples of attenuation for sRNA mutants in Salmonella. We refer to the method as Array-based analysis of cistrons under selection (ABACUS)

A GPU-Based Backtracking Algorithm for Permutation Combinatorial Problems

International audienceThis work presents a GPU-based backtracking algorithm for permutation combinatorial problems based on the Integer-Vector-Matrix (IVM) data structure. IVM is a data structure dedicated to permutation combinatorial optimization problems. In this algorithm, the load balancing is performed without intervention of the CPU, inside a work stealing phase invoked after each node expansion phase. The proposed work stealing approach uses a virtual n-dimensional hypercube topology and a triggering mechanism to reduce the overhead incurred by dynamic load balancing. We have implemented this new algorithm for solving instances of the Asymmetric Travelling Salesman Problem by implicit enumeration, a scenario where the cost of node evaluation is low, compared to the overall search procedure. Experimental results show that the dynamically load balanced IVM-algorithm reaches speed-ups up to 17X over a serial implementation using a bitset-data structure and up to 2X over its GPU counterpart