Vaccinia Virus Protein C6 Is a Virulence Factor that Binds TBK-1 Adaptor Proteins and Inhibits Activation of IRF3 and IRF7

Recognition of viruses by pattern recognition receptors (PRRs) causes interferon-β (IFN-β) induction, a key event in the anti-viral innate immune response, and also a target of viral immune evasion. Here the vaccinia virus (VACV) protein C6 is identified as an inhibitor of PRR-induced IFN-β expression by a functional screen of select VACV open reading frames expressed individually in mammalian cells. C6 is a member of a family of Bcl-2-like poxvirus proteins, many of which have been shown to inhibit innate immune signalling pathways. PRRs activate both NF-κB and IFN regulatory factors (IRFs) to activate the IFN-β promoter induction. Data presented here show that C6 inhibits IRF3 activation and translocation into the nucleus, but does not inhibit NF-κB activation. C6 inhibits IRF3 and IRF7 activation downstream of the kinases TANK binding kinase 1 (TBK1) and IκB kinase-ε (IKKε), which phosphorylate and activate these IRFs. However, C6 does not inhibit TBK1- and IKKε-independent IRF7 activation or the induction of promoters by constitutively active forms of IRF3 or IRF7, indicating that C6 acts at the level of the TBK1/IKKε complex. Consistent with this notion, C6 immunoprecipitated with the TBK1 complex scaffold proteins TANK, SINTBAD and NAP1. C6 is expressed early during infection and is present in both nucleus and cytoplasm. Mutant viruses in which the C6L gene is deleted, or mutated so that the C6 protein is not expressed, replicated normally in cell culture but were attenuated in two in vivo models of infection compared to wild type and revertant controls. Thus C6 contributes to VACV virulence and might do so via the inhibition of PRR-induced activation of IRF3 and IRF7

Graph Partitioning Algorithms With Applications To Scientific Computing

Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a specified number of subsets such that few edges join two vertices in different subsets. Several new graph partitioning algorithms have been developed in the past few years, and we survey some of this activity. We describe the terminology associated with graph partitioning, the complexity of computing good separators, and graphs that have good separators. We then discuss early algorithms for graph partitioning, followed by three new algorithms based on geometric, algebraic, and multilevel ideas. The algebraic algorithm relies on an eigenvector of a Laplacian matrix associated with the graph to compute the partition. The algebraic algorithm is justified by formulating graph partitioning as a quadratic assignment p..