Interazioni tra le glicoproteine D, B, H ed L critiche per la fusione indotta dal virus Herpes simplex

Four glycoproteins (gD, gB, gH, and gL) are required for herpes simplex virus (HSV) entry into the cell and for cell-cell fusion in transfected cells. gD serves as the receptor-binding glycoprotein and as the trigger of fusion; the other three glycoproteins execute fusion between the viral envelope and the plasma or endocytic membranes. Little is known on the interaction of gD with gB, gH, and gL. Here, the interactions between herpes simplex virus gD and its nectin1 receptor or between gD, gB, and gH were analyzed by complementation of the N and C portions of split enhanced green fluorescent protein (EGFP) fused to the glycoproteins. Split EGFP complementation was detected between proteins designated gDN + gHC, gDN + gBC, and gHN + gBC + wtgD, both in cells transfected with two or tree glycoproteins and in cells transfected with the four glycoproteins, commited to form syncytia. The in situ assay provides evidence that gD interacts with gH and gB independently one of the other. We further document the interaction between gH and gB. To elucidate which portions of the glycoproteins interact with each other we generated mutants of gD and gB. gD triggers fusion through a specialised domain, named pro-fusion domain (PFD), located C-terminally in the ectodomain. Here, we show that PFD is made of subdomains 1 and 2 (amino acids 260–285 and 285–310) and that each one partially contributed to herpes simplex virus infectivity. Chimeric gB molecules composed of HSV and human herpesvirus 8 (HHV8) sequences failed to reach the cell surface and to complement a gB defective virus. By means of pull down experiments we analyzed the interactions of HSV-HHV8 gB chimeras with gH or gD fused to the strep-tag. The gB sequence between aa residues 219-360 was identified as putative region of interaction with gH or critical to the interaction.

Molecular basis oh herpes simplex virus entry into the cell and retargeting of the viral tropism for the design of oncolytic herpesviruses

Herpes simplex virus 1 (HSV-1) infects oral epitelial cells, then spreads to the nerve endings and estabilishes latency in sensory ganglia, from where it may, or may not reactivate. Diseases caused by virus reactivation include mild diseases such as muco-cutaneous lesions, and more severe, and even life-threatening encephalitis, or systemic infections affecting diverse organs. Herpes simplex virus represents the most comprehensive example of virus receptor interaction in Herpesviridae family, and the prototype virus encoding multipartite entry genes. In fact, it encodes 11-12 glycoproteins and a number of additional membrane proteins: five of these proteins play key roles in virus entry into subsceptible cells. Thus, glycoprotein B (gB) and glycoprotein C (gC) interact with heparan sulfate proteoglycan to enable initial attachment to cell surfaces. In the next step, in the entry cascade, gD binds a specific surface receptor such as nectin1 or HVEM. The interaction of glycoprotein D with the receptor alters the conformation of gD to enable the activation of gB, glycoprotein H, and glycoprotein L, a trio of glycoproteins that execute the fusion of the viral envelope with the plasma membrane. In this thesis, I described two distinct projects: I. The retargeting of viral tropism for the design of oncolytic Herpesviruses: • capable of infecting cells through the human epitelial growth factor receptor 2 (HER2), overexpressed in highly malignant mammary and ovarian tumors and correlates with a poor prognosis; • detargeted from its natural receptors, HVEM and nectin1. To this end, we inserted a ligand to HER2 in gD. Because HER2 has no natural ligand, the selected ligand was a single chain antibody (scFv) derived from MAb4D5 (monoclonal antibody to HER2), herein designated scHER2. All recombinant viruses were targeted to HER2 receptor, but only two viruses (R-LM113 and R-LM249) were completely detargeted from HVEM and nectin1. To engineer R-LM113, we removed a large portion at the N-terminus of gD (from aa 6 to aa 38) and inserted scHER2 sequence plus 9-aa serine-glycine flexible linker at position 39. On the other hand, to engineer R-LM249, we replaced the Ig-folded core of gD (from aa 61 to aa 218) with scHER2 flanked by Ser-Gly linkers. In summary, these results provide evidence that: i. gD can tolerate an insert almost as big as gD itself; ii. the Ig-like domain of gD can be removed; iii. the large portion at the N-terminus of gD (from aa 6 to aa 38) can be removed without loss of key function; iv. R-LM113 and R-LM249 recombinants are ready to be assayed in animal models of mammary and ovary tumour. This finding and the avaibility of a large number of scFv greatly increase the collection of potential receptors to which HSV can be redirected. II. The production and purification of recombinant truncated form of the heterodimer gHgL. We cloned a stable insect cell line expressing a soluble form of gH in complex with gL under the control of a metalloprotein inducible promoter and purified the heterodimer by means of ONE-STrEP-tag system by IBA. With respect to biological function, the purified heterodimer is capable: • of reacting to antibodies that recognize conformation dependent epitopes and neutralize virion infectivity; • of binding a variety cells at cell surface. No doubt, the availability of biological active purified gHgL heterodimer, in sufficient quantities, will speed up the efforts to solve its crystal structure and makes it feasible to identify more clearly whether gHgL has a cellular partner, and what is the role of this interaction on virus entry.

Interazioni tra Glicoproteine che mediano la penetrazione del Virus Herpes Simplex nella cellula e disegno razionale di Peptidi Inibitori

Herpes simplex virus entry into cells requires a multipartite fusion apparatus made of gD, gB and heterodimer gH/gL. gD serves as receptor-binding glycoprotein and trigger of fusion; its ectodomain is organized in a N-terminal domain carrying the receptor-binding sites, and a C-terminal domain carrying the profusion domain, required for fusion but not receptor-binding. gB and gH/gL execute fusion. To understand how the four glycoproteins cross-talk to each other we searched for biochemical defined complexes in infected and transfected cells, and in virions. We report that gD formed complexes with gB in absence of gH/gL, and with gH/gL in absence of gB. Complexes with similar composition were formed in infected and transfected cells. They were also present in virions prior to entry, and did not increase at virus fusion with cell. A panel of gD mutants enabled the preliminary location of part of the binding site in gD to gB to the aa 240-260 portion and downstream, with T306P307 as critical residues, and of the binding site to gH/gL at aa 260-310 portion, with P291P292 as critical residues. The results indicate that gD carries composite independent binding sites for gB and gH/gL, both of which partly located in the profusion domain. The second part of the project dealt with rational design of peptides inhibiting virus entry has been performed. Considering gB and gD, the crystal structure is known, so we designed peptides that dock in the structure or prevent the adoption of the final conformation of target molecule. Considering the other glycoproteins, of which the structure is not known, peptide libraries were analyzed. Among several peptides, some were identified as active, designed on glycoprotein B. Two of them were further analyzed. We identified peptide residues fundamental for the inhibiting activity, suggesting a possible mechanism of action. Furthermore, changing the flexibility of peptides, an increased activity was observed,with an EC50 under 10μM. New approaches will try to demonstrate the direct interaction between these peptides and the target glycoprotein B.

Genetic engineering and preclinical evaluation of oncolytic herpes simplex viruses retargeted to cancer-specific receptors

Oncolytic virotherapy exploits the ability of viruses to infect and kill cells. It is suitable as treatment for tumors that are not accessible by surgery and/or respond poorly to the current therapeutic approach. HSV is a promising oncolytic agent. It has a large genome size able to accommodate large transgenes and some attenuated oncolytic HSVs (oHSV) are already in clinical trials phase I and II. The aim of this thesis was the generation of HSV-1 retargeted to tumor-specific receptors and detargeted from HSV natural receptors, HVEM and Nectin-1. The retargeting was achieved by inserting a specific single chain antibody (scFv) for the tumor receptor selected inside the HSV glycoprotein gD. In this research three tumor receptors were considered: epidermal growth factor receptor 2 (HER2) overexpressed in 25-30% of breast and ovarian cancers and gliomas, prostate specific membrane antigen (PSMA) expressed in prostate carcinomas and in neovascolature of solid tumors; and epidermal growth factor receptor variant III (EGFRvIII). In vivo studies on HER2 retargeted viruses R-LM113 and R-LM249 have demonstrated their high safety profile. For R-LM249 the antitumor efficacy has been highlighted by target-specific inhibition of the growth of human tumors in models of HER2-positive breast and ovarian cancer in nude mice. In a murine model of HER2-positive glioma in nude mice, R-LM113 was able to significantly increase the survival time of treated mice compared to control. Up to now, PSMA and EGFRvIII viruses (R-LM593 and R-LM613) are only characterized in vitro, confirming the specific retargeting to selected targets. This strategy has proved to be generally applicable to a broad spectrum of receptors for which a single chain antibody is available.

Role of αvβ3 – Integrin and TLR2 in the innate response to Herpes Simplex Virus infection and Delivery of retargeted oncolytic Herpes Simplex via carrier cells

In the first part of my thesis I studied the mechanism of initiation of the innate response to HSV-1. Innate immune response is the first line of defense set up by the cell to counteract pathogens infection and it is elicited by the activation of a number of membrane or intracellular receptors and sensors, collectively indicated as PRRs, Patter Recognition Receptors. We reported that the HSV pathogen-associated molecular patterns (PAMP) that activate Toll-like receptor 2 (TLR2) and lead to the initiation of innate response are the virion glycoproteins gH/gL and gB, which constitute the conserved fusion core apparatus across the Herpesvirus. Specifically gH/gL is sufficient to initiate a signaling cascade which leads to NF-κB activation. Then, by gain and loss-of-function approaches, we found that αvβ3-integrin is a sensor of and plays a crucial role in the innate defense against HSV-1. We showed that αvβ3-integrin signals through a pathway that concurs with TLR2, affects activation/induction of interferons type 1, NF-κB, and a polarized set of cytokines and receptors. Thus, we demonstrated that gH/gL is sufficient to induce IFN1 and NF-κB via this pathway. From these data, we proposed that αvβ3-integrin is considered a class of non-TLR pattern recognition receptors. In the second part of my thesis I studied the capacity of human mesenchymal stromal cells isolated by fetal membranes (FM-hMSCs) to be used as carrier cells for the delivery of retargeted R-LM249 virus. The use of systemically administrated carrier cells to deliver oncolytic viruses to tumoral targets is a promising strategy in oncolytic virotherapy. We observed that FM-hMSCs can be infected by R-LM249 and we optimized the infection condition; then we demonstrate that stromal cells sustain the replication of retargeted R-LM249 and spread it to target tumoral cells. From these preliminary data FM-hMSCs resulted suitable to be used as carrier cells

Enhanced Mixed Integer Programming Techniques and Routing Problems

Mixed integer programming is up today one of the most widely used techniques for dealing with hard optimization problems. On the one side, many practical optimization problems arising from real-world applications (such as, e.g., scheduling, project planning, transportation, telecommunications, economics and finance, timetabling, etc) can be easily and effectively formulated as Mixed Integer linear Programs (MIPs). On the other hand, 50 and more years of intensive research has dramatically improved on the capability of the current generation of MIP solvers to tackle hard problems in practice. However, many questions are still open and not fully understood, and the mixed integer programming community is still more than active in trying to answer some of these questions. As a consequence, a huge number of papers are continuously developed and new intriguing questions arise every year. When dealing with MIPs, we have to distinguish between two different scenarios. The first one happens when we are asked to handle a general MIP and we cannot assume any special structure for the given problem. In this case, a Linear Programming (LP) relaxation and some integrality requirements are all we have for tackling the problem, and we are ``forced" to use some general purpose techniques. The second one happens when mixed integer programming is used to address a somehow structured problem. In this context, polyhedral analysis and other theoretical and practical considerations are typically exploited to devise some special purpose techniques. This thesis tries to give some insights in both the above mentioned situations. The first part of the work is focused on general purpose cutting planes, which are probably the key ingredient behind the success of the current generation of MIP solvers. Chapter 1 presents a quick overview of the main ingredients of a branch-and-cut algorithm, while Chapter 2 recalls some results from the literature in the context of disjunctive cuts and their connections with Gomory mixed integer cuts. Chapter 3 presents a theoretical and computational investigation of disjunctive cuts. In particular, we analyze the connections between different normalization conditions (i.e., conditions to truncate the cone associated with disjunctive cutting planes) and other crucial aspects as cut rank, cut density and cut strength. We give a theoretical characterization of weak rays of the disjunctive cone that lead to dominated cuts, and propose a practical method to possibly strengthen those cuts arising from such weak extremal solution. Further, we point out how redundant constraints can affect the quality of the generated disjunctive cuts, and discuss possible ways to cope with them. Finally, Chapter 4 presents some preliminary ideas in the context of multiple-row cuts. Very recently, a series of papers have brought the attention to the possibility of generating cuts using more than one row of the simplex tableau at a time. Several interesting theoretical results have been presented in this direction, often revisiting and recalling other important results discovered more than 40 years ago. However, is not clear at all how these results can be exploited in practice. As stated, the chapter is a still work-in-progress and simply presents a possible way for generating two-row cuts from the simplex tableau arising from lattice-free triangles and some preliminary computational results. The second part of the thesis is instead focused on the heuristic and exact exploitation of integer programming techniques for hard combinatorial optimization problems in the context of routing applications. Chapters 5 and 6 present an integer linear programming local search algorithm for Vehicle Routing Problems (VRPs). The overall procedure follows a general destroy-and-repair paradigm (i.e., the current solution is first randomly destroyed and then repaired in the attempt of finding a new improved solution) where a class of exponential neighborhoods are iteratively explored by heuristically solving an integer programming formulation through a general purpose MIP solver. Chapters 7 and 8 deal with exact branch-and-cut methods. Chapter 7 presents an extended formulation for the Traveling Salesman Problem with Time Windows (TSPTW), a generalization of the well known TSP where each node must be visited within a given time window. The polyhedral approaches proposed for this problem in the literature typically follow the one which has been proven to be extremely effective in the classical TSP context. Here we present an overall (quite) general idea which is based on a relaxed discretization of time windows. Such an idea leads to a stronger formulation and to stronger valid inequalities which are then separated within the classical branch-and-cut framework. Finally, Chapter 8 addresses the branch-and-cut in the context of Generalized Minimum Spanning Tree Problems (GMSTPs) (i.e., a class of NP-hard generalizations of the classical minimum spanning tree problem). In this chapter, we show how some basic ideas (and, in particular, the usage of general purpose cutting planes) can be useful to improve on branch-and-cut methods proposed in the literature.