MUTATIONS IN STAT3 ASSOCIATED WITH HUMAN HYPER IgE SYNDROME ENHANCE NFκB AND MAPK-MEDIATED GENE EXPRESSION

Hyper IgE syndrome (HIES) is a multisystem disorder resulting in bone and immune system abnormalities. It is associated with mutations in STAT3, which disrupt protein domains responsible for transcriptional function. Patients with HIES display osteoporosis and enhanced inflammatory cytokine production similar to hematopoietic Stat3-deficient mice. Since osteoclast and inflammatory cytokine genes are NFκB targets, these observations indicate a possible deregulation of NFκB signaling in both mice and humans with STAT3-deficiency. Here, we sought to examine the role of STAT3 in the regulation of NFκB-mediated gene expression through analysis of three HIES STAT3 point mutations in both hematopoietic and non- hematopoietic cells. We found that IL-6-induced tyrosine phosphorylation of STAT3 was partially or completely abrogated by HIES mutations in the transactivation domain (V713L) or SH2 domain (V637M), respectively, in both hematopoietic and non- hematopoietic cells. By contrast, IL-6-induced tyrosine phosphorylation of an HIES mutant in the STAT3 DNA-binding domain (R382W) was intact. The R382W and V713L mutants significantly reduced IL-6-dependent STAT3 transcriptional activity in reporter gene assays. Moreover, the R382W and V637M mutants significantly diminished IL-6-responsive expression of the endogenous STAT3 target gene, Socs3, as assessed by quantitative real-time PCR (qPCR) in the RAW macrophage cell line. These observations indicate the HIES mutants dominantly suppress the transcriptional activity of wild type STAT3, albeit to varying degrees. All three HIES mutants enhanced LPS-induced expression of the NFκB target genes IL6 (IL-6), Cxcl10 (IP- 10), and Tnf (TNFα) in RAW cells, as indicated by qPCR. Furthermore, overexpression of wild type STAT3 in Stat3-deficient murine embryonic fibroblasts significantlyreduced LPS-stimulated expression of IL6, Cxcl10, and IL12p35. In addition, in aprimary murine osteoclast differentiation assay, a STAT3-specific SH2 domain inhibitor led to significantly increased levels of osteoclast-specific gene expression. These results suggest that STAT3 serves as a negative regulator of NFκB-mediated gene expression, and furthermore imply that STAT3 mutations associated with HIES contribute to the osteopenia and inflammation observed in HIES patients.

GENETIC INTERACTIONS OF FACTORS THAT REGULATE ALTERNATIVE RNA SPLICING IN THE MALE GERM LINE OF DROSOPHILA

Alternative RNA splicing is a critical process that contributes variety to protein functions, and further controls cell differentiation and normal development. Although it is known that most eukaryotic genes produce multiple transcripts in which splice site selection is regulated, how RNA binding proteins cooperate to activate and repress specific splice sites is still poorly understood. In addition how the regulation of alternative splicing affects germ cell development is also not well known. In this study, Drosophila Transformer 2 (Tra2) was used as a model to explore both the mechanism of its repressive function on its own pre-mRNA splicing, and the effect of the splicing regulation on spermatogenesis in testis. Half-pint (Hfp), a protein known as splicing activator, was identified in an S2 cell-based RNAi screen as a co-repressor that functions in combination with Tra2 in the splicing repression of the M1 intron. Its repressive splicing function is found to be sequence specific and is dependent on both the weak 3’ splice site and an intronic splicing silencer within the M1 intron. In addition we found that in vivo, two forms of Hfp are expressed in a cell type specific manner. These alternative forms differ at their amino terminus affecting the presence of a region with four RS dipeptides. Using assays in Drosophila S2 cells, we determined that the alternative N terminal domain is necessary in repression. This difference is probably due to differential localization of the two isoforms in the nucleus and cytoplasm. Our in vivo studies show that both Hfp and Tra2 are required for normal spermatogenesis and cooperate in repression of M1 splicing in spermatocytes. But interestingly, Tra2 and Hfp antagonize each other’s function in regulating germline specific alternative splicing of Taf1 (TBP associated factor 1). Genetic and cytological studies showed that mutants of Hfp and Taf1 both cause similar defects in meiosis and spermatogenesis. These results suggest Hfp regulates normal spermatogenesis partially through the regulation of taf1 splicing. These observations indicate that Hfp regulates tra2 and taf1 activity and play an important role in germ cell differentiation of male flies.

Thermo -modulation of MuSVts110 splicing by inhibitory RNA sequences

Viral systems have contributed tremendously to the understanding of eukaryotic molecular biology. The proportional pattern of retroviral RNA expression offers many clues into the alternative splicing of cellular transcripts. The MuSVts110 virus presents an unusual expression system, where the mechanistic combination of RNA splicing and cellular transformation can be physiologically manipulated. Splicing of MuSVts110 pre-mRNA occurs inefficiently (30%-50%) at 33$\sp\circ$C or below and is subdued at 39$\sp\circ$C ($<$5%). Like most alternatively spliced cellular and retroviral transcripts, the MuSVts110 pre-mRNA contains cis-acting intron and exon sequences that attenuate splicing. These include a splicing inhibitory sequence at the 3$\prime$ end of the MuSVts110 v-mos exon, called the E2 Distal Element (E2DE), and a sub-optimal 3$\prime$ splice site. The E2DE directly inhibits MuSVts110 RNA splicing in a sequence-specific fashion at 39$\sp\circ$C but not at 28$\sp\circ$C, potentially through the association of cellular factors. Inefficient MuSVts110 splicing is pre-dominantly attributed to the utilization of multiple weak branchpoint sequences located between $-113$ and $-34$ nucleotides upstream of the 3$\prime$ splice site. The molecular control of MuSVts110 splicing, represented primarily by scattered multiple inefficient branchpoint sequences that are conditionally modulated by the E2DE at higher growth temperatures, is discussed. ^

Accepting splicing systems with permitting and forbidding words

Abstract: In this paper we propose a generalization of the accepting splicingsystems introduced in Mitrana et al. (Theor Comput Sci 411:2414?2422,2010). More precisely, the input word is accepted as soon as a permittingword is obtained provided that no forbidding word has been obtained sofar, otherwise it is rejected. Note that in the new variant of acceptingsplicing system the input word is rejected if either no permitting word isever generated (like in Mitrana et al. in Theor Comput Sci 411:2414?2422,2010) or a forbidding word has been generated and no permitting wordhad been generated before. We investigate the computational power ofthe new variants of accepting splicing systems and the interrelationshipsamong them. We show that the new condition strictly increases thecomputational power of accepting splicing systems. Although there areregular languages that cannot be accepted by any of the splicing systemsconsidered here, the new variants can accept non-regular and even non-context-free languages, a situation that is not very common in the case of(extended) finite splicing systems without additional restrictions. We alsoshow that the smallest class of languages out of the four classes definedby accepting splicing systems is strictly included in the class of context-free languages. Solutions to a few decidability problems are immediatelyderived from the proof of this result.

Splicing Systems: Accepting Versus Generating.

In this paper we propose a condition for rejecting the input word by an accepting splicing system which is defined by a finite set of forbidding words. We investigate the computational power of the new variants of accepting splicing systems. We show that the new condition strictly increases the computational power of accepting splicing systems. Rather surprisingly, accepting splicing systems considered here can accept non-regular languages, a situation that has never occurred in the case of (extended) finite splicing systems without additional restrictions.

Rule Representation in Distributed Environments with Accepting Networks of Splicing Processors.

This paper presents the model named Accepting Networks of Evolutionary Processors as NP-problem solver inspired in the biological DNA operations. A processor has a rules set, splicing rules in this model,an object multiset and a filters set. Rules can be applied in parallel since there exists a large number of copies of objects in the multiset. Processors can form a graph in order to solve a given problem. This paper shows the network configuration in order to solve the SAT problem using linear resources and time. A rule representation arquitecture in distributed environments can be easily implemented using these networks of processors, such as decision support systems, as shown in the paper.

Modelo de computación conexionista inspirado en las redes de procesadores evolutivos y su aprendizaje

La informática teórica es una disciplina básica ya que la mayoría de los avances en informática se sustentan en un sólido resultado de esa materia. En los últimos a~nos debido tanto al incremento de la potencia de los ordenadores, como a la cercanía del límite físico en la miniaturización de los componentes electrónicos, resurge el interés por modelos formales de computación alternativos a la arquitectura clásica de von Neumann. Muchos de estos modelos se inspiran en la forma en la que la naturaleza resuelve eficientemente problemas muy complejos. La mayoría son computacionalmente completos e intrínsecamente paralelos. Por este motivo se les está llegando a considerar como nuevos paradigmas de computación (computación natural). Se dispone, por tanto, de un abanico de arquitecturas abstractas tan potentes como los computadores convencionales y, a veces, más eficientes: alguna de ellas mejora el rendimiento, al menos temporal, de problemas NPcompletos proporcionando costes no exponenciales. La representación formal de las redes de procesadores evolutivos requiere de construcciones, tanto independientes, como dependientes del contexto, dicho de otro modo, en general una representación formal completa de un NEP implica restricciones, tanto sintácticas, como semánticas, es decir, que muchas representaciones aparentemente (sintácticamente) correctas de casos particulares de estos dispositivos no tendrían sentido porque podrían no cumplir otras restricciones semánticas. La aplicación de evolución gramatical semántica a los NEPs pasa por la elección de un subconjunto de ellos entre los que buscar los que solucionen un problema concreto. En este trabajo se ha realizado un estudio sobre un modelo inspirado en la biología celular denominado redes de procesadores evolutivos [55, 53], esto es, redes cuyos nodos son procesadores muy simples capaces de realizar únicamente un tipo de mutación puntual (inserción, borrado o sustitución de un símbolo). Estos nodos están asociados con un filtro que está definido por alguna condición de contexto aleatorio o de pertenencia. Las redes están formadas a lo sumo de seis nodos y, teniendo los filtros definidos por una pertenencia a lenguajes regulares, son capaces de generar todos los lenguajes enumerables recursivos independientemente del grafo subyacente. Este resultado no es sorprendente ya que semejantes resultados han sido documentados en la literatura. Si se consideran redes con nodos y filtros definidos por contextos aleatorios {que parecen estar más cerca a las implementaciones biológicas{ entonces se pueden generar lenguajes más complejos como los lenguajes no independientes del contexto. Sin embargo, estos mecanismos tan simples son capaces de resolver problemas complejos en tiempo polinomial. Se ha presentado una solución lineal para un problema NP-completo, el problema de los 3-colores. Como primer aporte significativo se ha propuesto una nueva dinámica de las redes de procesadores evolutivos con un comportamiento no determinista y masivamente paralelo [55], y por tanto todo el trabajo de investigación en el área de la redes de procesadores se puede trasladar a las redes masivamente paralelas. Por ejemplo, las redes masivamente paralelas se pueden modificar de acuerdo a determinadas reglas para mover los filtros hacia las conexiones. Cada conexión se ve como un canal bidireccional de manera que los filtros de entrada y salida coinciden. A pesar de esto, estas redes son computacionalmente completas. Se pueden también implementar otro tipo de reglas para extender este modelo computacional. Se reemplazan las mutaciones puntuales asociadas a cada nodo por la operación de splicing. Este nuevo tipo de procesador se denomina procesador splicing. Este modelo computacional de Red de procesadores con splicing ANSP es semejante en cierto modo a los sistemas distribuidos en tubos de ensayo basados en splicing. Además, se ha definido un nuevo modelo [56] {Redes de procesadores evolutivos con filtros en las conexiones{ , en el cual los procesadores tan solo tienen reglas y los filtros se han trasladado a las conexiones. Dicho modelo es equivalente, bajo determinadas circunstancias, a las redes de procesadores evolutivos clásicas. Sin dichas restricciones el modelo propuesto es un superconjunto de los NEPs clásicos. La principal ventaja de mover los filtros a las conexiones radica en la simplicidad de la modelización. Otras aportaciones de este trabajo ha sido el dise~no de un simulador en Java [54, 52] para las redes de procesadores evolutivos propuestas en esta Tesis. Sobre el término "procesador evolutivo" empleado en esta Tesis, el proceso computacional descrito aquí no es exactamente un proceso evolutivo en el sentido Darwiniano. Pero las operaciones de reescritura que se han considerado pueden interpretarse como mutaciones y los procesos de filtrado se podrían ver como procesos de selección. Además, este trabajo no abarca la posible implementación biológica de estas redes, a pesar de ser de gran importancia. A lo largo de esta tesis se ha tomado como definición de la medida de complejidad para los ANSP, una que denotaremos como tama~no (considerando tama~no como el número de nodos del grafo subyacente). Se ha mostrado que cualquier lenguaje enumerable recursivo L puede ser aceptado por un ANSP en el cual el número de procesadores está linealmente acotado por la cardinalidad del alfabeto de la cinta de una máquina de Turing que reconoce dicho lenguaje L. Siguiendo el concepto de ANSP universales introducido por Manea [65], se ha demostrado que un ANSP con una estructura de grafo fija puede aceptar cualquier lenguaje enumerable recursivo. Un ANSP se puede considerar como un ente capaz de resolver problemas, además de tener otra propiedad relevante desde el punto de vista práctico: Se puede definir un ANSP universal como una subred, donde solo una cantidad limitada de parámetros es dependiente del lenguaje. La anterior característica se puede interpretar como un método para resolver cualquier problema NP en tiempo polinomial empleando un ANSP de tama~no constante, concretamente treinta y uno. Esto significa que la solución de cualquier problema NP es uniforme en el sentido de que la red, exceptuando la subred universal, se puede ver como un programa; adaptándolo a la instancia del problema a resolver, se escogerín los filtros y las reglas que no pertenecen a la subred universal. Un problema interesante desde nuestro punto de vista es el que hace referencia a como elegir el tama~no optimo de esta red.---ABSTRACT---This thesis deals with the recent research works in the area of Natural Computing {bio-inspired models{, more precisely Networks of Evolutionary Processors first developed by Victor Mitrana and they are based on P Systems whose father is Georghe Paun. In these models, they are a set of processors connected in an underlying undirected graph, such processors have an object multiset (strings) and a set of rules, named evolution rules, that transform objects inside processors[55, 53],. These objects can be sent/received using graph connections provided they accomplish constraints defined at input and output filters processors have. This symbolic model, non deterministic one (processors are not synchronized) and massive parallel one[55] (all rules can be applied in one computational step) has some important properties regarding solution of NP-problems in lineal time and of course, lineal resources. There are a great number of variants such as hybrid networks, splicing processors, etc. that provide the model a computational power equivalent to Turing machines. The origin of networks of evolutionary processors (NEP for short) is a basic architecture for parallel and distributed symbolic processing, related to the Connection Machine as well as the Logic Flow paradigm, which consists of several processors, each of them being placed in a node of a virtual complete graph, which are able to handle data associated with the respective node. All the nodes send simultaneously their data and the receiving nodes handle also simultaneously all the arriving messages, according to some strategies. In a series of papers one considers that each node may be viewed as a cell having genetic information encoded in DNA sequences which may evolve by local evolutionary events, that is point mutations. Each node is specialized just for one of these evolutionary operations. Furthermore, the data in each node is organized in the form of multisets of words (each word appears in an arbitrarily large number of copies), and all the copies are processed in parallel such that all the possible events that can take place do actually take place. Obviously, the computational process just described is not exactly an evolutionary process in the Darwinian sense. But the rewriting operations we have considered might be interpreted as mutations and the filtering process might be viewed as a selection process. Recombination is missing but it was asserted that evolutionary and functional relationships between genes can be captured by taking only local mutations into consideration. It is clear that filters associated with each node allow a strong control of the computation. Indeed, every node has an input and output filter; two nodes can exchange data if it passes the output filter of the sender and the input filter of the receiver. Moreover, if some data is sent out by some node and not able to enter any node, then it is lost. In this paper we simplify the ANSP model considered in by moving the filters from the nodes to the edges. Each edge is viewed as a two-way channel such that the input and output filters coincide. Clearly, the possibility of controlling the computation in such networks seems to be diminished. For instance, there is no possibility to loose data during the communication steps. In spite of this and of the fact that splicing is not a powerful operation (remember that splicing systems generates only regular languages) we prove here that these devices are computationally complete. As a consequence, we propose characterizations of two complexity classes, namely NP and PSPACE, in terms of accepting networks of restricted splicing processors with filtered connections. We proposed a uniform linear time solution to SAT based on ANSPFCs with linearly bounded resources. This solution should be understood correctly: we do not solve SAT in linear time and space. Since any word and auxiliary word appears in an arbitrarily large number of copies, one can generate in linear time, by parallelism and communication, an exponential number of words each of them having an exponential number of copies. However, this does not seem to be a major drawback since by PCR (Polymerase Chain Reaction) one can generate an exponential number of identical DNA molecules in a linear number of reactions. It is worth mentioning that the ANSPFC constructed above remains unchanged for any instance with the same number of variables. Therefore, the solution is uniform in the sense that the network, excepting the input and output nodes, may be viewed as a program according to the number of variables, we choose the filters, the splicing words and the rules, then we assign all possible values to the variables, and compute the formula.We proved that ANSP are computationally complete. Do the ANSPFC remain still computationally complete? If this is not the case, what other problems can be eficiently solved by these ANSPFCs? Moreover, the complexity class NP is exactly the class of all languages decided by ANSP in polynomial time. Can NP be characterized in a similar way with ANSPFCs?

Mutually compensatory mutations during evolution of the tetramerization domain of tumor suppressor p53 lead to impaired hetero-oligomerization

We have measured the stability and stoichiometry of variants of the human p53 tetramerization domain to assess the effects of mutation on homo- and hetero-oligomerization. The residues chosen for mutation were those in the hydrophobic core that we had previously found to be critical for its stability but are not conserved in human p73 or p51 or in p53-related proteins from invertebrates or vertebrates. The mutations introduced were either single natural mutations or combinations of mutations present in p53-like proteins from different species. Most of the mutations were substantially destabilizing when introduced singly. The introduction of multiple mutations led to two opposite effects: some combinations of mutations that have occurred during the evolution of the hydrophobic core of the domain in p53-like proteins had additive destabilizing effects, whereas other naturally occurring combinations of mutations had little or no net effect on the stability, there being mutually compensating effects of up to 9.5 kcal/mol of tetramer. The triple mutant L332V/F341L/L344I, whose hydrophobic core represents that of the chicken p53 domain, was nearly as stable as the human domain but had impaired hetero-oligomerization with it. Thus, engineering of a functional p53 variant with a reduced capacity to hetero-oligomerize with wild-type human p53 can be achieved without any impairment in the stability and subunit affinity of the engineered homo-oligomer.

In vivo function of mutated spliced leader RNAs in Caenorhabditis elegans

The role of spliced leader RNA (SL RNA) in trans-splicing in Caenorhabditis elegans has been studied through a combination of in vitro mutagenesis and in vivo complementation of rrs-1 mutant nematodes, which lack endogenous SL1 RNA. Three classes of mutant SL1 RNAs have been found—those that rescue the lethal phenotype at low concentration of transforming DNA, those that rescue at high but not low concentration, and those that do not rescue at all. These studies showed that some mutations in the otherwise highly conserved 22-nt spliced leader are tolerated for splicing and post-splicing events. A longer spliced leader also can be tolerated but only when present in high copy number. Changes in the first 16 nucleotides result in the appearance of no SL RNA, consistent with the in vitro studies by others showing that the SL1 RNA promoter partly resides within the spliced leader sequence.

Deleterious mutations destabilize ribosomal RNA in endosymbiotic bacteria

In populations that are small and asexual, mutations with slight negative effects on fitness will drift to fixation more often than in large or sexual populations in which they will be eliminated by selection. If such mutations occur in substantial numbers, the combined effects of long-term asexuality and small population size may result in substantial accumulation of mildly deleterious substitutions. Prokaryotic endosymbionts of animals that are transmitted maternally for very long periods are effectively asexual and experience smaller effective population size than their free-living relatives. The contrast between such endosymbionts and related free-living bacteria allows us to test whether a population structure imposing frequent bottlenecks and asexuality does lead to an accumulation of slightly deleterious substitutions. Here we show that several independently derived insect endosymbionts, each with a long history of maternal transmission, have accumulated destabilizing base substitutions in the highly conserved 16S rRNA. Stabilities of Domain I of this subunit are 15–25% lower in endosymbionts than in closely related free-living bacteria. By mapping destabilizing substitutions onto a reconstructed phylogeny, we show that decreased ribosomal stability has evolved separately in each endosymbiont lineage. Our phylogenetic approach allows us to demonstrate statistical significance for this pattern: becoming endosymbiotic predictably results in decreased stability of rRNA secondary structure.

Activating mutations in the extracellular domain of the fibroblast growth factor receptor 2 function by disruption of the disulfide bond in the third immunoglobulin-like domain

Multiple human skeletal and craniosynostosis disorders, including Crouzon, Pfeiffer, Jackson–Weiss, and Apert syndromes, result from numerous point mutations in the extracellular region of fibroblast growth factor receptor 2 (FGFR2). Many of these mutations create a free cysteine residue that potentially leads to abnormal disulfide bond formation and receptor activation; however, for noncysteine mutations, the mechanism of receptor activation remains unclear. We examined the effect of two of these mutations, W290G and T341P, on receptor dimerization and activation. These mutations resulted in cellular transformation when expressed as FGFR2/Neu chimeric receptors. Additionally, in full-length FGFR2, the mutations induced receptor dimerization and elevated levels of tyrosine kinase activity. Interestingly, transformation by the chimeric receptors, dimerization, and enhanced kinase activity were all abolished if either the W290G or the T341P mutation was expressed in conjunction with mutations that eliminate the disulfide bond in the third immunoglobulin-like domain (Ig-3). These results demonstrate a requirement for the Ig-3 cysteine residues in the activation of FGFR2 by noncysteine mutations. Molecular modeling also reveals that noncysteine mutations may activate FGFR2 by altering the conformation of the Ig-3 domain near the disulfide bond, preventing the formation of an intramolecular bond. This allows the unbonded cysteine residues to participate in intermolecular disulfide bonding, resulting in constitutive activation of the receptor.

Recessive and dominant mutations in the ethylene biosynthetic gene ACS5 of Arabidopsis confer cytokinin insensitivity and ethylene overproduction, respectively

We identified a set of cytokinin-insensitive mutants by using a screen based on the ethylene-mediated triple response observed after treatment with low levels of cytokinins. One group of these mutants disrupts ACS5, a member of the Arabidopsis gene family that encodes 1-aminocyclopropane-1-carboxylate synthase, the first enzyme in ethylene biosynthesis. The ACS5 isoform is mainly responsible for the sustained rise in ethylene biosynthesis observed in response to low levels of cytokinin and appears to be regulated primarily by a posttranscriptional mechanism. Furthermore, the dominant ethylene-overproducing mutant eto2 was found to be the result of an alteration of the carboxy terminus of ACS5, suggesting that this domain acts as a negative regulator of ACS5 function.

A phenotype-based screen for embryonic lethal mutations in the mouse

The genetic pathways that control development of the early mammalian embryo have remained poorly understood, in part because the systematic mutant screens that have been so successful in the identification of genes and pathways that direct embryonic development in Drosophila, Caenorhabditis elegans, and zebrafish have not been applied to mammalian embryogenesis. Here we demonstrate that chemical mutagenesis with ethylnitrosourea can be combined with the resources of mouse genomics to identify new genes that are essential for mammalian embryogenesis. A pilot screen for abnormal morphological phenotypes of midgestation embryos identified five mutant lines; the phenotypes of four of the lines are caused by recessive traits that map to single regions of the genome. Three mutant lines display defects in neural tube closure: one is caused by an allele of the open brain (opb) locus, one defines a previously unknown locus, and one has a complex genetic basis. Two mutations produce novel early phenotypes and map to regions of the genome not previously implicated in embryonic patterning.

Natural trans-splicing in carnitine octanoyltransferase pre-mRNAs in rat liver

Carnitine octanoyltransferase (COT) transports medium-chain fatty acids through the peroxisome. During isolation of a COT clone from a rat liver library, a cDNA in which exon 2 was repeated, was characterized. Reverse transcription-PCR amplifications of total RNAs from rat liver showed a three-band pattern. Sequencing of the fragments revealed that, in addition to the canonical exon organization, previously reported [Choi, S. J. et al. (1995) Biochim. Biophys. Acta 1264, 215–222], there were two other forms in which exon 2 or exons 2 and 3 were repeated. The possibility of this exonic repetition in the COT gene was ruled out by genomic Southern blot. To study the gene expression, we analyzed RNA transcripts by Northern blot after RNase H digestion of total RNA. Three different transcripts were observed. Splicing experiments also were carried out in vitro with different constructs that contain exon 2 plus the 5′ or the 3′ adjacent intron sequences. Our results indicate that accurate joining of two exons 2 occurs by a trans-splicing mechanism, confirming the potential of these structures for this process in nature. The trans-splicing can be explained by the presence of three exon-enhancer sequences in exon 2. Analysis by Western blot of the COT proteins by using specific antibodies showed that two proteins corresponding to the expected Mr are present in rat peroxisomes. This is the first time that a natural trans-splicing reaction has been demonstrated in mammalian cells.