BAK overexpression mediates p53-independent apoptosis inducing effects on human gastric cancer cells

BACKGROUND: BAK (Bcl-2 homologous antagonist/killer) is a novel pro-apoptotic gene of the Bcl-2 family. It has been reported that gastric tumors have reduced BAK levels when compared with the normal mucosa. Moreover, mutations of the BAK gene have been identified in human gastrointestinal cancers, suggesting that a perturbation of BAK-mediated apoptosis may contribute to the pathogenesis of gastric cancer. In this study, we explored the therapeutic effects of gene transfer mediated elevations in BAK expression on human gastric cancer cells in vitro. METHODS: Eukaryotic expression vector for the BAK gene was constructed and transferred into gastric cancer cell lines, MKN-45 (wild-type p53) and MKN-28 (mutant-type p53). RT-PCR and Western Blotting detected cellular BAK gene expression. Cell growth activities were detected by MTT colorimetry and flow cytometry, while apoptosis was assayed by electronic microscopy and TUNEL. Western Blotting and colorimetry investigated cellular caspase-3 activities. RESULTS: BAK gene transfer could result in significant BAK overexpression, decreased in vitro growth, cell cycle G(0)/G(1 )arrest, and induced apoptosis in gastric cancer cells. In transferred cells, inactive caspase-3 precursor was cleaved into the active subunits p20 and p17, during BAK overexpression-induced apoptosis. In addition, this process occurred equally well in p53 wild-type (MKN-45), or in p53 mutant-type (MKN-28) gastric cancer cells. CONCLUSIONS: The data presented suggests that overexpression of the BAK gene can lead to apoptosis of gastric cancer cells in vitro, which does not appear to be dependent on p53 status. The action mechanism of BAK mediated apoptosis correlates with activation of caspase-3. This could be served as a potential strategy for further development of gastric cancer therapies

Space- and Computationally-Efficient Set Reconciliation via Parity Bitmap Sketch (PBS)

Set reconciliation is a fundamental algorithmic problem that arises in many networking, system, and database applications. In this problem, two large sets A and B of objects (bitcoins, files, records, etc.) are stored respectively at two different network-connected hosts, which we name Alice and Bob respectively. Alice and Bob communicate with each other to learn $A\Delta B$, the difference between A and B, and as a result the reconciled set $A\bigcup B$. Current set reconciliation schemes are based on either Invertible Bloom Filters (IBF) or Error-Correction Codes (ECC). The former has a low computational complexity of O(d), where d is the cardinality of $A\Delta B$, but has a high communication overhead that is several times larger than the theoretical minimum. The latter has a low communication overhead close to the theoretical minimum, but has a much higher computational complexity of $O(d^2)$. In this work, we propose Parity Bitmap Sketch (PBS), an ECC- based set reconciliation scheme that gets the better of both worlds: PBS has both a low computational complexity of O(d) just like IBF-based solutions and a low communication overhead of roughly twice the theoretical minimum. A separate contribution of this work is a novel rigorous analytical framework that can be used for the precise calculation of various performance metrics and for the near-optimal parameter tuning of PBS

catena-Poly[[[diiodidocadmium(II)]-μ-1-(4-pyridylmeth­yl)-1H-benzimidazole] methanol hemisolvate]

In the title coordination polymer, {[CdI2(C13H11N3)]·0.5CH4O}n, each CdII center is four-coordinated by two N-atom donors from two 1-(4-pyridylmeth­yl)-1H-benzimidazole (L) ligands and two iodide anions, forming a tetra­hedral coordination geometry. L ligands bridge adjacent CdII ions, generating two crystallographically independent approximately orthogonal one-dimensional chains. The methanol solvent mol­ecule associates with one of the chains via O—H⋯I inter­actions