Ce-Duox1/BLI-3 Generated Reactive Oxygen Species Trigger Protective SKN-1 Activity via p38 MAPK Signaling during Infection in C. elegans

Infected animals will produce reactive oxygen species (ROS) and other inflammatory molecules that help fight pathogens, but can inadvertently damage host tissue. Therefore specific responses, which protect and repair against the collateral damage caused by the immune response, are critical for successfully surviving pathogen attack. We previously demonstrated that ROS are generated during infection in the model host Caenorhabditis elegans by the dual oxidase Ce-Duox1/BLI-3. Herein, an important connection between ROS generation by Ce-Duox1/BLI-3 and upregulation of a protective transcriptional response by SKN-1 is established in the context of infection. SKN-1 is an ortholog of the mammalian Nrf transcription factors and has previously been documented to promote survival, following oxidative stress, by upregulating genes involved in the detoxification of ROS and other reactive compounds. Using qRT-PCR, transcriptional reporter fusions, and a translational fusion, SKN-1 is shown to become highly active in the C. elegans intestine upon exposure to the human bacterial pathogens, Enterococcus faecalis and Pseudomonas aeruginosa. Activation is dependent on the overall pathogenicity of the bacterium, demonstrated by a weakened response observed in attenuated mutants of these pathogens. Previous work demonstrated a role for p38 MAPK signaling both in pathogen resistance and in activating SKN-1 upon exposure to chemically induced oxidative stress. We show that NSY-1, SEK-1 and PMK-1 are also required for SKN-1 activity during infection. Evidence is also presented that the ROS produced by Ce-Duox1/BLI-3 is the source of SKN-1 activation via p38 MAPK signaling during infection. Finally, for the first time, SKN-1 activity is shown to be protective during infection; loss of skn-1 decreases resistance, whereas increasing SKN-1 activity augments resistance to pathogen. Overall, a model is presented in which ROS generation by Ce-Duox1/BLI-3 activates a protective SKN-1 response via p38 MAPK signaling

Characterization of an Artificial Swine-Origin Influenza Virus with the Same Gene Combination as H1N1/2009 Virus: A Genesis Clue of Pandemic Strain

Pandemic H1N1/2009 influenza virus, derived from a reassortment of avian, human, and swine influenza viruses, possesses a unique gene segment combination that had not been detected previously in animal and human populations. Whether such a gene combination could result in the pathogenicity and transmission as H1N1/2009 virus remains unclear. In the present study, we used reverse genetics to construct a reassortant virus (rH1N1) with the same gene combination as H1N1/2009 virus (NA and M genes from a Eurasian avian-like H1N1 swine virus and another six genes from a North American triple-reassortant H1N2 swine virus). Characterization of rH1N1 in mice showed that this virus had higher replicability and pathogenicity than those of the seasonal human H1N1 and Eurasian avian-like swine H1N1 viruses, but was similar to the H1N1/2009 and triple-reassortant H1N2 viruses. Experiments performed on guinea pigs showed that rH1N1 was not transmissible, whereas pandemic H1N1/2009 displayed efficient transmissibility. To further determine which gene segment played a key role in transmissibility, we constructed a series of reassortants derived from rH1N1 and H1N1/2009 viruses. Direct contact transmission studies demonstrated that the HA and NS genes contributed to the transmission of H1N1/2009 virus. Second, the HA gene of H1N1/2009 virus, when combined with the H1N1/2009 NA gene, conferred efficient contact transmission among guinea pigs. The present results reveal that not only gene segment reassortment but also amino acid mutation were needed for the generation of the pandemic influenza virus

Parameterized Complexity for Uniform Operators on Multidimensional Analytic Functions and ODE Solving

International audienceReal complexity theory is a resource-bounded refinement of computable analysis and provides a realistic notion of running time of computations over real numbers, sequences, and functions by relying on Turing machines to handle approximations of arbitrary but guaranteed absolute error. Classical results in real complexity show that important numerical operators can map polynomial time computable functions to functions that are hard for some higher complexity class like NP or #P. Restricted to analytic functions, however, those operators map polynomial time computable functions again to polynomial time computable functions. Recent work by Kawamura, Müller, Rösnick and Ziegler discusses how to extend this to uniform algorithms on one-dimensional analytic functions over simple compact domains using second-order and parameterized complexity. In this paper, we extend some of their results to the case of multidimensional analytic functions. We further use this to show that the operator mapping an analytic ordinary differential equations to its solution is computable in parameterized polynomial time. Finally, we discuss how the theory can be used as a basis for verified exact numerical computation with analytic functions and provide a prototypical implementation in the iRRAM C++ framework for exact real arithmetic