Effect of solute and matric potential on growth rate of fungal species isolated from cheese

The effect of water potential ( J w ) on the growth of 15 fungal species isolated from cheeses was analysed. The species, identi fi ed mainly by analysis of DNA sequences, belonged to genera Penicillium, Geotrichum, Mucor , Aspergillus , Microascus and Talaromyces . Particularly, the effect of matric potential ( J m ), and ionic (NaCl) and non-ionic (glycerol) solute potentials ( J s ) on growth rate was studied. The response of strains was highly dependent on the type of J w . For J s, clear profiles for optimal, permissive and marginal conditions for growth were obtained, and differences in growth rate were achieved comparing NaCl and glycerol for most of the species. Conversely, a sustained growth was obtained for J m in all the strains, with the exception of Aspergillus pseudoglaucus, whose growth increased proportionally to the level of water stress. Our results might help to understand the impact of environmental factors on the ecophysiology and dynamics of fungal populations associated to cheeses.

Translocation and Functional Analysis of Pseudomonas savastanoi pv. savastanoi NCPPB 3335 Type III Secretion System Effectors Reveals Two Novel Effector Families of the Pseudomonas syringae Complex

Pseudomonas savastanoi pv. savastanoi NCPPB 3335 causes olive knot disease and is a model pathogen for exploring bacterial infection of woody hosts. The type III secretion system (T3SS) effector repertoire of this strain includes 31 effector candidates plus two novel candidates identified in this study which have not been reported to translocate into plant cells. In this work, we demonstrate the delivery of seven NCPPB 3335 effectors into Nicotiana tabacum leaves, including three proteins from two novel families of the P. syringae complex effector super-repertoire (HopBK and HopBL), one of which comprises two proteins (HopBL1 and HopBL2) that harbor a SUMO protease domain. When delivered by P. fluorescens heterologously expressing a P. syringae T3SS, all seven effectors were found to suppress the production of defense-associated reactive oxygen species. Moreover, six of these effectors, including the truncated versions of HopAA1 and HopAZ1 encoded by NCPPB 3335, suppressed callose deposition. The expression of HopAZ1 and HopBL1 by functionally effectorless P. syringae pv. tomato DC3000D28E inhibited the hypersensitive response in tobacco and, additionally, expression of HopBL2 by this strain significantly increased its competitiveness in N. benthamiana. DNA sequences encoding HopBL1 and HopBL2 were uniquely detected in a collection of 31 P. savastanoi pv. savastanoi strains and other P. syringae strains isolated from woody hosts, suggesting a relevant role of these two effectors in bacterial interactions with olive and other woody plants.

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?

Nepfix: on-demand cloud elastic simulation of networks of evolutionary processors

Una Red de Procesadores Evolutivos o NEP (por sus siglas en ingles), es un modelo computacional inspirado por el modelo evolutivo de las celulas, específicamente por las reglas de multiplicación de las mismas. Esta inspiración hace que el modelo sea una abstracción sintactica de la manipulation de information de las celulas. En particu¬lar, una NEP define una maquina de cómputo teorica capaz de resolver problemas NP completos de manera eficiente en tóerminos de tiempo. En la praóctica, se espera que las NEP simuladas en móaquinas computacionales convencionales puedan resolver prob¬lemas reales complejos (que requieran ser altamente escalables) a cambio de una alta complejidad espacial. En el modelo NEP, las cóelulas estóan representadas por palabras que codifican sus secuencias de ADN. Informalmente, en cualquier momento de cómputo del sistema, su estado evolutivo se describe como un coleccion de palabras, donde cada una de ellas representa una celula. Estos momentos fijos de evolucion se denominan configuraciones. De manera similar al modelo biologico, las palabras (celulas) mutan y se dividen en base a bio-operaciones sencillas, pero solo aquellas palabras aptas (como ocurre de forma parecida en proceso de selection natural) seran conservadas para la siguiente configuracióon. Una NEP como herramienta de computation, define una arquitectura paralela y distribuida de procesamiento simbolico, en otras palabras, una red de procesadores de lenguajes. Desde el momento en que el modelo fue propuesto a la comunidad científica en el año 2001, múltiples variantes se han desarrollado y sus propiedades respecto a la completitud computacional, eficiencia y universalidad han sido ampliamente estudiadas y demostradas. En la actualidad, por tanto, podemos considerar que el modelo teórico NEP se encuentra en el estadio de la madurez. La motivación principal de este Proyecto de Fin de Grado, es proponer una aproxi-mación práctica que permita dar un salto del modelo teórico NEP a una implantación real que permita su ejecucion en plataformas computacionales de alto rendimiento, con el fin de solucionar problemas complejos que demanda la sociedad actual. Hasta el momento, las herramientas desarrolladas para la simulation del modelo NEP, si bien correctas y con resultados satisfactorios, normalmente estón atadas a su entorno de ejecucion, ya sea el uso de hardware específico o implementaciones particulares de un problema. En este contexto, el propósito fundamental de este trabajo es el desarrollo de Nepfix, una herramienta generica y extensible para la ejecucion de cualquier algo¬ritmo de un modelo NEP (o alguna de sus variantes), ya sea de forma local, como una aplicación tradicional, o distribuida utilizando los servicios de la nube. Nepfix es una aplicacion software desarrollada durante 7 meses y que actualmente se encuentra en su segunda iteration, una vez abandonada la fase de prototipo. Nepfix ha sido disenada como una aplicacion modular escrita en Java 8 y autocontenida, es decir, no requiere de un entorno de ejecucion específico (cualquier maquina virtual de Java es un contenedor vólido). Nepfix contiene dos componentes o móodulos. El primer móodulo corresponde a la ejecución de una NEP y es por lo tanto, el simulador. Para su desarrollo, se ha tenido en cuenta el estado actual del modelo, es decir, las definiciones de los procesadores y filtros mas comunes que conforman la familia del modelo NEP. Adicionalmente, este componente ofrece flexibilidad en la ejecucion, pudiendo ampliar las capacidades del simulador sin modificar Nepfix, usando para ello un lenguaje de scripting. Dentro del desarrollo de este componente, tambióen se ha definido un estóandar de representacióon del modelo NEP basado en el formato JSON y se propone una forma de representation y codificación de las palabras, necesaria para la comunicación entre servidores. Adicional-mente, una característica importante de este componente, es que se puede considerar una aplicacion aislada y por tanto, la estrategia de distribution y ejecución son total-mente independientes. El segundo moódulo, corresponde a la distribucióon de Nepfix en la nube. Este de-sarrollo es el resultado de un proceso de i+D, que tiene una componente científica considerable. Vale la pena resaltar el desarrollo de este modulo no solo por los resul-tados prócticos esperados, sino por el proceso de investigation que se se debe abordar con esta nueva perspectiva para la ejecución de sistemas de computación natural. La principal característica de las aplicaciones que se ejecutan en la nube es que son gestionadas por la plataforma y normalmente se encapsulan en un contenedor. En el caso de Nepfix, este contenedor es una aplicacion Spring que utiliza el protocolo HTTP o AMQP para comunicarse con el resto de instancias. Como valor añadido, Nepfix aborda dos perspectivas de implementation distintas (que han sido desarrolladas en dos iteraciones diferentes) del modelo de distribution y ejecucion, que tienen un impacto muy significativo en las capacidades y restricciones del simulador. En concreto, la primera iteration utiliza un modelo de ejecucion asincrono. En esta perspectiva asincrona, los componentes de la red NEP (procesadores y filtros) son considerados como elementos reactivos a la necesidad de procesar una palabra. Esta implementation es una optimization de una topologia comun en el modelo NEP que permite utilizar herramientas de la nube para lograr un escalado transparente (en lo ref¬erente al balance de carga entre procesadores) pero produce efectos no deseados como indeterminacion en el orden de los resultados o imposibilidad de distribuir eficiente-mente redes fuertemente interconectadas. Por otro lado, la segunda iteration corresponde al modelo de ejecucion sincrono. Los elementos de una red NEP siguen un ciclo inicio-computo-sincronizacion hasta que el problema se ha resuelto. Esta perspectiva sincrona representa fielmente al modelo teórico NEP pero el proceso de sincronizacion es costoso y requiere de infraestructura adicional. En concreto, se requiere un servidor de colas de mensajes RabbitMQ. Sin embargo, en esta perspectiva los beneficios para problemas suficientemente grandes superan a los inconvenientes, ya que la distribuciín es inmediata (no hay restricciones), aunque el proceso de escalado no es trivial. En definitiva, el concepto de Nepfix como marco computacional se puede considerar satisfactorio: la tecnología es viable y los primeros resultados confirman que las carac-terísticas que se buscaban originalmente se han conseguido. Muchos frentes quedan abiertos para futuras investigaciones. En este documento se proponen algunas aproxi-maciones a la solucion de los problemas identificados como la recuperacion de errores y la division dinamica de una NEP en diferentes subdominios. Por otra parte, otros prob-lemas, lejos del alcance de este proyecto, quedan abiertos a un futuro desarrollo como por ejemplo, la estandarización de la representación de las palabras y optimizaciones en la ejecucion del modelo síncrono. Finalmente, algunos resultados preliminares de este Proyecto de Fin de Grado han sido presentados recientemente en formato de artículo científico en la "International Work-Conference on Artificial Neural Networks (IWANN)-2015" y publicados en "Ad-vances in Computational Intelligence" volumen 9094 de "Lecture Notes in Computer Science" de Springer International Publishing. Lo anterior, es una confirmation de que este trabajo mas que un Proyecto de Fin de Grado, es solo el inicio de un trabajo que puede tener mayor repercusion en la comunidad científica. Abstract Network of Evolutionary Processors -NEP is a computational model inspired by the evolution of cell populations, which might model some properties of evolving cell communities at the syntactical level. NEP defines theoretical computing devices able to solve NP complete problems in an efficient manner. In this model, cells are represented by words which encode their DNA sequences. Informally, at any moment of time, the evolutionary system is described by a collection of words, where each word represents one cell. Cells belong to species and their community evolves according to mutations and division which are defined by operations on words. Only those cells are accepted as surviving (correct) ones which are represented by a word in a given set of words, called the genotype space of the species. This feature is analogous with the natural process of evolution. Formally, NEP is based on an architecture for parallel and distributed processing, in other words, a network of language processors. Since the date when NEP was pro¬posed, several extensions and variants have appeared engendering a new set of models named Networks of Bio-inspired Processors (NBP). During this time, several works have proved the computational power of NBP. Specifically, their efficiency, universality, and computational completeness have been thoroughly investigated. Therefore, we can say that the NEP model has reached its maturity. The main motivation for this End of Grade project (EOG project in short) is to propose a practical approximation that allows to close the gap between theoretical NEP model and a practical implementation in high performing computational platforms in order to solve some of high the high complexity problems society requires today. Up until now tools developed to simulate NEPs, while correct and successful, are usu¬ally tightly coupled to the execution environment, using specific software frameworks (Hadoop) or direct hardware usage (GPUs). Within this context the main purpose of this work is the development of Nepfix, a generic and extensible tool that aims to execute algorithms based on NEP model and compatible variants in a local way, similar to a traditional application or in a distributed cloud environment. Nepfix as an application was developed during a 7 month cycle and is undergoing its second iteration once the prototype period was abandoned. Nepfix is designed as a modular self-contained application written in Java 8, that is, no additional external dependencies are required and it does not rely on an specific execution environment, any JVM is a valid container. Nepfix is made of two components or modules. The first module corresponds to the NEP execution and therefore simulation. During the development the current state of the theoretical model was used as a reference including most common filters and processors. Additionally extensibility is provided by the use of Python as a scripting language to run custom logic. Along with the simulation a definition language for NEP has been defined based on JSON as well as a mechanisms to represent words and their possible manipulations. NEP simulator is isolated from distribution and as mentioned before different applications that include it as a dependency are possible, the distribution of NEPs is an example of this. The second module corresponds to executing Nepfix in the cloud. The development carried a heavy R&D process since this front was not explored by other research groups until now. It's important to point out that the development of this module is not focused on results at this point in time, instead we focus on feasibility and discovery of this new perspective to execute natural computing systems and NEPs specifically. The main properties of cloud applications is that they are managed by the platform and are encapsulated in a container. For Nepfix a Spring application becomes the container and the HTTP or AMQP protocols are used for communication with the rest of the instances. Different execution perspectives were studied, namely asynchronous and synchronous models were developed for solving different kind of problems using NEPs. Different limitations and restrictions manifest in both models and are explored in detail in the respective chapters. In conclusion we can consider that Nepfix as a computational framework is suc-cessful: Cloud technology is ready for the challenge and the first results reassure that the properties Nepfix project pursued were met. Many investigation branches are left open for future investigations. In this EOG implementation guidelines are proposed for some of them like error recovery or dynamic NEP splitting. On the other hand other interesting problems that were not in the scope of this project were identified during development like word representation standardization or NEP model optimizations. As a confirmation that the results of this work can be useful to the scientific com-munity a preliminary version of this project was published in The International Work- Conference on Artificial Neural Networks (IWANN) in May 2015. Development has not stopped since that point and while Nepfix in it's current state can not be consid¬ered a final product the most relevant ideas, possible problems and solutions that were produced during the seven months development cycle are worthy to be gathered and presented giving a meaning to this EOG work.

Malaria’s Eve: Evidence of a recent population bottleneck throughout the world populations of Plasmodium falciparum

We have analyzed DNA sequences from world-wide geographic strains of Plasmodium falciparum and found a complete absence of synonymous DNA polymorphism at 10 gene loci. We hypothesize that all extant world populations of the parasite have recently derived (within several thousand years) from a single ancestral strain. The upper limit of the 95% confidence interval for the time when this most recent common ancestor lived is between 24,500 and 57,500 years ago (depending on different estimates of the nucleotide substitution rate); the actual time is likely to be much more recent. The recent origin of the P. falciparum populations could have resulted from either a demographic sweep (P. falciparum has only recently spread throughout the world from a small geographically confined population) or a selective sweep (one strain favored by natural selection has recently replaced all others). The selective sweep hypothesis requires that populations of P. falciparum be effectively clonal, despite the obligate sexual stage of the parasite life cycle. A demographic sweep that started several thousand years ago is consistent with worldwide climatic changes ensuing the last glaciation, increased anthropophilia of the mosquito vectors, and the spread of agriculture. P. falciparum may have rapidly spread from its African tropical origins to the tropical and subtropical regions of the world only within the last 6,000 years. The recent origin of the world-wide P. falciparum populations may account for its virulence, as the most malignant of human malarial parasites.

CTXφ immunity: Application in the development of cholera vaccines

CTXφ is a filamentous bacteriophage that encodes cholera toxin, the principal virulence factor of Vibrio cholerae. CTXφ is unusual among filamentous phages because it encodes a repressor and forms lysogens. CTXφ can infect the existing live-attenuated V. cholerae vaccine strains derived from either the El Tor or classical V. cholerae biotypes and result in vaccine reversion to toxinogenicity. Intraintestinal CTXφ transduction assays were used to demonstrate that El Tor biotype strains of V. cholerae are immune to infection with the El Tor-derived CTXφ, whereas classical strains are not. The El Tor CTXφ repressor, RstR, was sufficient to render classical strains immune to infection with the El Tor CTXφ. The DNA sequences of the classical and El Tor CTXφ repressors and their presumed cognate operators are highly diverged, whereas the sequences that surround this “immunity” region are nearly identical. Transcriptional fusion studies revealed that the El Tor RstR mediated repression of an El Tor rstA-lacZ fusion but did not repress a classical rstA-lacZ fusion. Likewise, the classical RstR only repressed a classical rstA-lacZ fusion. Thus, similar to the mechanistic basis for heteroimmunity among lambdoid phages, the specificity of CTXφ immunity is based on the divergence of the sequences of repressors and their operators. Expression of the El Tor rstR in either El Tor or classical live-attenuated V. cholerae vaccine strains effectively protected these vaccines from CTXφ infection. Introduction of rstR into V. cholerae vaccine strains should enhance their biosafety.

In situ detection of the hypermethylation-induced inactivation of the p16 gene as an early event in oncogenesis

We have developed a technique, methylation-specific PCR in situ hybridization (MSP-ISH), which allows for the methylation status of specific DNA sequences to be visualized in individual cells. We use MSP-ISH to monitor the timing and consequences of aberrant hypermethylation of the p16 tumor suppresser gene during the progression of cancers of the lung and cervix. Hypermethylation of p16 was localized only to the neoplastic cells in both in situ lesions and invasive cancers, and was associated with loss of p16 protein expression. MSP-ISH allowed us to dissect the surprising finding that p16 hypermethylation occurs in cervical carcinoma. This tumor is associated with infection of the oncogenic human papillomavirus, which expresses a protein, E7, that inactivates the retinoblastoma (Rb) protein. Thus, simultaneous Rb and p16 inactivation would not be needed to abrogate the critical cyclin D–Rb pathway. MSP-ISH reveals that p16 hypermethylation occurs heterogeneously within early cervical tumor cell populations that are separate from those expressing viral E7 transcripts. In advanced cervical cancers, the majority of cells have a hypermethylated p16, lack p16 protein, but no longer express E7. These data suggest that p16 inactivation is selected as the most effective mechanism of blocking the cyclin D–Rb pathway during the evolution of an invasive cancer from precursor lesions. These studies demonstrate that MSP-ISH is a powerful approach for studying the dynamics of aberrant methylation of critical tumor suppressor genes during tumor evolution.

ETS target genes: Identification of Egr1 as a target by RNA differential display and whole genome PCR techniques

ETS transcription factors play important roles in hematopoiesis, angiogenesis, and organogenesis during murine development. The ETS genes also have a role in neoplasia, for example in Ewing’s sarcomas and retrovirally induced cancers. The ETS genes encode transcription factors that bind to specific DNA sequences and activate transcription of various cellular and viral genes. To isolate novel ETS target genes, we used two approaches. In the first approach, we isolated genes by the RNA differential display technique. Previously, we have shown that the overexpression of ETS1 and ETS2 genes effects transformation of NIH 3T3 cells and specific transformants produce high levels of the ETS proteins. To isolate ETS1 and ETS2 responsive genes in these transformed cells, we prepared RNA from ETS1, ETS2 transformants, and normal NIH 3T3 cell lines and converted it into cDNA. This cDNA was amplified by PCR and displayed on sequencing gels. The differentially displayed bands were subcloned into plasmid vectors. By Northern blot analysis, several clones showed differential patterns of mRNA expression in the NIH 3T3-, ETS1-, and ETS2-expressing cell lines. Sixteen clones were analyzed by DNA sequence analysis, and 13 of them appeared to be unique because their DNA sequences did not match with any of the known genes present in the gene bank. Three known genes were found to be identical to the CArG box binding factor, phospholipase A2-activating protein, and early growth response 1 (Egr1) genes. In the second approach, to isolate ETS target promoters directly, we performed ETS1 binding with MboI-cleaved genomic DNA in the presence of a specific mAb followed by whole genome PCR. The immune complex-bound ETS binding sites containing DNA fragments were amplified and subcloned into pBluescript and subjected to DNA sequence and computer analysis. We found that, of a large number of clones isolated, 43 represented unique sequences not previously identified. Three clones turned out to contain regulatory sequences derived from human serglycin, preproapolipoprotein C II, and Egr1 genes. The ETS binding sites derived from these three regulatory sequences showed specific binding with recombinant ETS proteins. Of interest, Egr1 was identified by both of these techniques, suggesting strongly that it is indeed an ETS target gene.

Silent chromatin determines target preference of the Saccharomyces retrotransposon Ty5

The HML and HMR mating loci of Saccharomyces cerevisiae are bound in silent chromatin, which is assembled at the flanking E and I transcriptional silencers. The retrotransposon Ty5 preferentially integrates into regions of silent chromatin, and Ty5 insertions near the HMR-E silencer account for ≈2% of total transposition events. Most Ty5 insertions occur within 800 bp on either side of the autonomously replicating consensus sequence within HMR-E. Ty5 target preference is determined by silent chromatin, because integration near HMR-E is abolished in strains with silencer mutations that alleviate transcriptional repression. The recognition of specific DNA sequences per se does not direct integration, rather, it is the protein complex assembled at the silencers. As demonstrated here for Ty5, recognition of specific chromatin domains may be a general mechanism by which retrotransposons and retroviruses determine integration sites.

Nonequilibrium mechanism of transcription termination from observations of single RNA polymerase molecules

Cessation of transcription at specific terminator DNA sequences is used by viruses, bacteria, and eukaryotes to regulate the expression of downstream genes, but the mechanisms of transcription termination are poorly characterized. To elucidate the kinetic mechanism of termination at the intrinsic terminators of enteric bacteria, we observed, by using single-molecule light microscopy techniques, the behavior of surface-immobilized Escherichia coli RNA polymerase (RNAP) molecules in vitro. An RNAP molecule remains at a canonical intrinsic terminator for ≈64 s before releasing DNA, implying the formation of an elongation-incompetent (paused) intermediate by transcription complexes that terminate but not by those that read through the terminator. Analysis of pause lifetimes establishes a complete minimal mechanism of termination in which paused intermediate formation is both necessary and sufficient to induce release of RNAP at the terminator. The data suggest that intrinsic terminators function by a nonequilibrium process in which terminator effectiveness is determined by the relative rates of nucleotide addition and paused state entry by the transcription complex.

Origin and evolutionary relationships of giant Galápagos tortoises

Perhaps the most enduring debate in reptile systematics has involved the giant Galápagos tortoises (Geochelone nigra), whose origins and systematic relationships captivated Charles Darwin and remain unresolved to this day. Here we report a phylogenetic reconstruction based on mitochondrial DNA sequences from Galápagos tortoises and Geochelone from mainland South America and Africa. The closest living relative to the Galápagos tortoise is not among the larger-bodied tortoises of South America but is the relatively small-bodied Geochelone chilensis, or Chaco tortoise. The split between G. chilensis and the Galápagos lineage probably occurred 6 to 12 million years ago, before the origin of the oldest extant Galápagos island. Our data suggest that the four named southern subspecies on the largest island, Isabela, are not distinct genetic units, whereas a genetically distinct northernmost Isabela subspecies is probably the result of a separate colonization. Most unexpectedly, the lone survivor of the abingdoni subspecies from Pinta Island (“Lonesome George”) is very closely related to tortoises from San Cristóbal and Española, the islands farthest from the island of Pinta. To rule out a possible recent transplant of Lonesome George, we sequenced DNA from three tortoises collected on Pinta in 1906. They have sequences identical to Lonesome George, consistent with his being the last survivor of his subspecies. This finding may provide guidance in finding a mate for Lonesome George, who so far has failed to reproduce.

Recurrent invasion and extinction of a selfish gene

Homing endonuclease genes show super-Mendelian inheritance, which allows them to spread in populations even when they are of no benefit to the host organism. To test the idea that regular horizontal transmission is necessary for the long-term persistence of these genes, we surveyed 20 species of yeasts for the ω-homing endonuclease gene and associated group I intron. The status of ω could be categorized into three states (functional, nonfunctional, or absent), and status was not clustered on the host phylogeny. Moreover, the phylogeny of ω differed significantly from that of the host, strong evidence of horizontal transmission. Further analyses indicate that horizontal transmission is more common than transposition, and that it occurs preferentially between closely related species. Parsimony analysis and coalescent theory suggest that there have been 15 horizontal transmission events in the ancestry of our yeast species, through simulations indicate that this value is probably an underestimate. Overall, the data support a cyclical model of invasion, degeneration, and loss, followed by reinvasion, and each of these transitions is estimated to occur about once every 2 million years. The data are thus consistent with the idea that frequent horizontal transmission is necessary for the long-term persistence of homing endonuclease genes, and further, that this requirement limits these genes to organisms with easily accessible germ lines. The data also show that mitochondrial DNA sequences are transferred intact between yeast species; if other genes do not show such high levels of horizontal transmission, it would be due to lack of selection, rather than lack of opportunity.

Localization of a putative transcriptional regulator (ATRX) at pericentromeric heterochromatin and the short arms of acrocentric chromosomes

ATRX is a member of the SNF2 family of helicase/ATPases that is thought to regulate gene expression via an effect on chromatin structure and/or function. Mutations in the hATRX gene cause severe syndromal mental retardation associated with α-thalassemia. Using indirect immunofluorescence and confocal microscopy we have shown that ATRX protein is associated with pericentromeric heterochromatin during interphase and mitosis. By coimmunofluorescence, ATRX localizes with a mouse homologue of the Drosophila heterochromatic protein HP1 in vivo, consistent with a previous two-hybrid screen identifying this interaction. From the analysis of a trap assay for nuclear proteins, we have shown that the localization of ATRX to heterochromatin is encoded by its N-terminal region, which contains a conserved plant homeodomain-like finger and a coiled-coil domain. In addition to its association with heterochromatin, at metaphase ATRX clearly binds to the short arms of human acrocentric chromosomes, where the arrays of ribosomal DNA are located. The unexpected association of a putative transcriptional regulator with highly repetitive DNA provides a potential explanation for the variability in phenotype of patients with identical mutations in the ATRX gene.

Plasmodium falciparum antigenic diversity: Evidence of clonal population structure

Plasmodium falciparum, the agent of malignant malaria, is one of mankind’s most severe scourges. Efforts to develop preventive vaccines or remedial drugs are handicapped by the parasite’s rapid evolution of drug resistance and protective antigens. We examine 25 DNA sequences of the gene coding for the highly polymorphic antigenic circumsporozoite protein. We observe total absence of silent nucleotide variation in the two nonrepeated regions of the gene. We propose that this absence reflects a recent origin (within several thousand years) of the world populations of P. falciparum from a single individual; the amino acid polymorphisms observed in these nonrepeat regions would result from strong natural selection. Analysis of these polymorphisms indicates that: (i) the incidence of recombination events does not increase with nucleotide distance; (ii) the strength of linkage disequilibrium between nucleotides is also independent of distance; and (iii) haplotypes in the two nonrepeat regions are correlated with one another, but not with the central repeat region they span. We propose two hypotheses: (i) variation in the highly polymorphic central repeat region arises by mitotic intragenic recombination, and (ii) the population structure of P. falciparum is clonal—a state of affairs that persists in spite of the necessary stage of physiological sexuality that the parasite must sustain in the mosquito vector to complete its life cycle.

Toward controlling gene expression at will: Specific regulation of the erbB-2/HER-2 promoter by using polydactyl zinc finger proteins constructed from modular building blocks

To create a universal system for the control of gene expression, we have studied methods for the construction of novel polydactyl zinc finger proteins that recognize extended DNA sequences. Elsewhere we have described the generation of zinc finger domains recognizing sequences of the 5′-GNN-3′ subset of a 64-member zinc finger alphabet. Here we report on the use of these domains as modular building blocks for the construction of polydactyl proteins specifically recognizing 9- or 18-bp sequences. A rapid PCR assembly method was developed that, together with this predefined set of zinc finger domains, provides ready access to 17 million novel proteins that bind the 5′-(GNN)6-3′ family of 18-bp DNA sites. To examine the efficacy of this strategy in gene control, the human erbB-2 gene was chosen as a model. A polydactyl protein specifically recognizing an 18-bp sequence in the 5′-untranslated region of this gene was converted into a transcriptional repressor by fusion with Krüppel-associated box (KRAB), ERD, or SID repressor domains. Transcriptional activators were generated by fusion with the herpes simplex VP16 activation domain or with a tetrameric repeat of VP16’s minimal activation domain, termed VP64. We demonstrate that both gene repression and activation can be achieved by targeting designed proteins to a single site within the transcribed region of a gene. We anticipate that gene-specific transcriptional regulators of the type described here will find diverse applications in gene therapy, functional genomics, and the generation of transgenic organisms.