Human quiescin-sulfhydryl oxidase, QSOX1: probing internal redox steps by mutagenesis

The flavoprotein quiescin-sulfhydryl oxidase (QSOX) rapidly inserts disulfide bonds into unfolded, reduced proteins with the concomitant reduction of oxygen to hydrogen peroxide. This study reports the first heterologous expression and enzymological characterization of a human QSOX1 isoform. Like QSOX isolated from avian egg white, recombinant HsQSOX1 is highly active toward reduced ribonuclease A (RNase) and dithiothreitol but shows a >100-fold lower k cat/ K m for reduced glutathione. Previous studies on avian QSOX led to a model in which reducing equivalents were proposed to relay through the enzyme from the first thioredoxin domain (C70-C73) to a distal disulfide (C509-C512), then across the dimer interface to the FAD-proximal disulfide (C449-C452), and finally to the FAD. The present work shows that, unlike the native avian enzyme, HsQSOX1 is monomeric. The recombinant expression system enabled construction of the first cysteine mutants for mechanistic dissection of this enzyme family. Activity assays with mutant HsQSOX1 indicated that the conserved distal C509-C512 disulfide is dispensable for the oxidation of reduced RNase or dithiothreitol. The four other cysteine residues chosen for mutagenesis, C70, C73, C449, and C452, are all crucial for efficient oxidation of reduced RNase. C452, of the proximal disulfide, is shown to be the charge-transfer donor to the flavin ring of QSOX, and its partner, C449, is expected to be the interchange thiol, forming a mixed disulfide with C70 in the thioredoxin domain. These data demonstrate that all the internal redox steps occur within the same polypeptide chain of mammalian QSOX and commence with a direct interaction between the reduced thioredoxin domain and the proximal disulfide of the Erv/ALR domain.     

Esterase from the oil-degrading Acinetobacter lwoffii RAG-1: Sequence analysis and over-expression in Escherichia coli

Abstract The antigenic properties of the surface layer (S-layer) proteins of various Campylobacter rectus strains including 24 clinical isolates and the type strain ATCC 33238 were examined. S-layer proteins were extracted from whole cells by acid treatment according to the method of McCoy et al. (Infect. Immun. 11, 517–525, 1975). The acid extracts from 23 of the isolates and ATCC 33238 contained two major proteins with molecular masses of 130 kDa and 150 kDa, both of which were identified as subunits of the S-layer after comparison with the protein profiles of acid-treated (S-layer-deficient) cells. An S-layer protein from one isolate (CI-808) demonstrated a different molecular mass (160 kDa). Both the 150-kDa proteins of ATCC 33238 and isolate CI-306 and the 160-kDa protein of CI-808 were purified by ion-exchange chromatography in the presence of urea. In Ouchterlony immunodiffusion experiments with these purified proteins and rabbit antiserum raised to each purified protein, both common and strain-specific antigenic determinants were identified in the C. rectus S-layer proteins.     

ICAMs Are Not Obligatory for Functional Immune Synapses between Naive CD4 T Cells and Lymph Node DCs

1. Download high-res image (270KB)
2. Download full-size image

     

Functional Compartmentalization within Starburst Amacrine Cell Dendrites in the Retina

1. Download high-res image (153KB)
2. Download full-size image

     

Biomolecular network motif counting and discovery by color coding

Protein-protein interaction (PPI) networks of many organisms share global topological features such as degree distribution, k-hop reachability, betweenness and closeness. Yet, some of these networks can differ significantly from the others in terms of local structures: e.g. the number of specific network motifs can vary significantly among PPI networks. Counting the number of network motifs provides a major challenge to compare biomolecular networks. Recently developed algorithms have been able to count the number of induced occurrences of subgraphs with k < or = 7 vertices. Yet no practical algorithm exists for counting non-induced occurrences, or counting subgraphs with k > or = 8 vertices. Counting non-induced occurrences of network motifs is not only challenging but also quite desirable as available PPI networks include several false interactions and miss many others. In this article, we show how to apply the 'color coding' technique for counting non-induced occurrences of subgraph topologies in the form of trees and bounded treewidth subgraphs. Our algorithm can count all occurrences of motif G' with k vertices in a network G with n vertices in time polynomial with n, provided k = O(log n). We use our algorithm to obtain 'treelet' distributions for k < or = 10 of available PPI networks of unicellular organisms (Saccharomyces cerevisiae Escherichia coli and Helicobacter Pyloris), which are all quite similar, and a multicellular organism (Caenorhabditis elegans) which is significantly different. Furthermore, the treelet distribution of the unicellular organisms are similar to that obtained by the 'duplication model' but are quite different from that of the 'preferential attachment model'. The treelet distribution is robust w.r.t. sparsification with bait/edge coverage of 70% but differences can be observed when bait/edge coverage drops to 50%.