In experiments to ascertain the biochemical basis of a genetically determined deficiency of the third component of complement (C3) in guinea pigs, we found that C3-deficient liver and peritoneal macrophages contain C3 messenger RNA of normal size (approximately 5 kb) and amounts, that this mRNA programs synthesis of pro-C3 in oocytes primed with liver RNA and in primary macrophage cultures. In ...

The slow but spontaneous and ubiquitous formation of C3(H2O), the hydrolytic and conformationally rearranged product of C3, initiates antibody-independent activation of the complement system that is a key first line of antimicrobial defense. The structure of C3(H2O) has not been determined. Here we subjected C3(H2O) to quantitative cross-linking/mass spectrometry (QCLMS). This revealed details ...

otitis media with effusion (ome) is very common in pediatric patients. immune reactions in serum and middle ear system play roles in the etiology, pathogenesis and prevention of otitis media. immunologically active antigens interact with immunocompetent cells in the lamina propria of the middle ear to produce a local immune response. in this investigation, 32 sera and 50 middle ear fluid sample...

A hypomorphic electrophoretic variant of C3 with the mobility of C3 F was found in the serum of a healthy man, his mother, and one of his two sons. Serum C3 concentrations were normal in these subjects as were hemolytic complement levels. Metabolic studies with radiolabeled purified C3 FF and C3 SS in the propositus suggested, but did not prove, that the variant C3 F gene was hyposynthetic. The...

A ghost in the stable module category of a group G is a map between representations of G that is invisible to Tate cohomology. We show that the only non-trivial finite p-groups whose stable module categories have no non-trivial ghosts are the cyclic groups C2 and C3. We compare this to the situation in the derived category of a commutative ring. We also determine for which groups G the second p...

A graph is (k1, k2)-colorable if its vertex set can be partitioned into a graph with maximum degree at most k1 and and a graph with maximum degree at most k2. We show that every (C3, C4, C6)-free planar graph is (0, 6)-colorable. We also show that deciding whether a (C3, C4, C6)-free planar graph is (0, 3)-colorable is NP-complete.