Complete immunization against Trypanosoma cruzi verified in individual mice by complement-mediated lysis

Experimental systems to assay immunity against Trypanosoma cruzi usually demonstrate partial resistance without excluding the establishment of sub-patent infections in protected animals. To test whether Swiss mice immunized with attenuated parasites might develop complete resistance against virulent T. cruzi, experiments were performed involving challenge with low numbers of parasites, enhancement of local inflammation and the combination of natural and acquired resistance. Absence of infection was established after repeated negative parasitological tests (including xenodiagnosis and hemoculture), and lack of lytic antibody was tested by complement mediated lysis. Immunization with 10(7) attenuated epimastigotes conferred protection against the development of high levels of parasitemia after challenge with Tulahuen strain, but was unable to reduce the number of infected animals. However, when a strong, delayed-type hypersensitivity reaction was triggered at the site of infection by injecting a mixture of virulent and attenuated T. cruzi, a significant proportion of immunized animals remained totally free of virulent infection. The same result was obtained when the immunization experiment was performed in four month old Swiss mice, displaying a relatively high natural resistance and challenged with wild, vector-borne parasites. These experiments demonstrate that complete resistance against T. cruzi can be obtained in a significant proportion of animals, under conditions which replicate natural, vector delivered infection by the parasite.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs

In a seminal paper [10], Weitz gave a deterministic fully polynomial approximation scheme for counting exponentially weighted independent sets (which is the same as approximating the partition function of the hard-core model from statistical physics) in graphs of degree at most d, up to the critical activity for the uniqueness of the Gibbs measure on the innite d-regular tree. ore recently Sly [8] (see also [1]) showed that this is optimal in the sense that if here is an FPRAS for the hard-core partition function on graphs of maximum egree d for activities larger than the critical activity on the innite d-regular ree then NP = RP. In this paper we extend Weitz's approach to derive a deterministic fully polynomial approximation scheme for the partition function of general two-state anti-ferromagnetic spin systems on graphs of maximum degree d, up to the corresponding critical point on the d-regular tree. The main ingredient of our result is a proof that for two-state anti-ferromagnetic spin systems on the d-regular tree, weak spatial mixing implies strong spatial mixing. his in turn uses a message-decay argument which extends a similar approach proposed recently for the hard-core model by Restrepo et al [7] to the case of general two-state anti-ferromagnetic spin systems.

Resolution of an Infection with Leishmania braziliensis Confers Complete Protection to a Subsequent Challenge with Leishmania major in BALB/c Mice

Both Leishmania major and L. braziliensis induce cutaneous leishmaniasis in BALB/c mice. Whereas BALB/c mice die of infection with L. major, they cure an infection with L. braziliensis. We report here that after curing an infection with L. braziliensis, BALB/c mice are resistant to challenge with L. major. When challenged with L. major, L. braziliensis pre-treated BALB/c mice mounted a delayed-type hypersensitivity response to L. major and produced high amounts of interferon-g (IFN-g ) but low amounts of interleukin-4. The IFN-g produced by the L. braziliensis pre-infected mice was involved in the protection seen against L. major challenge since treating the mice with a neutralizing anti-IFN-g abrogated the protection. This suggests that cross-reactive antigen epitopes exist between L. braziliensis and L. major and that pre-infection with L. braziliensis primes BALB/c mice to epitopes on L. major that can elicit a protective Th1 response to the parasite.

Comparing Multilevel Clustering Methods on Weighted Graphs : The Case of Worldwide Air Passenger Traffic 2000-2004

Specific properties emerge from the structure of large networks, such as that of worldwide air traffic, including a highly hierarchical node structure and multi-level small world sub-groups that strongly influence future dynamics. We have developed clustering methods to understand the form of these structures, to identify structural properties, and to evaluate the effects of these properties. Graph clustering methods are often constructed from different components: a metric, a clustering index, and a modularity measure to assess the quality of a clustering method. To understand the impact of each of these components on the clustering method, we explore and compare different combinations. These different combinations are used to compare multilevel clustering methods to delineate the effects of geographical distance, hubs, network densities, and bridges on worldwide air passenger traffic. The ultimate goal of this methodological research is to demonstrate evidence of combined effects in the development of an air traffic network. In fact, the network can be divided into different levels of âeurooecohesionâeuro, which can be qualified and measured by comparative studies (Newman, 2002; Guimera et al., 2005; Sales-Pardo et al., 2007).

Complete nucleotide sequence analysis of a Brazilian dengue virus type 2 strain

In the last decade, dengue fever (DF) in Brazil has been recognized as an important public health problem, and an increasing number of dengue haemorrhagic fever (DHF) cases have been reported since the introduction of dengue virus type 2 (DEN-2) into the country in 1990. In order to analyze the complete genome sequence of a DEN-2 Brazilian strain (BR64022/98), we designed primers to amplify contiguous segments of approximately 500 base pairs across the entire sequence of the viral genome. Twenty fragments amplified by reverse transcriptase-PCR were cloned, and the complete nucleotide and the deduced amino acid sequences were determined. This constitutes the first complete genetic characterization of a DEN-2 strain from Brazil. All amino acid changes differentiating strains related to the Asian/American-Asian genotype were observed in BR64022/98, indicating the Asiatic origin of the strain.

On a family of strongly regular graphs with λ = 1

Vegeu el resum a l'inici del document del fitxer adjunt.

Angiostrongylus costaricensis: complete redescription of the migratory pathways based on experimental Sigmodon hispidus infection

Angiostrongylus costaricensis lives in the cecal and mesenteric arteries of its vertebrate hosts, and causes an inflammatory disease in humans. To investigate unknown aspects of the abdominal angiostrogyliasis pathogenesis, infected Sigmodon hispidus were sequentially studied in different times of infection. The study revealed that L3 goes alternatively through two migratory courses during its development into an adult worm: lymphatic/venous-arterial and venous portal pathways. The former is considered the principal one, because it is used by most of the larvae. Like other metastrongylides, A. costaricensis passes over the pulmonary circulation to migrate from the lymphatic system to the arterial circulation, where they circulate during some days before reaching their definitive habitat. The oviposition by mature females began on 15th day. Eggs and L1 were detected mainly in the intestine and stomach, surrounded by inflammatory reaction constituted by macrophages, monocytes, and eosinophils. They were also spread to the lungs, mesenteric lymph nodes, pancreas, spleen, and kidneys. The larvae (L1) exhibited the centripetal capacity to invade the lymphatic and venous vessels of the intestine and mesentery. Adult worms that developed in the venous intrahepatic pathway migrated downstream to reach the mesenteric veins and laid eggs that embolized in the portal hepatic vessels.

Complete genetic characterization of a Brazilian dengue virus type 3 strain isolated from a fatal outcome

We have determined the complete nucleotide and the deduced amino acid sequences of Brazilian dengue virus type 3 (DENV-3) from a dengue case with fatal outcome, which occurred during an epidemic in the state of Rio de Janeiro, Brazil, in 2002. This constitutes the first complete genetic characterization of a Brazilian DENV-3 strain since its introduction into the country in 2001. DENV-3 was responsible for the most severe dengue epidemic in the state, based on the highest number of reported cases and on the severity of clinical manifestations and deaths reported.

Precursor-product relationship between vitellogenin and the yolk proteins as derived from the complete sequence of a Xenopus vitellogenin gene.

In Xenopus laevis four estrogen-responsive genes are expressed simultaneously to produce vitellogenin, the precursor of the yolk proteins. One of these four genes, the gene A2, was sequenced completely, as well as cDNAs representing 75% of the coding region of the gene. From this data the exon-intron structure of the gene was established, revealing 35 exons that give a transcript of 5,619 bp without the poly A-tail. This A2 transcript encodes a vitellogenin of 1,807 amino acids, whose structure is discussed with respect to its function. At the nucleic acid as well as at the protein level no extensive homologies with any sequences other than vitellogenin were observed. Comparison of the amino acid sequence of the vitellogenin A2 molecule with biochemical data obtained from the different yolk proteins allowed us to localize the cleavage products on the vitellogenin precursor as follows: NH2 - lipovitellin I - phosvitin (or phosvette II - phosvette I) - lipovitellin II - COOH.

The Complete Chromosomal Organization of the Reference Strain of the Leishmania Genome Project, L. major ;Friedlin'.

In recent years, analysis of the genomes of many organisms has received increasing international attention. The bulk of the effort to date has centred on the Human Genome Project and analysis of model organisms such as yeast, Drosophila and Caenorhabditis elegans. More recently, the revolution in genome sequencing and gene identification has begun to impact on infectious disease organisms. Initially, much of the effort was concentrated on prokaryotes, but small eukaryotic genomes, including the protozoan parasites Plasmodium, Toxoplasma and trypanosomatids (Leishmania, Trypanosoma brucei and T. cruzi), as well as some multicellular organisms, such as Brugia and Schistosoma, are benefiting from the technological advances of the genome era. These advances promise a radical new approach to the development of novel diagnostic tools, chemotherapeutic targets and vaccines for infectious disease organisms, as well as to the more detailed analysis of cell biology and function.Several networks or consortia linking laboratories around the world have been established to support these parasite genome projects[1] (for more information, see http://www.ebi.ac.uk/ parasites/paratable.html). Five of these networks were supported by an initiative launched in 1994 by the Specific Programme for Research and Tropical Diseases (TDR) of the WHO[2, 3, 4, 5, 6]. The Leishmania Genome Network (LGN) is one of these[3]. Its activities are reported at http://www.ebi.ac.uk/parasites/leish.html, and its current aim is to map and sequence the genome of Leishmania by the year 2002. All the mapping, hybridization and sequence data are also publicly available from LeishDB, an AceDB-based genome database (http://www.ebi.ac.uk/parasites/LGN/leissssoft.html).

Morbidity, survival, and site of recurrence after mediastinal lymph-node dissection versus systematic sampling after complete resection for non-small cell lung cancer

BACKGROUND: Mediastinal lymph-node dissection was compared to systematic mediastinal lymph-node sampling in patients undergoing complete resection for non-small cell lung cancer with respect to morbidity, duration of chest tube drainage and hospitalization, survival, disease-free survival, and site of recurrence. METHODS: A consecutive series of one hundred patients with non-small-cell lung cancer, clinical stage T1-3 N0-1 after standardized staging, was divided into two groups of 50 patients each, according to the technique of intraoperative mediastinal lymph-node assessment (dissection versus sampling). Mediastinal lymph-node dissection consisted of removal of all lymphatic tissues within defined anatomic landmarks of stations 2-4 and 7-9 on the right side, and stations 4-9 on the left side according to the classification of the American Thoracic Society. Systematic mediastinal lymph-node sampling consisted of harvesting of one or more representative lymph nodes from stations 2-4 and 7-9 on the right side, and stations 4-9 on the left side. RESULTS: All patients had complete resection. A mean follow-up time of 89 months was achieved in 92 patients. The two groups of patients were comparable with respect to age, gender, performance status, tumor stage, histology, extent of lung resection, and follow-up time. No significant difference was found between both groups regarding the duration of chest tube drainage, hospitalization, and morbidity. However, dissection required a longer operation time than sampling (179 +/- 38 min versus 149 +/- 37 min, p < 0.001). There was no significant difference in overall survival between the two groups; however, patients with stage I disease had a significantly longer disease-free survival after dissection than after sampling (60.2 +/- 7 versus 44.8 +/- 8 months, p < 0.03). Local recurrence was significantly higher after sampling than after dissection in patients with stage I tumor (12.5% versus 45%, p = 0.02) and in patients with nodal tumor negative mediastinum (N0/N1 disease) (46% versus 13%, p = 0.004). CONCLUSION: Our results suggest that mediastinal lymph-node dissection may provide a longer disease-free survival in stage I non-small cell lung cancer and, most importantly, a better local tumor control than mediastinal lymph-node sampling after complete resection for N0/N1 disease without leading to increased morbidity.