RNA editing in kinetoplastids

RNA editing in kinetoplastid protozoa is a post-transcriptional process of uridine insertion or deletion in mitochondrial mRNAs. The process involves two RNA species, the pre-edited mRNA and in most cases a trans-acting guide RNA (gRNA). Sequences within gRNAs define the position and extend of mRNA editing. Both mRNAs and gRNAs are encoded by mitochondrial genes in the kinetoplast DNA (kDNA), which consists of thousands of small circular DNA molecules, called minicircles, encoding thousands of gRNAs, catenated together and with a few mRNA encoding larger circles, the maxicircles, to form a huge DNA network. Editing has been shown to result in translatable mRNAs of bona fide mitochondrial genes as well as novel alternatively edited transcripts that are involved in the maintenance of the kDNA itself. RNA editing occurs within large protein-RNA complexes, editosomes, containing gRNA, preedited and partially edited mRNAs and also structural and catalytically active proteins. Editosomes are diverse in both RNA and protein composition and undergoe structural remodeling during the maturation. The compositional and structural diversity of editosomes further underscores the complexity of the RNA editing process.

Immune recognition of self nucleic acids driven by endogenous antimicrobial peptides: role in autoimmunity

Innate immune recognition of extracellular host-derived self-DNA and self-RNA is prevented by endosomal seclusion of the Toll-like receptors (TLRs) in the dendritic cells (DCs). However, in psoriasis plasmacytoid dendritic cells have been found to be able to sense self-DNA molecules in complex with the endogenous cationic antimicrobial peptide LL37, which are internalized into the endosomal compartments and thus can access TLR9. We investigated whether this endogenous peptide can also interact with extracellular self-RNA and lead to DC activation. We found that LL37 binds self-RNA as well as self-DNA going into an electrostatic interaction; forms micro-aggregates of nano-scale particles protected from enzymatic degradation and transport it into the endosomal compartments of both plasmacytoid and myeloid dendritic cells. In the plasmacytoid DCs, the self-RNA-LL37 complexes activate TLR7 and like the self-DNA-LL37 complexes, trigger the production of IFN-α in the absence of induction of maturation or production of IL-6 and TNF-α. In contrast to the self-DNA-LL37 complexes, the self-RNA-LL37 complexes are also internalized into the endosomal compartments of myeloid dendritic cells and trigger activation through TLR8, leading to the production of TNF-α and IL-6, and the maturation of the myeloid DCs. Furthermore, we found that these self nucleic acid-LL37 complexes can be found in vivo in the skin lesions of the cutaneous autoimmune disease psoriasis, where they are associated with mature mDCs in situ. On the other hand, in the systemic autoimmune disease systemic lupus erythematosus, self-DNA-LL37 complexes were found to be a constituent of the circulating immune complexes isolated from patient sera. This interaction between the endogenous peptide with the self nucleic acid molecules present in the immune complexes was found to be electrostatic and it confers resistance to enzymatic degradation of the nucleic acid molecules in the immune complexes. Moreover, autoantibodies to these endogenous peptides were found to trigger neutrophil activation and release of neutrophil extracellular traps composed of DNA, which are potential sources of the self nucleic acid-LL37 complexes present in SLE immune complexes. Our results demonstrate that the cationic antimicrobial peptide LL37 drives the innate immune recognition of self nucleic acid molecules through toll-like receptors in human dendritic cells, thus elucidating a pathway for innate sensing of host cell death. This pathway of autoreactivity was found to be pathologically relevant in human autoimmune diseases psoriasis and SLE, and thus this study provides new insights into the mechanisms autoimmune diseases.

Identification of the Causative Bacteria in Musculoskeletal Infections Using 16s rDNA - Denaturing Gradient Gel Electrophoresis Analysis

Musculoskeletal infections are infections of the bone and surrounding tissues. They are currently diagnosed based on culture analysis, which is the gold standard for pathogen identification. However, these clinical laboratory methods are frequently inadequate for the identification of the causative agents, because a large percentage (25-50%) of confirmed musculoskeletal infections are false negatives in which no pathogen is identified in culture. My data supports these results. The goal of this project was to use PCR amplification of a portion of the 16S rRNA gene to test an alternative approach for the identification of these pathogens and to assess the diversity of the bacteria involved. The advantages of this alternative method are that it should increase sample sensitivity and the speed of detection. In addition, bacteria that are non-culturable or in low abundance can be detected using this molecular technique. However, a complication of this approach is that the majority of musculoskeletal infections are polymicrobial, which prohibits direct identification from the infected tissue by DNA sequencing of the initial 16S rDNA amplification products. One way to solve this problem is to use denaturing gradient gel electrophoresis (DGGE) to separate the PCR products before DNA sequencing. Denaturing gradient gel electrophoresis (DGGE) separates DNA molecules based on their melting point, which is determined by their DNA sequence. This analytical technique allows a mixture of PCR products of the same length that electrophoreses through agarose gels as one band, to be separated into different bands and then used for DNA sequence analysis. In this way, the DGGE allows for the identification of individual bacterial species in polymicrobial-infected tissue, which is critical for improving clinical outcomes. By combining the 16S rDNA amplification and the DGGE techniques together, an alternative approach for identification has been used. The 16S rRNA gene PCR-DGGE method includes several critical steps: DNA extraction from tissue biopsies, amplification of the bacterial DNA, PCR product separation by DGGE, amplification of the gel-extracted DNA, and DNA sequencing and analysis. Each step of the method was optimized to increase its sensitivity and for rapid detection of the bacteria present in human tissue samples. The limit of detection for the DNA extraction from tissue was at least 20 Staphylococcus aureus cells and the limit of detection for PCR was at least 0.05 pg of template DNA. The conditions for DGGE electrophoreses were optimized by using a double gradient of acrylamide (6 – 10%) and denaturant (30-70%), which increased the separation between distinct PCR products. The use of GelRed (Biotium) improved the DNA visualization in the DGGE gel. To recover the DNA from the DGGE gels the gel slices were excised, shredded in a bead beater, and the DNA was allowed to diffuse into sterile water overnight. The use of primers containing specific linkers allowed the entire amplified PCR product to be sequenced and then analyzed. The optimized 16S rRNA gene PCR-DGGE method was used to analyze 50 tissue biopsy samples chosen randomly from our collection. The results were compared to those of the Memorial Hermann Hospital Clinical Microbiology Laboratory for the same samples. The molecular method was congruent for 10 of the 17 (59%) culture negative tissue samples. In 7 of the 17 (41%) culture negative the molecular method identified a bacterium. The molecular method was congruent with the culture identification for 7 of the 33 (21%) positive cultured tissue samples. However, in 8 of the 33 (24%) the molecular method identified more organisms. In 13 of the 15 (87%) polymicrobial cultured tissue samples the molecular method identified at least one organism that was also identified by culture techniques. Overall, the DGGE analysis of 16S rDNA is an effective method to identify bacteria not identified by culture analysis.

Insight into the strand exchange reaction promoted by the RecA protein of {\it Escherichia coli\/}

In vitro, RecA protein catalyses the exchange of single strands of DNA between different DNA molecules with sequence complementarity. In order to gain insight into this complex reaction and the roles of ATP binding and hydrolysis, two different approaches have been taken. The first is to use short single-stranded deoxyoligonucleotides as the ssDNA in strand exchange. These were used to determine the signal for hydrolysis and the structure of the RecA-DNA complex that hydrolyses ATP. I present a defined kinetic analysis of the nucleotide triphosphatase activity of RecA protein using short oligonucleotides as ssDNA cofactor. I compare the effects of both homopolymers and mixed base composition oligomers on the ATPase activity of RecA protein. I examine the steady state kinetic parameters of the ATPase reaction using these oligonucleotides as ssDNA cofactor, and show that although RecA can both bind to, and utilise, oligonucleotides 7 to 20 residues in length to support the repressor cleavage activity of RecA, these oligonucleotides are unable to efficiently stimulate the ATPase activity of RecA protein. I show that the K$\sb{\rm m}\sp{\rm ATP}$, the Hill coefficient for ATP binding, the extent of reaction, and k$\sb{\rm cat}$ are all a function of ssDNA chain length and that secondary structure may also play a role in determining the effects of a particular chain length on the ATPase activity of RecA protein.^ The second approach is to utilise one of the many mutants of RecA to gain insight into this complex reaction. The mutant selected was RecA1332. Surprisingly, in vitro, this mutant possesses a DNA-dependent ATPase activity. The K$\sb{\rm m}\sp{\rm ATP}$, Hill coefficient for ATP binding, and K$\sb{\rm m}\sp{\rm DNA}$ are similar to that of wild type. k$\sb{\rm cat}$ for the ATPase activity is reduced 3 to 12-fold, however. RecA1332 is unable to use deoxyoligonucleotides as DNA cofactors in the ATPase reaction, and demonstrates an increased sensitivity to inhibition by monovalent ions. It is able to perform strand exchange with ATP and ATP$\lbrack\gamma\rbrack$S but not with UTP, whereas the wild type protein is able to use all three nucleotide triphosphates. RecA1332 appears to be slowed in its ability to form intermediates and to convert these intermediates to products. (Abstract shortened by UMI.) ^

Characterization of Chelonus inanitus polydnavirus segments: sequences and analysis, excision site and demonstration of clustering

Polydnaviruses (genera Ichnovirus and Bracovirus) have a segmented genome of circular double-stranded DNA molecules, replicate in the ovary of parasitic wasps and are essential for successful parasitism of the host. Here we show the first detailed analysis of various segments of a bracovirus, the Chelonus inanitus virus (CiV). Four segments were sequenced and two of them, CiV12 and CiV14, were found to be closely related while CiV14.5 and CiV16.8 were unrelated. CiV12, CiV14.5 and CiV16.8 are unique while CiV14 occurs also nested in another larger segment. All four segments are predicted to contain genes and predictions could be substantiated in most cases. Comparison with databases revealed no significant similarities at either the nucleotide or amino acid level. Inverted repeats with identities between 77% and 92% and lengths between 26 bp and 100 bp were found on all segments outside of predicted genes. Hybridization experiments indicate that CiV12 and CiV14 are both flanked by other virus segments, suggesting that proviral CiV segments are clustered in the genome of the wasp. The integration/excision site of CiV14 was analysed and compared to that of CiV12. On both termini of proviral CiV12 and CiV14 as well as in the excised circular molecule and the rejoined DNA a very similar repeat of 14 bp was found. A model to illustrate where the terminal repeats might recombine to yield the circular molecule is presented. Excision of CiV12 and CiV14 is restricted to the female and sets in at a very specific time-point in pupal-adult development.

Polydnavirus of the parasitic wasp Chelonus inanitus (Braconidae): characterization, genome organization and time point of replication

Ultrastructural analysis of the polydnavirus of the braconid wasp Chelonus inanitus revealed that virions consist of one cylindrical nucleocapsid enveloped by a single unit membrane. Nucleocapsids have a constant diameter of 33.7 +/- 1.4 nm and a variable length of between 8 and 46 nm. Spreading of viral DNA showed that the genome consists of circular dsDNA molecules of variable sizes and measurement of the contour lengths indicated sizes of between 7 and 31 kbp. When virions were exposed to osmotic shock conditions to release the DNA, only one circular molecule was released per particle suggesting that the various DNA molecules are singly encapsidated in this bracovirus. The viral genome was seen to consist of at least 10 different segments and the aggregate genome size is in the order of 200 kbp. By partial digestion of viral DNA with HindIII or EcoRI in the presence of ethidium bromide and subsequent ligation with HindIII-cut pSP65 or EcoRI-cut pSP64 and transfection into Escherichia coli, libraries of 103 HindIII and 23 EcoRI clones were obtained. Southern blots revealed that complete and unrearranged segments were cloned with this approach, and restriction maps for five segments were obtained. Part of a 16.8 kbp segment was sequenced, found to be AT-rich (73%) and to contain six copies of a 17 bp repeated sequence. The development of the female reproductive tract in the course of pupal-adult development of the wasp was investigated and seen to be strictly correlated with the pigmentation pattern. By the use of a semiquantitative PCR, replication of viral DNA was observed to initiate at a specific stage of pupal-adult development.

Enhancing iDynoMiCS framework with a plasmid conjugation module

Actualmente existen aplicaciones que permiten simular el comportamiento de bacterias en distintos hábitats y los procesos que ocurren en estos para facilitar su estudio y experimentación sin la necesidad de un laboratorio. Una de las aplicaciones de software libre para la simulación de poblaciones bacteriológicas mas usada es iDynoMiCS (individual-based Dynamics of Microbial Communities Simulator), un simulador basado en agentes que permite trabajar con varios modelos computacionales de bacterias en 2D y 3D. Este simulador permite una gran libertad al configurar una numerosa cantidad de variables con respecto al entorno, reacciones químicas y otros detalles importantes. Una característica importante es el poder simular de manera sencilla la conjugación de plásmidos entre bacterias. Los plásmidos son moléculas de ADN diferentes del cromosoma celular, generalmente circularles, que se replican, transcriben y conjugan independientemente del ADN cromosómico. Estas están presentes normalmente en bacterias procariotas, y en algunas ocasiones en eucariotas, sin embargo, en este tipo de células son llamados episomas. Dado el complejo comportamiento de los plásmidos y la gama de posibilidades que estos presentan como mecanismos externos al funcionamiento básico de la célula, en la mayoría de los casos confiriéndole distintas ventajas evolutivas, como por ejemplo: resistencia antibiótica, entre otros, resulta importante su estudio y subsecuente manipulación. Sin embargo, el marco operativo del iDynoMiCS, en cuanto a simulación de plásmidos se refiere, es demasiado sencillo y no permite realizar operaciones más complejas que el análisis de la propagación de un plásmido en la comunidad. El presente trabajo surge para resolver esta deficiencia de iDynomics. Aquí se analizarán, desarrollarán e implementarán las modificaciones necesarias para que iDynomics pueda simular satisfactoriamente y mas apegado a la realidad la conjugación de plásmidos y permita así mismo resolver distintas operaciones lógicas, como lo son los circuitos genéticos, basadas en plásmidos. También se analizarán los resultados obtenidos de acuerdo a distintos estudios relevantes y a la comparación de los resultados obtenidos con el código original de iDynomics. Adicionalmente se analizará un estudio comparando la eficiencia de detección de una sustancia mediante dos circuitos genéticos distintos. Asimismo el presente trabajo puede tener interés para el grupo LIA de la Facultad de Informática de la Universidad Politécnica de Madrid, el cual está participando en el proyecto europeo BACTOCOM que se centra en el estudio de la conjugación de plásmidos y circuitos genéticos. --ABSTRACT--Currently there are applications that simulate the behavior of bacteria in different habitats and the ongoing processes inside them to facilitate their study and experimentation without the need for an actual laboratory. One of the most used open source applications to simulate bacterial populations is iDynoMiCS (individual-based Dynamics of Microbial Communities Simulator), an agent-based simulator that allows working with several computer models of 2D and 3D bacteria in biofilms. This simulator allows great freedom by means of a large number of configurable variables regarding environment, chemical reactions and other important details of the simulation. Within these characteristics there exists a very basic framework to simulate plasmid conjugation. Plasmids are DNA molecules physically different from the cell’s chromosome, commonly found as small circular, double-stranded DNA molecules that are replicated, conjugated and transcribed independently of chromosomal DNA. These bacteria are normally present in prokaryotes and sometimes in eukaryotes, which in this case these cells are called episomes. Plasmids are external mechanisms to the cells basic operations, and as such, in the majority of the cases, confer to the host cell various evolutionary advantages, like antibiotic resistance for example. It is mperative to further study plasmids and the possibilities they present. However, the operational framework of the iDynoMiCS plasmid simulation is too simple, and does not allow more complex operations that the analysis of the spread of a plasmid in the community. This project was conceived to resolve this particular deficiency in iDynomics, moreover, in this paper is discussed, developed and implemented the necessary changes to iDynomics simulation software so it can satisfactorily and realistically simulate plasmid conjugation, and allow the possibility to solve various ogic operations, such as plasmid-based genetic circuits. Moreover the results obtained will be analyzed and compared with other relevant studies and with those obtained with the original iDynomics code. Conjointly, an additional study detailing the sensing of a substance with two different genetic circuits will be presented. This work may also be relevant to the LIA group of the Faculty of Informatics of the Polytechnic University of Madrid, which is participating in the European project BACTOCOM that focuses on the study of the of plasmid conjugation and genetic circuits.

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?

Reconstitution of human replication factor C from its five subunits in baculovirus-infected insect cells

Human replication factor C (RFC, also called activator 1) is a five-subunit protein complex (p140, p40, p38, p37, and p36) required for proliferating cell nuclear antigen (PCNA)-dependent processive DNA synthesis catalyzed by DNA polymerase δ or ɛ. Here we report the reconstitution of the RFC complex from its five subunits simultaneously overexpressed in baculovirus-infected insect cells. The purified baculovirus-produced RFC appears to contain equimolar levels of each subunit and was shown to be functionally identical to its native counterpart in (i) supporting DNA polymerase δ-catalyzed PCNA-dependent DNA chain elongation; (ii) catalyzing DNA-dependent ATP hydrolysis that was stimulated by PCNA and human single-stranded DNA binding protein; (iii) binding preferentially to DNA primer ends; and (iv) catalytically loading PCNA onto singly nicked circular DNA and catalytically removing PCNA from these DNA molecules.

Sorting by diffusion: An asymmetric obstacle course for continuous molecular separation

A separation technique employing a microfabricated sieve has been demonstrated by observing the motion of DNA molecules of different size. The sieve consists of a two-dimensional lattice of obstacles whose asymmetric disposition rectifies the Brownian motion of molecules driven through the device, causing them to follow paths that depend on their diffusion coefficient. A nominal 6% resolution by length of DNA molecules in the size range 15–30 kbp may be achieved in a 4-inch (10-cm) silicon wafer. The advantage of this method is that samples can be loaded and sorted continuously, in contrast to the batch mode commonly used in gel electrophoresis.

Shape anisotropy of a single random-walk polymer

Random walks have been used to describe a wide variety of systems ranging from cell colonies to polymers. Sixty-five years ago, Kuhn [Kuhn, W. (1934) Kolloid-Z. 68, 2–11] made the prediction, backed later by computer simulations, that the overall shape of a random-walk polymer is aspherical, yet no experimental work has directly tested Kuhn's general idea and subsequent computer simulations. By using fluorescence microscopy, we monitored the conformation of individual, long, random-walk polymers (fluorescently labeled DNA molecules) at equilibrium. We found that a polymer most frequently adopts highly extended, nonfractal structures with a strongly anisotropic shape. The ensemble-average ratio of the lengths of the long and short axes of the best-fit ellipse of the polymer was much larger than unity.

Topological testing of the mechanism of homology search promoted by RecA protein

To initiate homologous recombination, sequence similarity between two DNA molecules must be searched for and homology recognized. How the search for and recognition of homology occurs remains unproven. We have examined the influences of DNA topology and the polarity of RecA–single-stranded (ss)DNA filaments on the formation of synaptic complexes promoted by RecA. Using two complementary methods and various ssDNA and duplex DNA molecules as substrates, we demonstrate that topological constraints on a small circular RecA–ssDNA filament prevent it from interwinding with its duplex DNA target at the homologous region. We were unable to detect homologous pairing between a circular RecA–ssDNA filament and its relaxed or supercoiled circular duplex DNA targets. However, the formation of synaptic complexes between an invading linear RecA–ssDNA filament and covalently closed circular duplex DNAs is promoted by supercoiling of the duplex DNA. The results imply that a triplex structure formed by non-Watson–Crick hydrogen bonding is unlikely to be an intermediate in homology searching promoted by RecA. Rather, a model in which RecA-mediated homology searching requires unwinding of the duplex DNA coupled with local strand exchange is the likely mechanism. Furthermore, we show that polarity of the invading RecA–ssDNA does not affect its ability to pair and interwind with its circular target duplex DNA.

Monitoring S phase progression globally and locally using BrdU incorporation in TK+ yeast strains

Eukaryotic chromosome replication is initiated from numerous origins and its activation is temporally controlled by cell cycle and checkpoint mechanisms. Yeast has been very useful in defining the genetic elements required for initiation of DNA replication, but simple and precise tools to monitor S phase progression are lacking in this model organism. Here we describe a TK+ yeast strain and conditions that allow incorporation of exogenous BrdU into genomic DNA, along with protocols to detect the sites of DNA synthesis in yeast nuclei or on combed DNA molecules. S phase progression is monitored by quantification of BrdU in total yeast DNA or on individual chromosomes. Using these tools we show that yeast chromosomes replicate synchronously and that DNA synthesis occurs at discrete subnuclear foci. Analysis of BrdU signals along single DNA molecules from hydroxyurea-arrested cells reveals that replication forks stall 8–9 kb from origins that are placed 46 kb apart on average. Quantification of total BrdU incorporation suggests that 190 ‘early’ origins have fired in these cells and that late replicating territories might represent up to 40% of the yeast genome. More generally, the methods outlined here will help understand the kinetics of DNA replication in wild-type yeast and refine the phenotypes of several mutants.

Mechanism for nucleic acid chaperone activity of HIV-1 nucleocapsid protein revealed by single molecule stretching

The nucleocapsid protein (NC) of HIV type 1 is a nucleic acid chaperone that facilitates the rearrangement of nucleic acids into conformations containing the maximum number of complementary base pairs. We use an optical tweezers instrument to stretch single DNA molecules from the helix to coil state at room temperature in the presence of NC and a mutant form (SSHS NC) that lacks the two zinc finger structures present in NC. Although both NC and SSHS NC facilitate annealing of complementary strands through electrostatic attraction, only NC destabilizes the helical form of DNA and reduces the cooperativity of the helix-coil transition. In particular, we find that the helix-coil transition free energy at room temperature is significantly reduced in the presence of NC. Thus, upon NC binding, it is likely that thermodynamic fluctuations cause continuous melting and reannealing of base pairs so that DNA strands are able to rapidly sample configurations to find the lowest energy state. The reduced cooperativity allows these fluctuations to occur in the middle of complex double-stranded structures. The reduced stability and cooperativity, coupled with the electrostatic attraction generated by the high charge density of NC, is responsible for the nucleic acid chaperone activity of this protein.

Interaction with the recombination hot spot chi in vivo converts the RecBCD enzyme of Escherichia coli into a chi-independent recombinase by inactivation of the RecD subunit.

The RecBCD enzyme of Escherichia coli promotes recombination preferentially at chi nucleotide sequences and has in vivo helicase and strong duplex DNA exonuclease (exoV) activities. The enzyme without the RecD subunit, as in a recD null mutant, promotes recombination efficiently but independently of chi and has no nucleolytic activity. Employing phage lambda red gam crosses, phage T4 2- survival measurements, and exoV assays, it is shown that E. coli cells in which RecBCD has extensive opportunity to interact with linear chi-containing DNA (produced by rolling circle replication of a plasmid with chi or by bleomycin-induced fragmentation of the cellular chromosome) acquire the phenotype of a recD mutant and maintain this for approximately 2 h. It is concluded that RecBCD is converted into RecBC during interaction with chi by irreversible inactivation of RecD. After conversion, the enzyme is released and initiates recombination on other DNA molecules in a chi-independent fashion. Overexpression of recD+ (from a plasmid) prevented the phenotypic change and providing RecD after the change restored chi-stimulated recombination. The observed recA+ dependence of the downregulation of exoV could explain the previously noted "reckless" DNA degradation of recA mutants. It is proposed that chi sites are regulatory elements for the RecBCD to RecBC switch and thereby function as cis- and trans-acting stimulators of RecBC-dependent recombination.