Cell-to-Cell Interactions and Signals Involved in the Reconstitution of Peripheral CD8(+) T-CM and T-EM Cell Pools

We here describe novel aspects of CD8(+) and CD4(+) T cell subset interactions that may be clinically relevant and provide new tools for regulating the reconstitution of the peripheral CD8(+) T cell pools in immune-deficient states. We show that the reconstitution capacity of transferred isolated naive CD8(+) T cells and their differentiation of effector functions is limited, but both dramatically increase upon the co-transfer of CD4(+) T cells. This helper effect is complex and determined by multiple factors. It was directly correlated to the number of helper cells, required the continuous presence of the CD4(+) T cells, dependent on host antigen-presenting cells (APCs) expressing CD40 and on the formation of CD4/CD8/APC cell clusters. By comparing the recovery of (CD44(+)CD62L(high)) T-CM and (CD44(+)CD62L(low)) T-EM CD8(+) T cells, we found that the accumulation of TCM and TEM subsets is differentially regulated. T-CM-cell accumulation depended mainly on type I interferons, interleukin (IL)-6, and IL-15, but was independent of CD4(+) T-cell help. In contrast, TEM-cell expansion was mainly determined by CD4(+) T-cell help and dependent on the expression of IL-2R beta by CD8 cells, on IL-2 produced by CD4(+) T-cells, on IL-15 and to a minor extent on IL-6.

Deficiency of the ferrous iron transporter FeoAB is linked with metronidazole resistance in Bacteroides fragilis

Background Metronidazole is the most commonly used antimicrobial for Bacteroides fragilis infections and is recommended for prophylaxis of colorectal surgery. Metronidazole resistance is increasing and the mechanisms of resistance are not clear.

Methods A transposon mutant library was generated in B. fragilis 638R (BF638R) to identify the genetic loci associated with resistance to metronidazole.

Results Thirty-two independently isolated metronidazole-resistant mutants had a transposon insertion in BF638R_1421 that encodes the ferrous transport fusion protein (feoAB). Deletion of feoAB resulted in a 10-fold increased MIC of metronidazole for the strain. The metronidazole MIC for the feoAB mutant was similar to that for the parent strain when grown on media supplemented with excess iron, suggesting that the increase seen in the MIC of metronidazole was due to reduced cellular iron transport in the feoAB mutant. The furA gene repressed feoAB transcription in an iron-dependent manner and disruption of furA resulted in constitutive transcription of feoAB, regardless of whether or not iron was present. However, disruption of feoAB also diminished the capacity of BF638R to grow in a mouse intraperitoneal abscess model, suggesting that inorganic ferrous iron assimilation is essential for B. fragilis survival in vivo.

Conclusions Selection for feoAB mutations as a result of metronidazole treatment will disable the pathogenic potential of B. fragilis and could contribute to the clinical efficacy of metronidazole. While mutations in feoAB are probably not a direct cause of clinical resistance, this study provides a key insight into intracellular metronidazole activity and the link with intracellular iron homeostasis.

IDS: A Divide-and-Conquer Algorithm for Inference in Polytree-Shaped Credal Networks

A credal network is a graph-theoretic model that represents imprecision in joint probability distributions. An inference in a credal net aims at computing an interval for the probability of an event of interest. Algorithms for inference in credal networks can be divided into exact and approximate. The selection of an algorithm is based on a trade off that ponders how much time someone wants to spend in a particular calculation against the quality of the computed values. This paper presents an algorithm, called IDS, that combines exact and approximate methods for computing inferences in polytree-shaped credal networks. The algorithm provides an approach to trade time and precision when making inferences in credal nets

Probabilistic logic with independence

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks.

Integração de evidências em redes credais e a regra de Jeffrey

Credal networks provide a scheme for dealing with imprecise probabilistic models. The inference algorithms often used in credal networks compute the interval of the posterior probability of an event of interest given evidence of the specific kind -- evidence that describe the current state of a set of variables. These algorithms do not perform evidential reasoning in case of the evidence must be processed according to the conditioning rule proposed by RC Jeffrey. This paper describes a procedure to integrate evidence with Jeffrey's rule when performing inferences with credal nets.

Propositional and Relational Bayesian Networks Associated with Imprecise and Qualitative Probabilistic Assessments

This paper investigates a representation language with flexibility inspired by probabilistic logic and compactness inspired by relational Bayesian networks. The goal is to handle propositional and first-order constructs together with precise, imprecise, indeterminate and qualitative probabilistic assessments. The paper shows how this can be achieved through the theory of credal networks. New exact and approximate inference algorithms based on multilinear programming and iterated/loopy propagation of interval probabilities are presented; their superior performance, compared to existing ones, is shown empirically.

Inference in Polytrees with Sets of Probabilities

Inferences in directed acyclic graphs associated with probability intervals and sets of probabilities are NP-hard, even for polytrees. We propose: 1) an improvement on Tessem’s A/R algorithm for inferences on polytrees associated with probability intervals; 2) a new algorithm for approximate inferences based on local search; 3) branch-and-bound algorithms that combine the previous techniques. The first two algorithms produce complementary approximate solutions, while branch-and-bound procedures can generate either exact or approximate solutions. We report improvements on existing techniques for inference with probability sets and intervals, in some cases reducing computational effort by several orders of magnitude.