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.

Regulation of mRNA splicing in Moloney murine sarcoma virus mutants

Cells infected with the conditionally defective MuSVts110 mutant of Moloney murine sarcoma virus are transformed at 33$\sp\circ$C but appear morphologically normal at 39$\sp\circ$C. The molecular basis for this phenotype is as follows: MuSVts110 contains a 1487 nucleotide central deletion that has truncated the 3$\sp\prime$ end to the gag gene and the 5$\sp\prime$ end of the mos gene. The resulting gag-mos junction is out-of-frame and the v-mos protein is not expressed. At 33$\sp\circ$C or lower, a splicing event is activated such that a 431 base intron is removed to realign the gag and mos gene in-frame, allowing the expression of a transforming protein P85$\sp{gag-mos}$. Temperature-dependent splicing appeared to be an intrinsic property of MuSVts110 transcripts and not a general feature of pre-mRNA splicing in 6m2 cells since splicing activity of a heterologous transcript in the same cells did not vary with temperature. The possibility that the splice event was not temperature-sensitive, but that the accumulation of spliced transcript at the lower growth temperatures was due to its selective thermolability was ruled out as stability studies revealed that the relative turnover rates of the unspliced and spliced MuSVts110 transcripts were not affected by temperature.^ The consensus sequences containing the splice sites activated in the MuSVts110 mutant (5$\sp\prime$ gag and 3$\sp\prime$ mos) are present, but not utilized, in wild-type MuSV-124. To test the hypothesis that it was the reduction of the 1919 base intervening sequence in MuSV-124 to 431 bases in MuSVts110 which activated splicing, the identical 1487 base deletion was introduced into cloned wild-type MuSV-124 DNA to create the MuSVts110 equivalent, ts32.^ To examine conditions permissive for splicing, we assayed splice site activation in a series of MuSV-124 "intron-modification" mutants. Data suggest that splicing in wild-type MuSV-124 may be blocked due to the lack of a proximal branchpoint sequence, but can be activated by those intron mutations which reposition a branch site closer to the 3$\sp\prime$ splice site. (Abstract shortened with permission of author.) ^

The role of p53 in skin cancer induction by UV radiation and as a potential tumor antigen in UV-induced murine skin tumors

Carcinoma of the skin is the most common type of human cancer in the United States. Ultraviolet radiation (UVR) present in the sunlight is thought to be the major carcinogen responsible for induction of skin cancer. In UV-associated skin carcinogenesis, mutations in p53 are not only present with very high frequency, but occur early in the course of tumor development. In addition, UV-induced skin tumors in mice exhibit unique immunological characteristics. They are highly antigenic and express both individually-specific tumor transplantation antigens recognized by effector T cells and the UV-associated common antigen recognized by UV-induced suppressor T cells. ^ To examine the hypothesis that p53 plays a critical role in preventing skin cancer induction by UVR, mice constitutively lacking one or two functional p53 alleles were compared to wild-type mice for their susceptibility to UV carcinogenesis. Both p53 +/– and –/– mice showed greater susceptibility to skin cancer induction than wild-type mice, and –/– mice were the most susceptible, Accelerated tumor development in the p53 +/– mice was not associated with loss of the remaining wild-type allele of p53 , but in many cases was associated with UV-induced mutations in p53. Our studies clearly demonstrate the essential role of p53 in protection against UV carcinogenesis, particularly in the eye and epidermis. ^ The role of p53 in the antigenicity of UV-induced murine skin tumors was also addressed. Primary UV-induced tumors from p53 –/–, +/– and +/+ mice were transplanted into both normal and immunosuppressed mice, and rates of tumor rejection were compared. Tumors from mice with only one or no functional p53 alleles were less antigenic than those from mice with two functional p53 alleles. Moreover, tumors with no functional p53 also failed to grow well in chronically UV-irradiated mice. These results indicate that p53 contributes to the strong antigenicity of UV-induced murine skin tumors, and suggest that it may play a critical role in expression of the UV-associated common antigen recognized by suppressor T cells. ^ In this study we also monitored the effect of UVR on the development of lymphoid malignancies in p53 deficient mice. The incidence of lymphoid malignancies in UV-irradiated p53 +/– mice was drastically enhanced compared to that in unirradiated counterparts. The immune responses of the mice were identical and were suppressed to the same extent by UV irradiation regardless of the p53 genotype. These data provide the first experimental evidence that exposure to UVR can contribute to the development of lymphoid neoplasms in genetically susceptible hosts. ^

Automatic Generation of Identical Routing Pairs for FPGA Implemented DPL Logic

Side Channel Attacks (SCAs) typically gather unintentional (side channel) physical leakages from running crypto-devices to reveal confidential data. Dual-rail Precharge Logic (DPL) is one of the most efficient countermeasures against power or EM side channel threats. This logic relies on the implementation of complementary rails to counterbalance the data-dependent variations of the leakage from dynamic behavior of the original circuit. However, the lack of flexibility of commercial FPGA design tools makes it quite difficult to obtain completely balanced routings between complementary networks. In this paper, a controllable repair mechanism to guarantee identical net pairs from two lines is presented: i. repairs the identical yet conflict nets after the duplication (copy & paste) from original rail to complementary rail, and ii. repairs the non-identical nets in off-the-stock DPL circuits; These rerouting steps are carried out starting from a placed and routed netlist using Xilinx Description Language (XDL). Low level XDL modifications have been completely automated using a set of APIs named RapidSmith. Experimental EM attacks show that the resistance level of an AES core after the automatic routing repair is increased in a factor of at least 3.5. Timing analyses further demonstrate that net delay differences between complementary networks are minimized significantly.

Low cost time division multiplexing of identical optical fibre ring intensity sensors

A time division multiplexing (TDM) array for passive multiplexing of identical fibre, optic intensity sensors has been demonstrated. Microbending loss sensors are introduced in fibre optic rings and pressure information is directly detected, demultiplexed and demodulated from the relative amplitude of the first two pulses produced on each ring. Several dynamic ranges from 6 dB to 14 dB are shown. A comparison between both fibre optic ring and Mach-Zehnder structure impulse responses is carried out and the consequences derived from second- and higher-order recirculating ring pulses are also evaluated. This technique can be applied to those TDM intensity sensing schemes which require low cost, high number of identical sensors, and suffer high element loss and undersirable intensity fluctuations at low frequencies.

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.

Evolution of microbial diversity during prolonged starvation

Models of evolutionary processes postulate that new alleles appear in populations through random spontaneous mutation. Alleles that confer a competitive advantage in particular environments are selected and populations can be taken over by individuals expressing these advantageous mutations. We have studied the evolutionary process by using Escherichia coli cultures incubated for prolonged periods of time in stationary phase. The populations of surviving cells were shown to be highly dynamic, even after many months of incubation. Evolution proceeded along different paths even when the initial conditions were identical. As cultures aged, the takeovers by fitter mutants were incomplete, resulting in the coexistence of multiple mutant forms and increased microbial diversity. Thus, the study of bacterial populations in stationary phase provides a model system for understanding the evolution of diversity in natural populations.

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.

Fetal origins of the TEL-AML1 fusion gene in identical twins with leukemia

The TEL (ETV6)−AML1 (CBFA2) gene fusion is the most common reciprocal chromosomal rearrangement in childhood cancer occurring in ≈25% of the most predominant subtype of leukemia— common acute lymphoblastic leukemia. The TEL-AML1 genomic sequence has been characterized in a pair of monozygotic twins diagnosed at ages 3 years, 6 months and 4 years, 10 months with common acute lymphoblastic leukemia. The twin leukemic DNA shared the same unique (or clonotypic) but nonconstitutive TEL-AML1 fusion sequence. The most plausible explanation for this finding is a single cell origin of the TEL-AML fusion in one fetus in utero, probably as a leukemia-initiating mutation, followed by intraplacental metastasis of clonal progeny to the other twin. Clonal identity is further supported by the finding that the leukemic cells in the two twins shared an identical rearranged IGH allele. These data have implications for the etiology and natural history of childhood leukemia.

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.

Low frequency vibrational modes in proteins: Changes induced by point-mutations in the protein-cofactor matrix of bacterial reaction centers

As a step toward understanding their functional role, the low frequency vibrational motions (<300 cm−1) that are coupled to optical excitation of the primary donor bacteriochlorophyll cofactors in the reaction center from Rhodobacter sphaeroides were investigated. The pattern of hydrogen-bonding interaction between these bacteriochlorophylls and the surrounding protein was altered in several ways by mutation of single amino acids. The spectrum of low frequency vibrational modes identified by femtosecond coherence spectroscopy varied strongly between the different reaction center complexes, including between different mutants where the pattern of hydrogen bonds was the same. It is argued that these variations are primarily due to changes in the nature of the individual modes, rather than to changes in the charge distribution in the electronic states involved in the optical excitation. Pronounced effects of point mutations on the low frequency vibrational modes active in a protein-cofactor system have not been reported previously. The changes in frequency observed indicate a strong involvement of the protein in these nuclear motions and demonstrate that the protein matrix can increase or decrease the fluctuations of the cofactor along specific directions.