Purification and quantification of recombinant Epstein-Barr viral glycoproteins gp350/220 from Chinese hamster ovary cells

Truncated Epstein-Barr virus (EBV) membrane antigen gp350/220 (EBV-MA) lacking the membrane anchor was expressed and secreted into the medium of recombinant Chinese hamster ovary cells that had been cultured in Plasmapur hollow-fibre modules using defined serum-free medium. The EBV-MA in the medium was concentrated by 70% (w/v) ammonium sulphate precipitation and subsequently purified by immunoaffinity chromatography using an anti-EBV-MA (EBV.0T6) monoclonal antibody (mAb) column. Adsorbed antigen was eluted with 3 M MgCl2 in phosphate-buffered saline, concentrated by Mono Q anion-exchange chromatography and analysed by sodium dodecyl sulphate-polyacrylamide gel electrophoresis, silver staining and Western blotting using EBV-positive serum and anti-EBV-MA specific mAbs. Monospecific polyclonal rabbit antibodies against the purified EBV-MA were raised and purified by protein G affinity chromatography. For the measurement of EBV-MA antigen levels a sandwich enzyme-linked immunosorbent assay using rabbit polyclonal antibodies and a horseradish peroxidase-conjugated anti-MA mAb was developed having a detection level of 10 ng/ml

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity

Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound w.r.t. reduction for every CTRS, while they are complete w.r.t. reduction. Here, soundness w.r.t. reduction means that every reduction sequence of the corresponding unraveled TRS, of which the initial and end terms are over the original signature, can be simulated by the reduction of the original CTRS. In this paper, we show that an optimized variant of Ohlebusch's unraveling for a deterministic CTRS is sound w.r.t. reduction if the corresponding unraveled TRS is left-linear or both right-linear and non-erasing. We also show that soundness of the variant implies that of Ohlebusch's unraveling. Finally, we show that soundness of Ohlebusch's unraveling is the weakest in soundness of the other unravelings and a transformation, proposed by Serbanuta and Rosu, for (normal) deterministic CTRSs, i.e., soundness of them respectively implies that of Ohlebusch's unraveling.Comment: 49 pages, 1 table, publication in Special Issue: Selected papers of the "22nd International Conference on Rewriting Techniques and Applications (RTA'11)

CoCoWeb - A Convenient Web Interface for Confluence Tools

6th International Workshop on Confluence6th International Workshop on ConfluenceWe present a useful web interface for tools that participate in the annual confluence competition

Improving automatic confluence analysis of rewrite systems by redundant rules

We describe how to utilize redundant rewrite rules, i.e., rules that can be simulated by other rules, when (dis)proving confluence of term rewrite systems. We demonstrate how automatic confluence provers benefit from the addition as well as the removal of redundant rules. Due to their simplicity, our transformations were easy to formalize in a proof assistant and are thus amenable to certification. Experimental results show the surprising gain in power