Constraint-based analysis of gene interactions using restricted boolean networks and time-series data

Abstract Background A popular model for gene regulatory networks is the Boolean network model. In this paper, we propose an algorithm to perform an analysis of gene regulatory interactions using the Boolean network model and time-series data. Actually, the Boolean network is restricted in the sense that only a subset of all possible Boolean functions are considered. We explore some mathematical properties of the restricted Boolean networks in order to avoid the full search approach. The problem is modeled as a Constraint Satisfaction Problem (CSP) and CSP techniques are used to solve it. Results We applied the proposed algorithm in two data sets. First, we used an artificial dataset obtained from a model for the budding yeast cell cycle. The second data set is derived from experiments performed using HeLa cells. The results show that some interactions can be fully or, at least, partially determined under the Boolean model considered. Conclusions The algorithm proposed can be used as a first step for detection of gene/protein interactions. It is able to infer gene relationships from time-series data of gene expression, and this inference process can be aided by a priori knowledge available.

Adaptation and Constraint in the Plant Reproductive Phase

Conservatism is a central theme of organismic evolution. Related species share characteristics due to their common ancestry. Some concern have been raised among evolutionary biologists, whether such conservatism is an expression of natural selection or of a constrained ability to adapt. This thesis explores adaptations and constraints within the plant reproductive phase, particularly in relation to the evolution of fleshy fruit types (berries, drupes, etc.) and the seasonal timing of flowering and fruiting. The different studies were arranged along a hierarchy of scale, with general data sets sampled among seed plants at the global scale, through more specific analyses of character evolution within the genus Rhamnus s.l. L. (Rhamnaceae), to descriptive and experimental field studies in a local population of Frangula alnus (Rhamnaceae). Apart from the field study, this thesis is mainly based on comparative methods explicitly incorporating phylogenetic relationships. The comparative study of Rhamnus s.l. species included the reconstruction of phylogenetic hypotheses based on DNA sequences. Among geographically overlapping sister clades, biotic pollination was not correlated with higher species richness when compared to wind pollinated plants. Among woody plants, clades characterized by fleshy fruit types were more species rich than their dry-fruited sister clades, suggesting that the fleshy fruit is a key innovation in woody habitats. Moreover, evolution of fleshy fruits was correlated with a change to more closed (darker) habitats. An independent contrast study within Rhamnus s.l. documented allometric relations between plant and fruit size. As a phylogenetic constraint, allometric effects must be considered weak or non-existent, though, as they did not prevail among different subclades within Rhamnus s.l. Fruit size was correlated with seed size and seed number in F. alnus. This thesis suggests that frugivore selection on fleshy fruit may be important by constraining the upper limits of fruit size, when a plant lineage is colonizing (darker) habitats where larger seed size is adaptive. Phenological correlations with fruit set, dispersal, and seed size in F. alnus, suggested that the evolution of reproductive phenology is constrained by trade-offs and partial interdependences between flowering, fruiting, dispersal, and recruitment phases. Phylogenetic constraints on the evolution of phenology were indicated by a lack of correlation between flowering time and seasonal length within Rhamnus cathartica and F. alnus, respectively. On the other hand, flowering time was correlated with seasonal length among Rhamnus s.l. species. Phenological differences between biotically and wind pollinated angiosperms also suggested adaptive change in reproductive phenology.

Constraint handling rules. Compositional semantics and program transformation

This thesis intends to investigate two aspects of Constraint Handling Rules (CHR). It proposes a compositional semantics and a technique for program transformation. CHR is a concurrent committed-choice constraint logic programming language consisting of guarded rules, which transform multi-sets of atomic formulas (constraints) into simpler ones until exhaustion [Frü06] and it belongs to the declarative languages family. It was initially designed for writing constraint solvers but it has recently also proven to be a general purpose language, being as it is Turing equivalent [SSD05a]. Compositionality is the first CHR aspect to be considered. A trace based compositional semantics for CHR was previously defined in [DGM05]. The reference operational semantics for such a compositional model was the original operational semantics for CHR which, due to the propagation rule, admits trivial non-termination. In this thesis we extend the work of [DGM05] by introducing a more refined trace based compositional semantics which also includes the history. The use of history is a well-known technique in CHR which permits us to trace the application of propagation rules and consequently it permits trivial non-termination avoidance [Abd97, DSGdlBH04]. Naturally, the reference operational semantics, of our new compositional one, uses history to avoid trivial non-termination too. Program transformation is the second CHR aspect to be considered, with particular regard to the unfolding technique. Said technique is an appealing approach which allows us to optimize a given program and in more detail to improve run-time efficiency or spaceconsumption. Essentially it consists of a sequence of syntactic program manipulations which preserve a kind of semantic equivalence called qualified answer [Frü98], between the original program and the transformed ones. The unfolding technique is one of the basic operations which is used by most program transformation systems. It consists in the replacement of a procedure-call by its definition. In CHR every conjunction of constraints can be considered as a procedure-call, every CHR rule can be considered as a procedure and the body of said rule represents the definition of the call. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages. We define an unfolding rule, show its correctness and discuss some conditions in which it can be used to delete an unfolded rule while preserving the meaning of the original program. Finally, confluence and termination maintenance between the original and transformed programs are shown. This thesis is organized in the following manner. Chapter 1 gives some general notion about CHR. Section 1.1 outlines the history of programming languages with particular attention to CHR and related languages. Then, Section 1.2 introduces CHR using examples. Section 1.3 gives some preliminaries which will be used during the thesis. Subsequentely, Section 1.4 introduces the syntax and the operational and declarative semantics for the first CHR language proposed. Finally, the methodologies to solve the problem of trivial non-termination related to propagation rules are discussed in Section 1.5. Chapter 2 introduces a compositional semantics for CHR where the propagation rules are considered. In particular, Section 2.1 contains the definition of the semantics. Hence, Section 2.2 presents the compositionality results. Afterwards Section 2.3 expounds upon the correctness results. Chapter 3 presents a particular program transformation known as unfolding. This transformation needs a particular syntax called annotated which is introduced in Section 3.1 and its related modified operational semantics !0t is presented in Section 3.2. Subsequently, Section 3.3 defines the unfolding rule and prove its correctness. Then, in Section 3.4 the problems related to the replacement of a rule by its unfolded version are discussed and this in turn gives a correctness condition which holds for a specific class of rules. Section 3.5 proves that confluence and termination are preserved by the program modifications introduced. Finally, Chapter 4 concludes by discussing related works and directions for future work.

Learning for scheduling a portfolio of constraint solvers

Nel lavoro di tesi qui presentato si indaga l'applicazione di tecniche di apprendimento mirate ad una più efficiente esecuzione di un portfolio di risolutore di vincoli (constraint solver). Un constraint solver è un programma che dato in input un problema di vincoli, elabora una soluzione mediante l'utilizzo di svariate tecniche. I problemi di vincoli sono altamente presenti nella vita reale. Esempi come l'organizzazione dei viaggi dei treni oppure la programmazione degli equipaggi di una compagnia aerea, sono tutti problemi di vincoli. Un problema di vincoli è formalizzato da un problema di soddisfacimento di vincoli(CSP). Un CSP è descritto da un insieme di variabili che possono assumere valori appartenenti ad uno specico dominio ed un insieme di vincoli che mettono in relazione variabili e valori assumibili da esse. Una tecnica per ottimizzare la risoluzione di tali problemi è quella suggerita da un approccio a portfolio. Tale tecnica, usata anche in am- biti come quelli economici, prevede la combinazione di più solver i quali assieme possono generare risultati migliori di un approccio a singolo solver. In questo lavoro ci preoccupiamo di creare una nuova tecnica che combina un portfolio di constraint solver con tecniche di machine learning. Il machine learning è un campo di intelligenza articiale che si pone l'obiettivo di immettere nelle macchine una sorta di `intelligenza'. Un esempio applicativo potrebbe essere quello di valutare i casi passati di un problema ed usarli in futuro per fare scelte. Tale processo è riscontrato anche a livello cognitivo umano. Nello specico, vogliamo ragionare in termini di classicazione. Una classicazione corrisponde ad assegnare ad un insieme di caratteristiche in input, un valore discreto in output, come vero o falso se una mail è classicata come spam o meno. La fase di apprendimento sarà svolta utilizzando una parte di CPHydra, un portfolio di constraint solver sviluppato presso la University College of Cork (UCC). Di tale algoritmo a portfolio verranno utilizzate solamente le caratteristiche usate per descrivere determinati aspetti di un CSP rispetto ad un altro; queste caratteristiche vengono altresì dette features. Creeremo quindi una serie di classicatori basati sullo specifico comportamento dei solver. La combinazione di tali classicatori con l'approccio a portfolio sara nalizzata allo scopo di valutare che le feature di CPHydra siano buone e che i classicatori basati su tali feature siano affidabili. Per giusticare il primo risultato, eettueremo un confronto con uno dei migliori portfolio allo stato dell'arte, SATzilla. Una volta stabilita la bontà delle features utilizzate per le classicazioni, andremo a risolvere i problemi simulando uno scheduler. Tali simulazioni testeranno diverse regole costruite con classicatori precedentemente introdotti. Prima agiremo su uno scenario ad un processore e successivamente ci espanderemo ad uno scenario multi processore. In questi esperimenti andremo a vericare che, le prestazioni ottenute tramite l'applicazione delle regole create appositamente sui classicatori, abbiano risultati migliori rispetto ad un'esecuzione limitata all'utilizzo del migliore solver del portfolio. I lavoro di tesi è stato svolto in collaborazione con il centro di ricerca 4C presso University College Cork. Su questo lavoro è stato elaborato e sottomesso un articolo scientico alla International Joint Conference of Articial Intelligence (IJCAI) 2011. Al momento della consegna della tesi non siamo ancora stati informati dell'accettazione di tale articolo. Comunque, le risposte dei revisori hanno indicato che tale metodo presentato risulta interessante.

A study on set variable representations in constraint programming

Il lavoro presentato in questa tesi si colloca nel contesto della programmazione con vincoli, un paradigma per modellare e risolvere problemi di ricerca combinatoria che richiedono di trovare soluzioni in presenza di vincoli. Una vasta parte di questi problemi trova naturale formulazione attraverso il linguaggio delle variabili insiemistiche. Dal momento che il dominio di tali variabili può essere esponenziale nel numero di elementi, una rappresentazione esplicita è spesso non praticabile. Recenti studi si sono quindi focalizzati nel trovare modi efficienti per rappresentare tali variabili. Pertanto si è soliti rappresentare questi domini mediante l'uso di approssimazioni definite tramite intervalli (d'ora in poi rappresentazioni), specificati da un limite inferiore e un limite superiore secondo un'appropriata relazione d'ordine. La recente evoluzione della ricerca sulla programmazione con vincoli sugli insiemi ha chiaramente indicato che la combinazione di diverse rappresentazioni permette di raggiungere prestazioni di ordini di grandezza superiori rispetto alle tradizionali tecniche di codifica. Numerose proposte sono state fatte volgendosi in questa direzione. Questi lavori si differenziano su come è mantenuta la coerenza tra le diverse rappresentazioni e su come i vincoli vengono propagati al fine di ridurre lo spazio di ricerca. Sfortunatamente non esiste alcun strumento formale per paragonare queste combinazioni. Il principale obiettivo di questo lavoro è quello di fornire tale strumento, nel quale definiamo precisamente la nozione di combinazione di rappresentazioni facendo emergere gli aspetti comuni che hanno caratterizzato i lavori precedenti. In particolare identifichiamo due tipi possibili di combinazioni, una forte ed una debole, definendo le nozioni di coerenza agli estremi sui vincoli e sincronizzazione tra rappresentazioni. Il nostro studio propone alcune interessanti intuizioni sulle combinazioni esistenti, evidenziandone i limiti e svelando alcune sorprese. Inoltre forniamo un'analisi di complessità della sincronizzazione tra minlex, una rappresentazione in grado di propagare in maniera ottimale vincoli lessicografici, e le principali rappresentazioni esistenti.

Per una reinterpretazione della fuoriuscita di Dossetti dalla DC. Nuove fonti archivistiche sulle due vicesegreterie nazionali del partito(1945-46 E 1950-51)

Commento testuale e contestuale di circa duecento fonti inedite e sconosciute alla storiografia sul ruolo di vicesegretario politico della DC di Giuseppe Dossetti, in particolare con riferimento allo scioglimento dei CLN, del referendum istituzionale, della organizzazione del partito e infine, della sua rottura politica con De Gasperi.

Hybrid constraint programming and metaheuristic methods for large scale optimization problems

This work presents hybrid Constraint Programming (CP) and metaheuristic methods for the solution of Large Scale Optimization Problems; it aims at integrating concepts and mechanisms from the metaheuristic methods to a CP-based tree search environment in order to exploit the advantages of both approaches. The modeling and solution of large scale combinatorial optimization problem is a topic which has arisen the interest of many researcherers in the Operations Research field; combinatorial optimization problems are widely spread in everyday life and the need of solving difficult problems is more and more urgent. Metaheuristic techniques have been developed in the last decades to effectively handle the approximate solution of combinatorial optimization problems; we will examine metaheuristics in detail, focusing on the common aspects of different techniques. Each metaheuristic approach possesses its own peculiarities in designing and guiding the solution process; our work aims at recognizing components which can be extracted from metaheuristic methods and re-used in different contexts. In particular we focus on the possibility of porting metaheuristic elements to constraint programming based environments, as constraint programming is able to deal with feasibility issues of optimization problems in a very effective manner. Moreover, CP offers a general paradigm which allows to easily model any type of problem and solve it with a problem-independent framework, differently from local search and metaheuristic methods which are highly problem specific. In this work we describe the implementation of the Local Branching framework, originally developed for Mixed Integer Programming, in a CP-based environment. Constraint programming specific features are used to ease the search process, still mantaining an absolute generality of the approach. We also propose a search strategy called Sliced Neighborhood Search, SNS, that iteratively explores slices of large neighborhoods of an incumbent solution by performing CP-based tree search and encloses concepts from metaheuristic techniques. SNS can be used as a stand alone search strategy, but it can alternatively be embedded in existing strategies as intensification and diversification mechanism. In particular we show its integration within the CP-based local branching. We provide an extensive experimental evaluation of the proposed approaches on instances of the Asymmetric Traveling Salesman Problem and of the Asymmetric Traveling Salesman Problem with Time Windows. The proposed approaches achieve good results on practical size problem, thus demonstrating the benefit of integrating metaheuristic concepts in CP-based frameworks.

Constraint based methods for allocation and scheduling of periodic applications

This work presents exact algorithms for the Resource Allocation and Cyclic Scheduling Problems (RA&CSPs). Cyclic Scheduling Problems arise in a number of application areas, such as in hoist scheduling, mass production, compiler design (implementing scheduling loops on parallel architectures), software pipelining, and in embedded system design. The RA&CS problem concerns time and resource assignment to a set of activities, to be indefinitely repeated, subject to precedence and resource capacity constraints. In this work we present two constraint programming frameworks facing two different types of cyclic problems. In first instance, we consider the disjunctive RA&CSP, where the allocation problem considers unary resources. Instances are described through the Synchronous Data-flow (SDF) Model of Computation. The key problem of finding a maximum-throughput allocation and scheduling of Synchronous Data-Flow graphs onto a multi-core architecture is NP-hard and has been traditionally solved by means of heuristic (incomplete) algorithms. We propose an exact (complete) algorithm for the computation of a maximum-throughput mapping of applications specified as SDFG onto multi-core architectures. Results show that the approach can handle realistic instances in terms of size and complexity. Next, we tackle the Cyclic Resource-Constrained Scheduling Problem (i.e. CRCSP). We propose a Constraint Programming approach based on modular arithmetic: in particular, we introduce a modular precedence constraint and a global cumulative constraint along with their filtering algorithms. Many traditional approaches to cyclic scheduling operate by fixing the period value and then solving a linear problem in a generate-and-test fashion. Conversely, our technique is based on a non-linear model and tackles the problem as a whole: the period value is inferred from the scheduling decisions. The proposed approaches have been tested on a number of non-trivial synthetic instances and on a set of realistic industrial instances achieving good results on practical size problem.

Modellizzazione dinamica di un motore brushless DC per uso propulsivo su droni

Studio e realizzazione di un modello dinamico, in Simulink, del sistema propulsivo di un aeromodello, dotato di un autopilota e di un'elettronica di bordo. Tali caratteristiche consentono al drone di effettuare delle operazioni di volo in piena autonomia.

Analyse der Beteiligung von Toll-like-Rezeptoren an der DC-Aktivierung nach Parvovirus-H-1-Infektion

Ziel dieser Dissertation war es die funktionelle Rolle der Toll-like Rezeptoren (TLRs) und ihrer Signalwege bei der Aktivierung von dendritischen Zellen (DC) durch Parvovirus H-1- rn(H-1PV) induzierte Tumorzelllysate (TCL) zu untersuchen. rnDas angeborene Immunsystem bekämpft die Bildung und das Wachstum von Tumoren, insbesondere durch Interaktion von Effektor-Immunzellen mit Tumorzellen. Die Aktivierung dieser Immunreaktionen in der Antitumortherapie ist wünschenswert, aber in vielen Situationen nicht zufriedenstellend, da sie durch klassische systemische Therapie allein nicht immer erreicht werden kann. Die therapeutische Anwendung von onkolytischen Viren bei Patienten mit malignen Erkrankungen (Virotherapie) ist ein vielversprechendes Gebiet der Forschung. Die onkosuppressive und immunstimulierende Wirkung von H-1PV auf humane Tumor- und Immunzellen spricht für eine Verwendung in der Krebstherapie. Ein Aktivierung des Immunsystems durch H-1PV konnte bereits in unserer Arbeitsgruppe gezeigt werden.rnIn dieser Arbeit wurden wichtige Aspekte bezüglich der Aktivierung von Toll-like Rezeptoren bei einer H-1PV Infektion untersucht. Zunächst wurde die Rolle von TLRs nach der H-1PV Infektion untersucht. Humane embryonale Nierenzellen (HEK293) wurden stabil mit humanen TLRs transfiziert, um die Rolle spezifischer TLRs während der Aktivierung des Immunsystems zu untersuchen. TLR3 und TLR9 wurden durch eine H-1PV Infektion, die mit der NFκB-Translokation in den Zellkern korreliert, aktiviert. Mit Hilfe eines Reporterplasmides (pNiFty-Luc), wurde durch erhöhte Expression eines NFκB-induzierbaren Reportergens die NFκB-Aktivität im Anschluss an eine H-1PV Infektion nachgewiesen. Zudem wurde die immunologische Wirkung von H-1PV-induzierten Tumorzelllysaten (TCL) auf die humane antitumor-gerichtete Immunantworten analysiert. Ein humanes ex vivo-Modell, bestehend aus einer HLA-A2-positiven humanen Melanom-Zelllinie (SK29Mel) wurde verwendet, um Immunreaktionen mit entsprechenden HLA-restringierten humanen DCs zu untersuchen. DCs die mit H-1PV-infizierten SK29Mel Zellen koinkubiert wurden, zeigten eine erhöhte TLR3- und TLR9-Expression. Diese Daten deuten darauf hin, dass H-1PV-induzierte TCLs humane DCs stimulieren und dies zumindest teilweise durch TLR-abhängige Signalwege geschieht. Demnach wird eine DC-Reifung durch Kokultur mit H-1PV-induzierten TCLs über den TLR-Signalweg erreicht und führte u.a. zu einer NFκB-abhängigen Aktivierung des adaptiven Immunsystems. Die onkolytischen Virotherapie mit H-1PV erhöht so durch unterschiedliche Auswirkungen auf DCs die Immunreaktion und verstärkt die Anti-Tumor-Immunität. Diese Ergebnisse zeigen einen neuen potenziellen Ansatz für den Einsatz onkolytischer Viren für TLR-zielgerichtete Therapieoptionen und stellen eine ideale Möglichkeit zur Erweiterung der Krebsbehandlung dar.rn

Portfolio Approaches in Constraint Programming

Recent research has shown that the performance of a single, arbitrarily efficient algorithm can be significantly outperformed by using a portfolio of —possibly on-average slower— algorithms. Within the Constraint Programming (CP) context, a portfolio solver can be seen as a particular constraint solver that exploits the synergy between the constituent solvers of its portfolio for predicting which is (or which are) the best solver(s) to run for solving a new, unseen instance. In this thesis we examine the benefits of portfolio solvers in CP. Despite portfolio approaches have been extensively studied for Boolean Satisfiability (SAT) problems, in the more general CP field these techniques have been only marginally studied and used. We conducted this work through the investigation, the analysis and the construction of several portfolio approaches for solving both satisfaction and optimization problems. We focused in particular on sequential approaches, i.e., single-threaded portfolio solvers always running on the same core. We started from a first empirical evaluation on portfolio approaches for solving Constraint Satisfaction Problems (CSPs), and then we improved on it by introducing new data, solvers, features, algorithms, and tools. Afterwards, we addressed the more general Constraint Optimization Problems (COPs) by implementing and testing a number of models for dealing with COP portfolio solvers. Finally, we have come full circle by developing sunny-cp: a sequential CP portfolio solver that turned out to be competitive also in the MiniZinc Challenge, the reference competition for CP solvers.

Centro-sinistra e autonomia speciale. La DC trentina tra il 1955 e il 1968

La tesi è una ricerca di storia politica che affianca due diverse “storie” di centro-sinistra, quella nazionale e quella che vide protagonista la Democrazia Cristiana del Trentino. Lo studio analizza i fatti attraverso il filtro delle DC come se quello trentino e quello nazionale fossero due partiti, per poi tentare di capire ciò che accadeva alla loro sinistra alla ricerca dei diversi pesi e dei differenti equilibri che al centro e alla periferia si manifestavano nei rapporti con il PSI e con il PCI, e per osservare le reazioni della Chiesa così da valutare se le gerarchie romane e quelle trentine interagirono in modo differente sugli sviluppi delle rispettive esperienze politiche di quegli anni. Il testo è organizzato in quattro capitoli. Il primo e il secondo (speculari e dedicati allo stesso lustro: 1955-1960) rappresentano un confronto tra i differenti iter d’avvicinamento al centro-sinistra che la politica nazionale e quella trentina sperimentarono nella seconda metà degli anni Cinquanta. Nel terzo capitolo (1960-1964) e nel quarto (1964-1968) le vicende nazionali e quelle locali sono invece raccontate in modo intrecciato, ripercorrendo le diverse fasi dell’alleanza tra Democrazia Cristiana e Partito Socialista, e nel contempo dando conto della trasformazione del Trentino da una realtà di tipo agricolo ad una di tipo industriale, del passaggio da una comunità di tipo cattolico tradizionale ad una che si accinge a vivere in un contesto secolarizzato, e da una società che si autopercepisce come periferica ad una che ospita una delle contestazioni studentesche più peculiari, incisive e note d’Italia.

Die Rolle von Myosin 9b und LFA-1 in Dendritischen Zellen für die DC,T-Zellinteraktion und die Induktion einer Immunantwort

In dieser Arbeit wurde zum Einen, die Interaktionsphysiologie zwischen verschiedenen DC-Populationen und naiven sowie regulatorischen T-Zellen analysiert. Dabei wurde die Kontaktdauer und Häufigkeit bestimmt sowie die daraus folgende Aktivierung der T-Zellen in einer 3D-Kollagenmatrix. rnZum zweiten wurde die Rolle des Aktin-Motorproteins Myosin 9b, bei der Zellmigration sowie bei der DC-T-Zellinteraktion und der Ausbildung von Immunantworten untersucht. Myo9b KO DC weisen in vitro in einer Kollagenmatrix sowie in vivo einen gestörten Migrationsphänotyp auf. Auch die Interaktion mit T-Zellen ist verändert und sie induzieren eine reduzierte T-Zellaktivierung in einer 3D-Umgebung sowie eine geringere Immunreaktion in vivo. Die Zugabe pharmakologischer Inhibitoren der Rho-Signalkaskade konnte die Migration und das T-Zellstimulierungspotential wiederherstellen. rnZum Dritten wurde analysiert, welche Bedeutung die konstitutive Aktivierung des Adhäsionsmoleküls LFA-1 auf DC (LFA-1 d/d) hat. LFA-1 d/d DC zeigten verlängerte Interaktionszeiten mit T-Zellen, gefolgt von einer reduzierten T-Zellproliferation in einer Kollagenmatrix. Durch die Inhibition von aktivem LFA-1 auf den DC mittels blockierender Antikörper konnte eine Normalisierung der Interaktionsparameter und T-Zellproliferation auf Wildtyp-Niveau wiederhergestellt werden. Durch ein Ausschalten von CYTIP in WT DC und dem damit einhergehenden Verlust der Deaktivierbarkeit von LFA-1 über Cytohesin wurde ebenfalls eine erhöhte Interaktionszeit mit T-Zellen und eine reduzierte T-Zellproliferation beobachtet.rn

Etablierung eines humanisierten Mausmodells zur In-vivo-Analyse von DC-adressierenden Nanopartikeln

In dieser Arbeit wurde zunächst ein humanisiertes Mausmodell entwickelt für die Analyse von humanen DCs in vivo. Darüber hinaus wurden erste Versuche mit Nanopartikelbeladenen DCs durchgeführt, mit der Intention, durch diese Kombination humane DCs zu untersuchen. Es wurden immunsupprimierte NOD/LtSz-scid IL2R (NSG) Mäuse verwendet und mit humanen CD34+ PBSCs transplantiert. Es wurden insgesamt 14 Modelle getestet, mit einer durchschnittlichen Humanisierungsrate von 76 %. In allen Modellen konnten ab Woche sechs nach Transplantation humane CD45+ Zellen sowie humane Bund NK-Zellen und CD14+ Monozyten gefunden werden. Darüber hinaus waren myeloide DC-Vorläuferzellen, konventionelle HLA DR CD11c DCs (cDCs) und plasmazytoide DCs (pDCs) vorhanden. Humane T-Zellen konnten nicht vor Woche 18 nach Transplantation beobachtet werden. Neben der Rekonstitution humaner DCs in peripheren Organen, wurde ebenfalls nach gewebsständigen DCs, insbesondere den Langerhans Zellen (LCs) der Epidermis geschaut. Waren humane LC vorhanden, konnten diese ab Woche zwölf nach Transplantation in der murinen Epidermis detektiert werden. Diese waren konstant bis in Woche 30 nach Transplantation nachweisbar. In Hinblick auf die Etablierung der DCs in diesem humanisierten Mausmodells wurden verschiedene Einflussgrößen getestet. IL-7 führte zu keiner veränderten Hämatopoese, wohingegen Flt3L zu einer Zunahme von CD14+ Monozyten und cDCs führte. Darüber hinaus konnte eine drastische Abnahmernhumaner B-Zellen beobachtet werden. Es zeigte sich, dass der Zeitpunkt der Flt3LrnApplikation einen entscheidenen Faktor für den Effekt von Flt3L auf die Rekonstitution humaner Zellen darstellt. Für die in dieser Arbeit durchgeführten funktionellen in vivo Studien, wurden humanisierten Mäusen alloreaktive CD8+ T-Zellen appliziert. Somit sollte die Funktionalität der rekonstituierten humanen APCs getestet werden. Es wurde deutlich, dass Monozyten und DCs ihre Funktionalität erst ab Woche 14 nach Transplantation zu entwickeln schienen,rnwohingegen B-Zellen bereits zu früheren Zeitpunkten als Zielzellen für die alloreaktiven T-Zellen dienten. Dies wurde durch den Rückgang der jeweiligen Zellen nach Applikation der T-Zellen sichtbar. Zu erwähnen ist, dass das Anwachsen einer humanen Hämatopoese stark spenderabhängig ist und somit keine allgemeingültigen Aussagen hinsichtlich der in vivo Funktion getroffen werden können. Um im Gewebe verbliebende APCs zu manipulieren gibt es verschiedene Möglichkeiten. Im Rahmen dieser Arbeit wurden auf Polystyren-basierende Nanopartikel getestet. Die verwendeten Partikel hatten eine Größe von 80 bis 160 nm und waren unfunktionalisiert oder mit Amino- bzw. Carboxy-Gruppen versehen. Zusätzlich wurden die Partikel mit BODIPY (Durchflusszytometrie und kLSM-Messungen), einem Infrarotnahem Farbstoff IR 780 (BFI-Messungen) und Platin (in vivo Messungen) beladen. Der Carboxy-funktionalisierte Partikel zeigte den geringsten Einfluss auf die Vitalität von humanen DCs, wohingegen der Amino-funktionalisierte Partikel bei steigender Konzentration toxisch wirkte. Bei unfunktionalisierten Partikeln stieg die Toxizität bei zunehmender Konzentration. Hinsichtlich der Expression diverser DC spezifischer Oberflächenmoleküle nach Beladung mit Nanopartikeln zeigte sich, dass allein der unfunktionalisierte, mit Lutensol AT50 hergestellte Partikel zu einer leichten Hochregulation von MHC-Klasse-II Molekülen führte. Die Expression von CD86 wurde im Gegenzug nur durch die Beladung mit den Amino-, bzw. Carboxy funktionalisierten Partikeln und dem unfunktionalisierten, mit SDS hergestellten Partikel leicht gesteigert. Trotz der teilweise leicht veränderten Expression von Oberflächenmarkern, konnte mit Hilfe von IFN-g ELISpots keine Beeinflussungrnder Funktion als APCs von Nanopartikel-beladenen DCs beobachtet werden. In den in vivo Untersuchungen zeigten alle vier Partikel eine konstante Zirkulation imrnOrganismus und konnten bis 96 h nach Applikation nachgewiesen werden. Alle Partikel konnten primär in der Leber detektiert werden, wobei der unfunktionalisierte, mit Lutensol AT50 hergestelle Partikel das weiteste Verbreitungsmuster zeigte. Erste Versuche im humanisierten Mausmodell zeigten keine Beeinflussung der Verteilung und Kinetik von Nanopartikeln durch die humane Hämatopoese. Mit dem in dieser Arbeit etablierten humanisierten Mausmodell ist es möglich, die Entwicklung, Differenzierung, Aktivierung und Funktionalität humaner DCs in vivo zu untersuchen. Darüber hinaus kann das gezielte Adressieren von DCs in vivo analysiert werden, was sowohl die Möglichkeit der Manipulation von DCs zur Vermeidung einer akuten GvHD bietet als auch Verwendung in anderen DC-vermittelten Therapien (z.B.Vakzinationsstudien) findet.

The role of dendritic cells (DC) in Friend retrovirus-induced immunosuppression and immunotherapeutic applications of functionalized nanoparticles

Friend murine leukemia Virus (FV) infection of immunocompetent mice is a well- established model to acquire further knowledge about viral immune suppression mechanisms, with the aim to develop therapeutics against retrovirus-induced diseases. Interestingly, BALB/c mice are infected by low doses of FV and die from FV-induced erythroleukemia, while C57/BL6 mice are infected by FV only at high viral dose, and remain persistently infected for their whole life. Due to the central role of dendritic cells (DC) in the induction of anti-viral responses, we asked for their functional role in the genotype-dependent sensitivity towards FV infection. In my PhD study I showed that bone marrow (BM)-derived DC differentiated from FV-infected BM cells obtained from FV-inoculated BALB/c (FV susceptible) and C57BL/6 (FV resistant) mice showed an increased endocytotic activity and lowered expression of MHCII and of costimulatory receptors as compared with non-infected control BMDC. FV-infected BMDC from either mouse strain were partially resistant towards stimulation-induced upregulation of MHCII and costimulators, and accordingly were poor T cell stimulators in vitro and in vivo. In addition, FV-infected BMDC displayed an altered expression profile of proinflammator cytokines and favoured Th2 polarization. Ongoing work is focussed on elucidating the functional role of proteins identified as differentially expressed in FV-infected DC in a genotype-dependent manner, which therefore may contribute to the differential course of FV infection in vivo in BALB/c versus C57BL/6 mice. So far, more than 300 proteins have been identified which are differently regulated in FV-infected vs. uninfected DC from both mouse strains. One of these proteins, S100A9, was strongly upregulated specifically in BMDC derived from FV-infected C57BL/6 BM cells. S100A9-/- mice were more sensitive towards inoculation with FV than corresponding wild type (WT) mice (both C57BL/6 background), which suggests a decisive role of this factor for anti-viral defense. In addition, FV-infected S100A9-/- BMDC showed lower motility than WT DC. The future work is aimed to further elucidate the functional importance of S100A9 for DC functions. To exploit the potential of DC for immunotherapeutic applications, in another project of this PhD study the usability of different types of functionalized nanoparticles