Local optima networks of hard combinatorial landscapes

Combinatorial optimization involves finding an optimal solution in a finite set of options; many everyday life problems are of this kind. However, the number of options grows exponentially with the size of the problem, such that an exhaustive search for the best solution is practically infeasible beyond a certain problem size. When efficient algorithms are not available, a practical approach to obtain an approximate solution to the problem at hand, is to start with an educated guess and gradually refine it until we have a good-enough solution. Roughly speaking, this is how local search heuristics work. These stochastic algorithms navigate the problem search space by iteratively turning the current solution into new candidate solutions, guiding the search towards better solutions. The search performance, therefore, depends on structural aspects of the search space, which in turn depend on the move operator being used to modify solutions. A common way to characterize the search space of a problem is through the study of its fitness landscape, a mathematical object comprising the space of all possible solutions, their value with respect to the optimization objective, and a relationship of neighborhood defined by the move operator. The landscape metaphor is used to explain the search dynamics as a sort of potential function. The concept is indeed similar to that of potential energy surfaces in physical chemistry. Borrowing ideas from that field, we propose to extend to combinatorial landscapes the notion of the inherent network formed by energy minima in energy landscapes. In our case, energy minima are the local optima of the combinatorial problem, and we explore several definitions for the network edges. At first, we perform an exhaustive sampling of local optima basins of attraction, and define weighted transitions between basins by accounting for all the possible ways of crossing the basins frontier via one random move. Then, we reduce the computational burden by only counting the chances of escaping a given basin via random kick moves that start at the local optimum. Finally, we approximate network edges from the search trajectory of simple search heuristics, mining the frequency and inter-arrival time with which the heuristic visits local optima. Through these methodologies, we build a weighted directed graph that provides a synthetic view of the whole landscape, and that we can characterize using the tools of complex networks science. We argue that the network characterization can advance our understanding of the structural and dynamical properties of hard combinatorial landscapes. We apply our approach to prototypical problems such as the Quadratic Assignment Problem, the NK model of rugged landscapes, and the Permutation Flow-shop Scheduling Problem. We show that some network metrics can differentiate problem classes, correlate with problem non-linearity, and predict problem hardness as measured from the performances of trajectory-based local search heuristics.

Notch1 and T-cell development: insights from conditional knockout mice.

Notch proteins influence cell-fate decisions in many developmental systems. Gain-of-function studies have suggested a crucial role for Notch1 signaling at several stages during lymphocyte development, including the B/T, alphabeta/gammadelta and CD4/CD8 lineage choices. Here, we critically re-evaluate these conclusions in the light of recent studies that describe inducible and tissue-specific targeting of the Notch1 gene.

Directed integration of new insulated lentiviral vectors to heterochromatin towards safer gene transfer to stem cells

The need for better gene transfer systems towards improved risk=benefit balance for patients remains a major challenge in the clinical translation of gene therapy (GT). We have investigated the improvement of integrating vectors safety in combining (i) new short synthetic genetic insulator elements (GIE) and (ii) directing genetic integration to heterochromatin. We have designed SIN-insulated retrovectors with two candidate GIEs and could identify a specific combination of insulator 2 repeats which translates into best functional activity, high titers and boundary effect in both gammaretro (p20) and lentivectors (DCaro4) (see Duros et al, abstract ibid). Since GIEs are believed to shield the transgenic cassette from inhibitory effects and silencing, DCaro4 has been further tested with chimeric HIV-1 derived integrases which comprise C-ter chromodomains targeting heterochromatin through either histone H3 (ML6chimera) or methylatedCpGislands (ML10). With DCaro4 only and both chimeras, a homogeneous expression is evidenced in over 20% of the cells which is sustained over time. With control lentivectors, less than 2% of cells express GFP as compared to background using a control double-mutant in both catalytic and ledgf binding-sites; in addition, a two-times increase of expression can be induced with histone deacetylase inhibitors. Our approach could significantly reduce integration into open chromatin sensitive sites in stem cells at the time of transduction, a feature which might significantly decrease subsequent genotoxicity, according to X-SCIDs patients data.Work performed with the support of EC-DG research within the FP6-Network of Excellence, CLINIGENE: LSHB-CT-2006-018933

In vivo conditional Pax4 overexpression in mature islet β-cells prevents stress-induced hyperglycemia in mice.

OBJECTIVE To establish the role of the transcription factor Pax4 in pancreatic islet expansion and survival in response to physiological stress and its impact on glucose metabolism, we generated transgenic mice conditionally and selectively overexpressing Pax4 or a diabetes-linked mutant variant (Pax4R129 W) in β-cells. RESEARCH DESIGN AND METHODS Glucose homeostasis and β-cell death and proliferation were assessed in Pax4- or Pax4R129 W-overexpressing transgenic animals challenged with or without streptozotocin. Isolated transgenic islets were also exposed to cytokines, and apoptosis was evaluated by DNA fragmentation or cytochrome C release. The expression profiles of proliferation and apoptotic genes and β-cell markers were studied by immunohistochemistry and quantitative RT-PCR. RESULTS Pax4 but not Pax4R129 W protected animals against streptozotocin-induced hyperglycemia and isolated islets from cytokine-mediated β-cell apoptosis. Cytochrome C release was abrogated in Pax4 islets treated with cytokines. Interleukin-1β transcript levels were suppressed in Pax4 islets, whereas they were increased along with NOS2 in Pax4R129 W islets. Bcl-2, Cdk4, and c-myc expression levels were increased in Pax4 islets while MafA, insulin, and GLUT2 transcript levels were suppressed in both animal models. Long-term Pax4 expression promoted proliferation of a Pdx1-positive cell subpopulation while impeding insulin secretion. Suppression of Pax4 rescued this defect with a concomitant increase in pancreatic insulin content. CONCLUSIONS Pax4 protects adult islets from stress-induced apoptosis by suppressing selective nuclear factor-κB target genes while increasing Bcl-2 levels. Furthermore, it promotes dedifferentiation and proliferation of β-cells through MafA repression, with a concomitant increase in Cdk4 and c-myc expression.

Lack of directed V alpha 14-J alpha 281 rearrangements in NK1+ T cells.

NK1.1+ T cells are an unusual subset of TCR alpha beta cells distinguished by their highly restricted V beta repertoire and predominant usage of an invariant V alpha 14-J alpha 281 chain. To assess whether a directed rearrangement mechanism could be responsible for this invariant alpha chain, we have analyzed V alpha 14 rearrangements by polymerase chain reaction and Southern blot in a panel of cloned T-T hybrids derived from thymic NK1.1+ T cells. As expected a high proportion (17/20) of the hybrids had rearranged V alpha 14 to J alpha 281. However, V alpha 14-J alpha 281 rearrangements always occurred on only one chromosome and were accompanied by other V alpha-J alpha rearrangements (not involving V alpha 14) on the homologous chromosome. These data argue that rigorous ligand selection rather than directed rearrangement is responsible for the high frequency of V alpha 14-J alpha 281 rearrangements in NK1.1+ T cells.

Generation of a recombinant mouse-human chimaeric monoclonal antibody directed against human carcinoembryonic antigen.

A procedure was devised for the identification and specific cloning of functionally rearranged variable region immunoglobulin (Ig) gene segments from genomic DNA of a murine hybridoma cell line which produces a high-affinity monoclonal antibody (MAb) directed against human carcinoembryonic antigen (CEA). The cloned, functionally-rearranged murine Ig H-chain and L-chain variable region gene segments were incorporated into plasmid vectors capable of directing the expression of a chimaeric mouse-human antibody molecule with human (gamma 4, kappa) constant region sequences. Expression plasmids were transfected into a mouse myeloma cell line by electroporation and transfectomas secreting functional chimaeric antibody selected. Chimaeric antibody generated by transfectomas was analysed and shown to compete effectively with its murine counterpart for binding to the CEA epitope, and to have an equivalent antigen-binding affinity. This anti-CEA recombinant antibody should find application in in vivo diagnosis by immunoscintigraphy of human colonic carcinoma, and possibly also in therapy of the disease, overcoming some of the difficulties associated with the repeated use of non-human immunoglobulins in human patients.

Dynamical modeling and analysis of large cellular regulatory networks.

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Fine specificity of a BALB/c T cell clone directed against beef apo cytochrome c.

A BALB/c cloned T cell line directed against beef apo cytochrome c was shown to exhibit the Lyt-1+2- cell surface phenotype. The fine specificity of antigen recognition exhibited by the T cell clone was assessed by using a variety of peptide preparations obtained from cytochrome c of different sources. The peptide segment recognized by this T cell clone, in conjunction with I-A region gene products, appeared similar to that bound by a monoclonal antibody specific for beef apo cytochrome c derived from the same strain of mice.

Destruction of conditional insulinoma cell lines in NOD mice: a role for autoimmunity.

AIMS/HYPOTHESIS: betaTC-tet (H2(k)) is a conditional insulinoma cell line derived from transgenic mice expressing a tetracycline-regulated oncogene. Transgenic expression of several proteins implicated in the apoptotic pathways increase the resistance of betaTC-tet cells in vitro. We tested in vivo the sensitivity of the cells to rejection and the protective effect of genetic alterations in NOD mice. METHODS: betaTC-tet cells and genetically engineered lines expressing Bcl-2 (CDM3D), a dominant negative mutant of MyD88 or SOCS-1 were transplanted in diabetic female NOD mice or in male NOD mice with diabetes induced by high-dose streptozotocin. Survival of functional cell grafts in NOD-scid mice was also analyzed after transfer of splenocytes from diabetic NOD mice. Autoreactive T-cell hybridomas and splenocytes from diabetic NOD mice were stimulated by betaTC-tet cells. RESULTS: betaTC-tet cells and genetically engineered cell lines were all similarly rejected in diabetic NOD mice and in NOD-scid mice after splenocyte transfer. In 3- to 6-week-old male NOD mice treated with high-dose streptozotocin, the cells temporarily survived, in contrast with C57BL/6 mice treated with high-dose streptozotocin (indefinite survival) and untreated 3- to 6-week-old male NOD mice (rejection). The protective effect of high-dose streptozotocin was lost in older male NOD mice. betaTC-tet cells did not stimulate autoreactive T-cell hybridomas, but induced IL-2 secretion by splenocytes from diabetic NOD mice. CONCLUSION/INTERPRETATION: The autoimmune process seems to play an important role in the destruction of betaTC-tet cells in NOD mice. Genetic manipulations intended at increasing the resistance of beta cells were inefficient. Similar approaches should be tested in vivo as well as in vitro. High dose streptozotocin influences immune rejection and should be used with caution.

Dynamics of the recruitment of lateral amygdala neurons following successive fear learning to different conditional stimuli

In fear conditioning, an animal learns to associate an unconditioned stimulus (US), such as a shock, and a conditioned stimulus (CS), such as a tone, so that the presentation of the CS alone can trigger conditioned responses. Recent research on the lateral amygdala has shown that following cued fear conditioning, only a subset of higher-excitable neurons are recruited in the memory trace. Their selective deletion after fear conditioning results in a selective erasure of the fearful memory. I hypothesize that the recruitment of highly excitable neurons depends on responsiveness to stimuli, intrinsic excitability and local connectivity. In addition, I hypothesize that neurons recruited for an initial memory also participate in subsequent memories, and that changes in neuronal excitability affect secondary fear learning. To address these hypotheses, I will show that A) a rat can learn to associate two successive short-term fearful memories; B) neuronal populations in the LA are competitively recruited in the memory traces depending on individual neuronal advantages, as well as advantages granted by the local network. By performing two successive cued fear conditioning experiments, I found that rats were able to learn and extinguish the two successive short-term memories, when tested 1 hour after learning for each memory. These rats were equipped with a system of stable extracellular recordings that I developed, which allowed to monitor neuronal activity during fear learning. 233 individual putative pyramidal neurons could modulate their firing rate in response to the conditioned tone (conditioned neurons) and/or non- conditioned tones (generalizing neurons). Out of these recorded putative pyramidal neurons 86 (37%) neurons were conditioned to one or both tones. More precisely, one population of neurons encoded for a shared memory while another group of neurons likely encoded the memories' new features. Notably, in spite of a successful behavioral extinction, the firing rate of those conditioned neurons in response to the conditioned tone remained unchanged throughout memory testing. Furthermore, by analyzing the pre-conditioning characteristics of the conditioned neurons, I determined that it was possible to predict neuronal recruitment based on three factors: 1) initial sensitivity to auditory inputs, with tone-sensitive neurons being more easily recruited than tone- insensitive neurons; 2) baseline excitability levels, with more highly excitable neurons being more likely to become conditioned; and 3) the number of afferent connections received from local neurons, with neurons destined to become conditioned receiving more connections than non-conditioned neurons. - En conditionnement de la peur, un animal apprend à associer un stimulus inconditionnel (SI), tel un choc électrique, et un stimulus conditionné (SC), comme un son, de sorte que la présentation du SC seul suffit pour déclencher des réflexes conditionnés. Des recherches récentes sur l'amygdale latérale (AL) ont montré que, suite au conditionnement à la peur, seul un sous-ensemble de neurones plus excitables sont recrutés pour constituer la trace mnésique. Pour apprendre à associer deux sons au même SI, je fais l'hypothèse que les neurones entrent en compétition afin d'être sélectionnés lors du recrutement pour coder la trace mnésique. Ce recrutement dépendrait d'un part à une activation facilité des neurones ainsi qu'une activation facilité de réseaux de neurones locaux. En outre, je fais l'hypothèse que l'activation de ces réseaux de l'AL, en soi, est suffisante pour induire une mémoire effrayante. Pour répondre à ces hypothèses, je vais montrer que A) selon un processus de mémoire à court terme, un rat peut apprendre à associer deux mémoires effrayantes apprises successivement; B) des populations neuronales dans l'AL sont compétitivement recrutées dans les traces mnésiques en fonction des avantages neuronaux individuels, ainsi que les avantages consentis par le réseau local. En effectuant deux expériences successives de conditionnement à la peur, des rats étaient capables d'apprendre, ainsi que de subir un processus d'extinction, pour les deux souvenirs effrayants. La mesure de l'efficacité du conditionnement à la peur a été effectuée 1 heure après l'apprentissage pour chaque souvenir. Ces rats ont été équipés d'un système d'enregistrements extracellulaires stables que j'ai développé, ce qui a permis de suivre l'activité neuronale pendant l'apprentissage de la peur. 233 neurones pyramidaux individuels pouvaient moduler leur taux d'activité en réponse au son conditionné (neurones conditionnés) et/ou au son non conditionné (neurones généralisant). Sur les 233 neurones pyramidaux putatifs enregistrés 86 (37%) d'entre eux ont été conditionnés à un ou deux tons. Plus précisément, une population de neurones code conjointement pour un souvenir partagé, alors qu'un groupe de neurones différent code pour de nouvelles caractéristiques de nouveaux souvenirs. En particulier, en dépit d'une extinction du comportement réussie, le taux de décharge de ces neurones conditionné en réponse à la tonalité conditionnée est resté inchangée tout au long de la mesure d'apprentissage. En outre, en analysant les caractéristiques de pré-conditionnement des neurones conditionnés, j'ai déterminé qu'il était possible de prévoir le recrutement neuronal basé sur trois facteurs : 1) la sensibilité initiale aux entrées auditives, avec les neurones sensibles aux sons étant plus facilement recrutés que les neurones ne répondant pas aux stimuli auditifs; 2) les niveaux d'excitabilité des neurones, avec les neurones plus facilement excitables étant plus susceptibles d'être conditionnés au son ; et 3) le nombre de connexions reçues, puisque les neurones conditionné reçoivent plus de connexions que les neurones non-conditionnés. Enfin, nous avons constaté qu'il était possible de remplacer de façon satisfaisante le SI lors d'un conditionnement à la peur par des injections bilatérales de bicuculline, un antagoniste des récepteurs de l'acide y-Aminobutirique.

Neutralizing and protective antibodies directed against vaccinia virus envelope antigens.

The infection mechanism of vaccinia virus is largely unknown. Neither the attachment protein of extracellular enveloped virus (EEV), the biologically relevant infectious form of the virus, nor its cellular receptor has been identified. Surprisingly, all former attempts using antibodies to block EEV infection of cells in vitro had failed. Here, we report the production of an anti-envelope hyperimmune serum with EEV neutralizing activity and show that a polyclonal antiserum against the extraviral domain of protein B5R also inhibited EEV infection. In vivo, mice vaccinated with B5R protein were protected against a lethal vaccinia virus challenge. This protectivity is likely to be mediated by neutralizing antibodies. Protein A33R, but not A34R and A36R, also proved to be protective in active and passive vaccination experiments. However, in contrast to B5R, A33R protectivity did not correlate with antibody titers. Because anti-A33R antibodies did not neutralize EEV in vitro, the protectivity mediated by A33R protein probably involves a mechanism different from simple antibody binding. Taken together, our results suggest that antibodies to a specific protective epitope or epitopes on protein B5R are able to prevent EEV infection. The protein encoded by the B5R gene is therefore likely to play a crucial role in the initial steps of vaccinia virus infection-binding to a host cell and entry into its cytoplasm.