Asparagine requirement in Plasmodium berghei as a target to prevent malaria transmission and liver infections

The proteins of Plasmodium, the malaria parasite, are strikingly rich in asparagine. Plasmodium depends primarily on host haemoglobin degradation for amino acids and has a rudimentary pathway for amino acid biosynthesis, but retains a gene encoding asparagine synthetase (AS). Here we show that deletion of AS in Plasmodium berghei (Pb) delays the asexual-and liver-stage development with substantial reduction in the formation of ookinetes, oocysts and sporozoites in mosquitoes. In the absence of asparagine synthesis, extracellular asparagine supports suboptimal survival of PbAS knockout (KO) parasites. Depletion of blood asparagine levels by treating PbASKO-infected mice with asparaginase completely prevents the development of liver stages, exflagellation of male gametocytes and the subsequent formation of sexual stages. In vivo supplementation of asparagine in mice restores the exflagellation of PbASKO parasites. Thus, the parasite life cycle has an absolute requirement for asparagine, which we propose could be targeted to prevent malaria transmission and liver infections.

Falcon: A Graph Manipulation Language for Heterogeneous Systems

Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.