Quantum optical signals in telecommunication networks

Introducción a una red óptica metropolitana cuántica donde señales cuánticas y convencionales son multiplexadas en longitud de onda utilizando bandas separadas del espectro óptico. El enrutado se realiza con componentes pasivos para no perturbar los qubits. Se estudian dos redes: red de acceso WDM-PON y red metropolitana completa con backbone DWDM y redes de acceso WDM-PON.

Information content: assessing meso-scale structures in complex networks

We propose a novel measure to assess the presence of meso-scale structures in complex networks. This measure is based on the identi?cation of regular patterns in the adjacency matrix of the network, and on the calculation of the quantity of information lost when pairs of nodes are iteratively merged. We show how this measure is able to quantify several meso-scale structures, like the presence of modularity, bipartite and core-periphery con?gurations, or motifs. Results corresponding to a large set of real networks are used to validate its ability to detect non-trivial topological patterns.

Strong Connectivity in Directed Hypergraphs and its Application to the Atomic Decomposition of Ontologies

Los hipergrafos dirigidos se han empleado en problemas relacionados con lógica proposicional, bases de datos relacionales, linguística computacional y aprendizaje automático. Los hipergrafos dirigidos han sido también utilizados como alternativa a los grafos (bipartitos) dirigidos para facilitar el estudio de las interacciones entre componentes de sistemas complejos que no pueden ser fácilmente modelados usando exclusivamente relaciones binarias. En este contexto, este tipo de representación es conocida como hiper-redes. Un hipergrafo dirigido es una generalización de un grafo dirigido especialmente adecuado para la representación de relaciones de muchos a muchos. Mientras que una arista en un grafo dirigido define una relación entre dos de sus nodos, una hiperarista en un hipergrafo dirigido define una relación entre dos conjuntos de sus nodos. La conexión fuerte es una relación de equivalencia que divide el conjunto de nodos de un hipergrafo dirigido en particiones y cada partición define una clase de equivalencia conocida como componente fuertemente conexo. El estudio de los componentes fuertemente conexos de un hipergrafo dirigido puede ayudar a conseguir una mejor comprensión de la estructura de este tipo de hipergrafos cuando su tamaño es considerable. En el caso de grafo dirigidos, existen algoritmos muy eficientes para el cálculo de los componentes fuertemente conexos en grafos de gran tamaño. Gracias a estos algoritmos, se ha podido averiguar que la estructura de la WWW tiene forma de “pajarita”, donde más del 70% del los nodos están distribuidos en tres grandes conjuntos y uno de ellos es un componente fuertemente conexo. Este tipo de estructura ha sido también observada en redes complejas en otras áreas como la biología. Estudios de naturaleza similar no han podido ser realizados en hipergrafos dirigidos porque no existe algoritmos capaces de calcular los componentes fuertemente conexos de este tipo de hipergrafos. En esta tesis doctoral, hemos investigado como calcular los componentes fuertemente conexos de un hipergrafo dirigido. En concreto, hemos desarrollado dos algoritmos para este problema y hemos determinado que son correctos y cuál es su complejidad computacional. Ambos algoritmos han sido evaluados empíricamente para comparar sus tiempos de ejecución. Para la evaluación, hemos producido una selección de hipergrafos dirigidos generados de forma aleatoria inspirados en modelos muy conocidos de grafos aleatorios como Erdos-Renyi, Newman-Watts-Strogatz and Barabasi-Albert. Varias optimizaciones para ambos algoritmos han sido implementadas y analizadas en la tesis. En concreto, colapsar los componentes fuertemente conexos del grafo dirigido que se puede construir eliminando ciertas hiperaristas complejas del hipergrafo dirigido original, mejora notablemente los tiempos de ejecucion de los algoritmos para varios de los hipergrafos utilizados en la evaluación. Aparte de los ejemplos de aplicación mencionados anteriormente, los hipergrafos dirigidos han sido también empleados en el área de representación de conocimiento. En concreto, este tipo de hipergrafos se han usado para el cálculo de módulos de ontologías. Una ontología puede ser definida como un conjunto de axiomas que especifican formalmente un conjunto de símbolos y sus relaciones, mientras que un modulo puede ser entendido como un subconjunto de axiomas de la ontología que recoge todo el conocimiento que almacena la ontología sobre un conjunto especifico de símbolos y sus relaciones. En la tesis nos hemos centrado solamente en módulos que han sido calculados usando la técnica de localidad sintáctica. Debido a que las ontologías pueden ser muy grandes, el cálculo de módulos puede facilitar las tareas de re-utilización y mantenimiento de dichas ontologías. Sin embargo, analizar todos los posibles módulos de una ontología es, en general, muy costoso porque el numero de módulos crece de forma exponencial con respecto al número de símbolos y de axiomas de la ontología. Afortunadamente, los axiomas de una ontología pueden ser divididos en particiones conocidas como átomos. Cada átomo representa un conjunto máximo de axiomas que siempre aparecen juntos en un modulo. La decomposición atómica de una ontología es definida como un grafo dirigido de tal forma que cada nodo del grafo corresponde con un átomo y cada arista define una dependencia entre una pareja de átomos. En esta tesis introducimos el concepto de“axiom dependency hypergraph” que generaliza el concepto de descomposición atómica de una ontología. Un modulo en una ontología correspondería con un componente conexo en este tipo de hipergrafos y un átomo de una ontología con un componente fuertemente conexo. Hemos adaptado la implementación de nuestros algoritmos para que funcionen también con axiom dependency hypergraphs y poder de esa forma calcular los átomos de una ontología. Para demostrar la viabilidad de esta idea, hemos incorporado nuestros algoritmos en una aplicación que hemos desarrollado para la extracción de módulos y la descomposición atómica de ontologías. A la aplicación la hemos llamado HyS y hemos estudiado sus tiempos de ejecución usando una selección de ontologías muy conocidas del área biomédica, la mayoría disponibles en el portal de Internet NCBO. Los resultados de la evaluación muestran que los tiempos de ejecución de HyS son mucho mejores que las aplicaciones más rápidas conocidas. ABSTRACT Directed hypergraphs are an intuitive modelling formalism that have been used in problems related to propositional logic, relational databases, computational linguistic and machine learning. Directed hypergraphs are also presented as an alternative to directed (bipartite) graphs to facilitate the study of the interactions between components of complex systems that cannot naturally be modelled as binary relations. In this context, they are known as hyper-networks. A directed hypergraph is a generalization of a directed graph suitable for representing many-to-many relationships. While an edge in a directed graph defines a relation between two nodes of the graph, a hyperedge in a directed hypergraph defines a relation between two sets of nodes. Strong-connectivity is an equivalence relation that induces a partition of the set of nodes of a directed hypergraph into strongly-connected components. These components can be collapsed into single nodes. As result, the size of the original hypergraph can significantly be reduced if the strongly-connected components have many nodes. This approach might contribute to better understand how the nodes of a hypergraph are connected, in particular when the hypergraphs are large. In the case of directed graphs, there are efficient algorithms that can be used to compute the strongly-connected components of large graphs. For instance, it has been shown that the macroscopic structure of the World Wide Web can be represented as a “bow-tie” diagram where more than 70% of the nodes are distributed into three large sets and one of these sets is a large strongly-connected component. This particular structure has been also observed in complex networks in other fields such as, e.g., biology. Similar studies cannot be conducted in a directed hypergraph because there does not exist any algorithm for computing the strongly-connected components of the hypergraph. In this thesis, we investigate ways to compute the strongly-connected components of directed hypergraphs. We present two new algorithms and we show their correctness and computational complexity. One of these algorithms is inspired by Tarjan’s algorithm for directed graphs. The second algorithm follows a simple approach to compute the stronglyconnected components. This approach is based on the fact that two nodes of a graph that are strongly-connected can also reach the same nodes. In other words, the connected component of each node is the same. Both algorithms are empirically evaluated to compare their performances. To this end, we have produced a selection of random directed hypergraphs inspired by existent and well-known random graphs models like Erd˝os-Renyi and Newman-Watts-Strogatz. Besides the application examples that we mentioned earlier, directed hypergraphs have also been employed in the field of knowledge representation. In particular, they have been used to compute the modules of an ontology. An ontology is defined as a collection of axioms that provides a formal specification of a set of terms and their relationships; and a module is a subset of an ontology that completely captures the meaning of certain terms as defined in the ontology. In particular, we focus on the modules computed using the notion of syntactic locality. As ontologies can be very large, the computation of modules facilitates the reuse and maintenance of these ontologies. Analysing all modules of an ontology, however, is in general not feasible as the number of modules grows exponentially in the number of terms and axioms of the ontology. Nevertheless, the modules can succinctly be represented using the Atomic Decomposition of an ontology. Using this representation, an ontology can be partitioned into atoms, which are maximal sets of axioms that co-occur in every module. The Atomic Decomposition is then defined as a directed graph such that each node correspond to an atom and each edge represents a dependency relation between two atoms. In this thesis, we introduce the notion of an axiom dependency hypergraph which is a generalization of the atomic decomposition of an ontology. A module in the ontology corresponds to a connected component in the hypergraph, and the atoms of the ontology to the strongly-connected components. We apply our algorithms for directed hypergraphs to axiom dependency hypergraphs and in this manner, we compute the atoms of an ontology. To demonstrate the viability of this approach, we have implemented the algorithms in the application HyS which computes the modules of ontologies and calculate their atomic decomposition. In the thesis, we provide an experimental evaluation of HyS with a selection of large and prominent biomedical ontologies, most of which are available in the NCBO Bioportal. HyS outperforms state-of-the-art implementations in the tasks of extracting modules and computing the atomic decomposition of these ontologies.

The lepidopteran transposon vector, piggyBac, mediates germ-line transformation in the Mediterranean fruit fly

The piggyBac (IFP2) short inverted terminal repeat transposable element from the cabbage looper Trichoplusia ni was tested for gene transfer vector function as part of a bipartite vector–helper system in the Mediterranean fruit fly Ceratitis capitata. A piggyBac vector marked with the medfly white gene was tested with a normally regulated piggyBac transposase helper at two different concentrations in a white eye host strain. Both experiments yielded transformants at an approximate frequency of 3–5%, with a total of six lines isolated having pigmented eyes with various levels of coloration. G1 transformant siblings from each line shared at least one common integration, with several sublines having an additional second integration. For the first transformant line isolated, two integrations were determined to be stable for 15 generations. For five of the lines, a piggyBac-mediated transposition was verified by sequencing the insertion site junctions isolated by inverse PCR that identified a characteristic piggyBac TTAA target site duplication. The efficient and stable transformation of the medfly with a lepidopteran vector represents transposon function over a relatively large evolutionary distance and suggests that the piggyBac system will be functional in a broad range of insects.

HIV-1 infection of nondividing cells through the recognition of integrase by the importin/karyopherin pathway

The karyophilic properties of the HIV-1 nucleoprotein complex facilitate infection of nondividing cells such as macrophages and quiescent T lymphocytes, and allow the in vivo delivery of transgenes by HIV-derived retroviral vectors into terminally differentiated cells such as neurons. Although the viral matrix (MA) and Vpr proteins have previously been shown to play important roles in this process, we demonstrate here that integrase, the enzyme responsible for mediating the integration of the viral genome in the host cell chromosome, can suffice to connect the HIV-1 preintegration complex with the cell nuclear import machinery. This novel function of integrase reflects the recognition of an atypical bipartite nuclear localization signal by the importin/karyopherin pathway.

A versatile synthetic dimerizer for the regulation of protein–protein interactions

The use of low molecular weight organic compounds to induce dimerization or oligomerization of engineered proteins has wide-ranging utility in biological research as well as in gene and cell therapies. Chemically induced dimerization can be used to activate intracellular signal transduction pathways or to control the activity of a bipartite transcription factor. Dimerizer systems based on the natural products cyclosporin, FK506, rapamycin, and coumermycin have been described. However, owing to the complexity of these compounds, adjusting their binding or pharmacological properties by chemical modification is difficult. We have investigated several families of readily prepared, totally synthetic, cell-permeable dimerizers composed of ligands for human FKBP12. These molecules have significantly reduced complexity and greater adaptability than natural product dimers. We report here the efficacies of several of these new synthetic compounds in regulating two types of protein dimerization events inside engineered cells—–induction of apoptosis through dimerization of engineered Fas proteins and regulation of transcription through dimerization of transcription factor fusion proteins. One dimerizer in particular, AP1510, proved to be exceptionally potent and versatile in all experimental contexts tested.

Nuclear localization signal binding protein from Arabidopsis mediates nuclear import of Agrobacterium VirD2 protein

T-DNA nuclear import is a central event in genetic transformation of plant cells by Agrobacterium. Presumably, the T-DNA transport intermediate is a single-stranded DNA molecule associated with two bacterial proteins, VirD2 and VirE2, which most likely mediate the transport process. While VirE2 cooperatively coats the transported single-stranded DNA, VirD2 is covalently attached to its 5′ end. To better understand the mechanism of VirD2 action, a cellular receptor for VirD2 was identified and its encoding gene cloned from Arabidopsis. The identified protein, designated AtKAPα, specifically bound VirD2 in vivo and in vitro. VirD2–AtKAPα interaction was absolutely dependent on the carboxyl-terminal bipartite nuclear localization signal sequence of VirD2. The deduced amino acid sequence of AtKAPα was homologous to yeast and animal nuclear localization signal-binding proteins belonging to the karyopherin α family. Indeed, AtKAPα efficiently rescued a yeast mutant defective for nuclear import. Furthermore, AtKAPα specifically mediated transport of VirD2 into the nuclei of permeabilized yeast cells.

Genetic definition of a protein-splicing domain: Functional mini-inteins support structure predictions and a model for intein evolution

Inteins are protein-splicing elements, most of which contain conserved sequence blocks that define a family of homing endonucleases. Like group I introns that encode such endonucleases, inteins are mobile genetic elements. Recent crystallography and computer modeling studies suggest that inteins consist of two structural domains that correspond to the endonuclease and the protein-splicing elements. To determine whether the bipartite structure of inteins is mirrored by the functional independence of the protein-splicing domain, the entire endonuclease component was deleted from the Mycobacterium tuberculosis recA intein. Guided by computer modeling studies, and taking advantage of genetic systems designed to monitor intein function, the 440-aa Mtu recA intein was reduced to a functional mini-intein of 137 aa. The accuracy of splicing of several mini-inteins was verified. This work not only substantiates structure predictions for intein function but also supports the hypothesis that, like group I introns, mobile inteins arose by an endonuclease gene invading a sequence encoding a small, functional splicing element.

The Arabidopsis cullin AtCUL1 is modified by the ubiquitin-related protein RUB1

The ubiquitin-like protein RUB1 is conjugated to target proteins by a mechanism similar to that of ubiquitin conjugation. Genetic studies in Arabidopsis thaliana have implicated the RUB-conjugation pathway in auxin response. The first step in the pathway is RUB activation by a bipartite enzyme composed of the AXR1 and ECR1 proteins. Ubiquitin activation is an ATP-dependent process that involves the formation of an AMP-ubiquitin intermediate. Here we show that RUB activation by AXR1-ECR1 also involves formation of an AMP-RUB intermediate and that this reaction is catalyzed by the ECR1 subunit alone. In addition, we identified an Arabidopsis protein called RCE1 that is a likely RUB-conjugating enzyme. RCE1 works together with AXR1-ECR1 to promote formation of a stable RUB conjugate with the Arabidopsis cullin AtCUL1 in vitro. Using a tagged version of RUB1, we show that this modification occurs in vivo. Because AtCUL1 is a component of the ubiquitin protein ligase SCFTIR1, a complex that also functions in auxin response, we propose that RUB modification of AtCUL1 is important for auxin response.

Lune/eye gone, a Pax-like protein, uses a partial paired domain and a homeodomain for DNA recognition

Pax proteins, characterized by the presence of a paired domain, play key regulatory roles during development. The paired domain is a bipartite DNA-binding domain that contains two helix–turn–helix domains joined by a linker region. Each of the subdomains, the PAI and RED domains, has been shown to be a distinct DNA-binding domain. The PAI domain is the most critical, but in specific circumstances, the RED domain is involved in DNA recognition. We describe a Pax protein, originally called Lune, that is the product of the Drosophila eye gone gene (eyg). It is unique among Pax proteins, because it contains only the RED domain. eyg seems to play a role both in the organogenesis of the salivary gland during embryogenesis and in the development of the eye. A high-affinity binding site for the Eyg RED domain was identified by using systematic evolution of ligands by exponential enrichment techniques. This binding site is related to a binding site previously identified for the RED domain of the Pax-6 5a isoform. Eyg also contains another DNA-binding domain, a Prd-class homeodomain (HD), whose palindromic binding site is similar to other Prd-class HDs. The ability of Pax proteins to use the PAI, RED, and HD, or combinations thereof, may be one mechanism that allows them to be used at different stages of development to regulate various developmental processes through the activation of specific target genes.

Box H and Box ACA Are Nucleolar Localization Elements of U17 Small Nucleolar RNA

The nucleolar localization elements (NoLEs) of U17 small nucleolar RNA (snoRNA), which is essential for rRNA processing and belongs to the box H/ACA snoRNA family, were analyzed by fluorescence microscopy. Injection of mutant U17 transcripts into Xenopus laevis oocyte nuclei revealed that deletion of stems 1, 2, and 4 of U17 snoRNA reduced but did not prevent nucleolar localization. The deletion of stem 3 had no adverse effect. Therefore, the hairpins of the hairpin–hinge–hairpin–tail structure formed by these stems are not absolutely critical for nucleolar localization of U17, nor are sequences within stems 1, 3, and 4, which may tether U17 to the rRNA precursor by base pairing. In contrast, box H and box ACA are major NoLEs; their combined substitution or deletion abolished nucleolar localization of U17 snoRNA. Mutation of just box H or just the box ACA region alone did not fully abolish the nucleolar localization of U17. This indicates that the NoLEs of the box H/ACA snoRNA family function differently from the bipartite NoLEs (conserved boxes C and D) of box C/D snoRNAs, where mutation of either box alone prevents nucleolar localization.

Developmental signal transduction pathways uncovered by genetic suppressors

We have found conditions for saturation mutagenesis by restriction enzyme mediated integration that result in plasmid tagging of disrupted genes. Using this method we selected for mutations in genes that act at checkpoints downstream of the intercellular signaling system that controls encapsulation in Dictyostelium discoideum. One of these genes, mkcA, is a member of the mitogen-activating protein kinase cascade family while the other, regA, is a novel bipartite gene homologous to response regulators in one part and to cyclic nucleotide phosphodiesterases in the other part. Disruption of either of these genes results in partial suppression of the block to spore formation resulting from the loss of the prestalk genes, tagB and tagC. The products of the tag genes have conserved domains of serine proteases attached to ATP-driven transporters, suggesting that they process and export peptide signals. Together, these genes outline an intercellular communication system that coordinates organismal shape with cellular differentiation during development.

A trans-acting RNA as a control switch in Escherichia coli: DsrA modulates function by forming alternative structures

DsrA is an 87-nucleotide regulatory RNA of Escherichia coli that acts in trans by RNA–RNA interactions with two different mRNAs, hns and rpoS. DsrA has opposite effects on these transcriptional regulators. H-NS levels decrease, whereas RpoS (σs) levels increase. Here we show that DsrA enhances hns mRNA turnover yet stabilizes rpoS mRNA, either directly or via effects on translation. Computational and RNA footprinting approaches led to a refined structure for DsrA, and a model in which DsrA interacts with the hns mRNA start and stop codon regions to form a coaxial stack. Analogous bipartite interactions exist in eukaryotes, albeit with different regulatory consequences. In contrast, DsrA base pairs in discrete fashion with the rpoS RNA translational operator. Thus, different structural configurations for DsrA lead to opposite regulatory consequences for target RNAs.

Structure of FokI has implications for DNA cleavage

FokI is a member an unusual class of restriction enzymes that recognize a specific DNA sequence and cleave nonspecifically a short distance away from that sequence. FokI consists of an N-terminal DNA recognition domain and a C-terminal cleavage domain. The bipartite nature of FokI has led to the development of artificial enzymes with novel specificities. We have solved the structure of FokI to 2.3 Å resolution. The structure reveals a dimer, in which the dimerization interface is mediated by the cleavage domain. Each monomer has an overall conformation similar to that found in the FokI–DNA complex, with the cleavage domain packing alongside the DNA recognition domain. In corroboration with the cleavage data presented in the accompanying paper in this issue of Proceedings, we propose a model for FokI DNA cleavage that requires the dimerization of FokI on DNA to cleave both DNA strands.

Opposing mitogenic and anti-mitogenic actions of parathyroid hormone-related protein in vascular smooth muscle cells: A critical role for nuclear targeting

Parathyroid hormone-related protein (PTHrP) is a prohormone that is posttranslationally processed to a family of mature secretory forms, each of which has its own cognate receptor(s) on the cell surface that mediate the actions of PTHrP. In addition to being secreted via the classical secretory pathway and interacting with cell surface receptors in a paracrine/autocrine fashion, PTHrP appears to be able to enter the nucleus directly following translation and influence cellular events in an “intracrine” fashion. In this report, we demonstrate that PTHrP can be targeted to the nucleus in vascular smooth muscle cells, that this nuclear targeting is associated with a striking increase in mitogenesis, that this nuclear effect on proliferation is the diametric opposite of the effects of PTHrP resulting from interaction with cell surface receptors on vascular smooth muscle cells, and that the regions of the PTHrP sequence responsible for this nuclear targeting represent a classical bipartite nuclear localization signal. This report describes the activation of the cell cycle in association with nuclear localization of PTHrP in any cell type. These findings have important implications for the normal physiology of PTHrP in the many tissues which produce it, and suggest that gene delivery of PTHrP or modified variants may be useful in the management of atherosclerotic vascular disease.