Search PubMed⌕ Search

Biomedical subjects

G Rozenberg

Publications and source records attributed to G Rozenberg.

4 recordsLinked to original sources

Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates.

The micronuclear versions of genes in stichotrichous ciliates are interrupted by multiple, short, non-coding DNA segments called internal eliminated segments, or IESs. IESs divide a gene into macronuclear destined segments, or MDSs. In some micronuclear genes MDSs are in a scrambled disorder. During development of a micronucleus into a macronucleus after cell mating the IESs are excised from micronuclear genes and the MDSs are spliced in the sequentially correct order. Pairs of short repeat sequences in the ends of MDSs undergo homologous recombination to excise IESs and splice MDSs. However, the repeat sequences are too short to guide unambiguously their own alignment in preparation for recombination. Based on experiments by others on the distantly related ciliate, Paramecium, we propose a molecular model of template-guided recombination to explain the excision of the 100,000-150,000 IESs and splicing of MDSs, including unscrambling, in the genome of stichotrichous ciliates. The model solves the problem of correct pairing of pointers, precisely identifies MDS-IES junctions, and provides for irreversible recombination.

Animals↗

Computing with DNA by operating on plasmids.

A new method of computing using DNA plasmids is introduced and the potential advantages are listed. The new method is illustrated by reporting a laboratory computation of an instance of the NP-complete algorithmic problem of computing the cardinal number of a maximal independent subset of the vertex set of a graph. A circular DNA plasmid, specifically designed for this method of molecular computing, was constructed. This computational plasmid contains a specially inserted series of DNA sequence segments, each of which is bordered by a characteristic pair of restriction enzyme sites. For the computation reported here, the DNA sequence segments of this series were used to represent the vertices of the graph being investigated. By applying a scheme of enzymatic treatments to the computational plasmids, modified plasmids were generated from which the solution of the computational problem was selected. This new method of computing is applicable to a wide variety of algorithmic problems. Further computations in this style are in progress.

Computing Methodologies↗

Differential nitric oxide release and sensitivity to injury in different murine mammary tumor cell lines.

The purpose of this study was to determine whether nitric oxide (NO) production by different mammary tumor cell lines correlated with their sensitivity to NO mediated injury. Three mammary tumor cell lines LM2, LM3 and LMM3 syngeneic to BALB/c mice were cultured in vitro with IFNgamma + LPS. Different levels of NO production among the three lines were detected in culture supernatants. The only tumor cell line which did not produce NO (LM2) showed the highest sensitivity to SNP-derived NO cytotoxicity (87%), while LM3 and LMM3 which both produced higher levels of NO than LM2, showed lower cytotoxicity by SNP (39% and 22% respectively). Spleen cells (SC) from M2 tumor bearing mice (TBM) were able to lyse LM2 cells by NO-dependent mechanisms. SC from M3-TBM exerted cytotoxicity against LM3 cells mainly by NO-independent mechanisms. Thus, we postulate an inverse correlation between NO production and NO mediated cytotoxicity in the three mammary tumor cell lines. It is possible that tumor cells producing NO develop mechanisms to resist NO injury.

Animals↗

Bidirectional sticker systems.

We introduce two-sided sticker systems, the two-sided variant of a computability model introduced as an abstraction of Adleman's style of DNA computing and of the matching of the so-called Watson-Crick complements. Several types of sticker systems are shown to have the same power as regular grammars, one variant is found to represent the linear languages, and another one is proved to be able to represent any recursively enumerable language. From this result we infer that any recursively enumerable language can be represented as the projection of the intersection of two minimal linear languages.

Base Composition↗