Novel Chemokine-Based Immunotoxins for Potent and Selective Targeting of Cytomegalovirus Infected Cells

Immunotoxins as antiviral therapeutics are largely unexplored but have promising prospective due to their high selectivity potential and their unparalleled efficiency. One recent example targeted the virus-encoded G protein-coupled receptor US28 as a strategy for specific and efficient treatment of human cytomegalovirus (HCMV) infections. US28 is expressed on virus-infected cells and scavenge chemokines by rapid internalization. The chemokine-based fusion-toxin protein (FTP) consisted of a variant (F49A) of CX3CL1 specifically targeting US28 linked to the catalytic domain of Pseudomonas exotoxin A (PE). Here, we systematically seek to improve F49A-FTP by modifications in its three structural domains; we generated variants with (1) altered chemokine sequence (K14A, F49L, and F49E), (2) shortened and elongated linker region, and (3) modified toxin domain. Only F49L-FTP displayed higher selectivity in its binding to US28 versus CX3CR1, the endogenous receptor for CX3CL1, but this was not matched by a more selective killing of US28-expressing cells. A longer linker and different toxin variants decreased US28 affinity and selective killing. Thereby, F49A-FTP represents the best candidate for HCMV treatment. Many viruses encode internalizing receptors suggesting that not only HCMV but also, for instance, Epstein-Barr virus and Kaposi’s sarcoma-associated herpesvirus may be targeted by FTPs

Rationally designed chemokine-based toxin targeting the viral G protein-coupled receptor US28 potently inhibits cytomegalovirus infection in vivo

The use of receptor–ligand interactions to direct toxins to kill diseased cells selectively has shown considerable promise for treatment of a number of cancers and, more recently, autoimmune disease. Here we move the fusion toxin protein (FTP) technology beyond cancer/autoimmune therapeutics to target the human viral pathogen, human cytomegalovirus (HCMV), on the basis of its expression of the 7TM G protein-coupled chemokine receptor US28. The virus origin of US28 provides an exceptional chemokine-binding profile with high selectivity and improved binding for the CX3C chemokine, CX(3)CL1. Moreover, US28 is constitutively internalizing by nature, providing highly effective FTP delivery. We designed a synthetic CX(3)CL1 variant engineered to have ultra-high affinity for US28 and greater specificity for US28 than the natural sole receptor for CX(3)CL1, CX(3)CR1, and we fused the synthetic variant with the cytotoxic domain of Pseudomonas Exotoxin A. This novel strategy of a rationally designed FTP provided unparalleled anti-HCMV efficacy and potency in vitro and in vivo

On the hat problem on a graph

The topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player can see everybody excluding himself. We consider such a problem on a graph, where vertices correspond to players, and a player can see each player to whom he is connected by an edge. The solution of the hat problem on a graph is known for trees and for cycles on four or at least nine vertices. In this paper first we give an upper bound on the maximum chance of success for graphs with neighborhood-dominated vertices. Next we solve the problem on unicyclic graphs containing a cycle on at least nine vertices. We prove that the maximum chance of success is one by two. Then we consider the hat problem on a graph with a universal vertex. We prove that there always exists an optimal strategy such that in every case some vertex guesses its color. Moreover, we prove that there exists a graph with a universal vertex for which there exists an optimal strategy such that in some case no vertex guesses its color. We also give some Nordhaus-Gaddum type inequalities