Tripartite patella: late appearance of a third ossification center in childhood

Bilateral radiographic progression of the supero-lateral fragment of a bipartite- into a tripartite patella with unilateral symptoms. An 8 year old girl presented a bilateral bipartite patella Stage III as an incidental finding after fall on the flexed right knee. Serial radiographs two years later revealed a bilateral progression of the bipartite- into a tripartite patella with complaints only on the post-traumatic right side. Observation was opted as therapy. There was no correlation of symptoms and radiological findings of the fragmentation of the bipartite- into a tripartite patella. Therefore we conclude the etiology of a bilateral late appearance of a third ossification center.

QUANTUM CORRELATIONS OF LIGHTS IN MACROSCOPIC ENVIRONMENTS

This dissertation presents a detailed study in exploring quantum correlations of lights in macroscopic environments. We have explored quantum correlations of single photons, weak coherent states, and polarization-correlated/polarization-entangled photons in macroscopic environments. These included macroscopic mirrors, macroscopic photon number, spatially separated observers, noisy photons source and propagation medium with loss or disturbances. We proposed a measurement scheme for observing quantum correlations and entanglement in the spatial properties of two macroscopic mirrors using single photons spatial compass state. We explored the phase space distribution features of spatial compass states, such as chessboard pattern by using the Wigner function. The displacement and tilt correlations of the two mirrors were manifested through the propensities of the compass states. This technique can be used to extract Einstein-Podolsky-Rosen correlations (EPR) of the two mirrors. We then formulated the discrete-like property of the propensity Pb(m,n), which can be used to explore environmental perturbed quantum jumps of the EPR correlations in phase space. With single photons spatial compass state, the variances in position and momentum are much smaller than standard quantum limit when using a Gaussian TEM00 beam. We observed intrinsic quantum correlations of weak coherent states between two parties through balanced homodyne detection. Our scheme can be used as a supplement to decoy-state BB84 protocol and differential phase-shift QKD protocol. We prepared four types of bipartite correlations ±cos2(θ12) that shared between two parties. We also demonstrated bits correlations between two parties separated by 10 km optical fiber. The bits information will be protected by the large quantum phase fluctuation of weak coherent states, adding another physical layer of security to these protocols for quantum key distribution. Using 10 m of highly nonlinear fiber (HNLF) at 77 K, we observed coincidence to accidental-coincidence ratio of 130±5 for correlated photon-pair and Two-Photon Interference visibility >98% entangled photon-pair. We also verified the non-local behavior of polarization-entangled photon pair by violating Clauser-Horne-Shimony-Holt Bell’s inequality by more than 12 standard deviations. With the HNLF at 300 K (77 K), photon-pair production rate about factor 3(2) higher than a 300 m dispersion-shifted fiber is observed. Then, we studied quantum correlation and interference of photon-pairs; with one photon of the photon-air experiencing multiple scattering in a random medium. We observed that depolarization noise photon in multiple scattering degrading the purity of photon-pair, and the existence of Raman noise photon in a photon-pair source will contribute to the depolarization affect. We found that quantum correlation of polarization-entangled photon-pair is better preserved than polarization-correlated photon-pair as one photon of the photon-pair scattered through a random medium. Our findings showed that high purity polarization-entangled photon-pair is better candidate for long distance quantum key distribution.

Single-stranded DNA-binding proteins regulate the abundance of LIM domain and LIM domain-binding proteins.

The LIM domain-binding protein Ldb1 is an essential cofactor of LIM-homeodomain (LIM-HD) and LIM-only (LMO) proteins in development. The stoichiometry of Ldb1, LIM-HD, and LMO proteins is tightly controlled in the cell and is likely a critical determinant of their biological actions. Single-stranded DNA-binding proteins (SSBPs) were recently shown to interact with Ldb1 and are also important in developmental programs. We establish here that two mammalian SSBPs, SSBP2 and SSBP3, contribute to an erythroid DNA-binding complex that contains the transcription factors Tal1 and GATA-1, the LIM domain protein Lmo2, and Ldb1 and binds a bipartite E-box-GATA DNA sequence motif. In addition, SSBP2 was found to augment transcription of the Protein 4.2 (P4.2) gene, a direct target of the E-box-GATA-binding complex, in an Ldb1-dependent manner and to increase endogenous Ldb1 and Lmo2 protein levels, E-box-GATA DNA-binding activity, and P4.2 and beta-globin expression in erythroid progenitors. Finally, SSBP2 was demonstrated to inhibit Ldb1 and Lmo2 interaction with the E3 ubiquitin ligase RLIM, prevent RLIM-mediated Ldb1 ubiquitination, and protect Ldb1 and Lmo2 from proteasomal degradation. These results define a novel biochemical function for SSBPs in regulating the abundance of LIM domain and LIM domain-binding proteins.

A cellular cleavage pathway for the Moloney murine leukemia virus precursor protein, Pr65$\rm\sp{gag}$: Identification of a new viral protein containing CAp30 and NCp10 sequences

The origin and structure of P55$\sp{\rm gag},$ a gag encoded polyprotein lacking the nucleocapsid protein, NCp10, have been explored. Evidence shows that P55$\sp{\rm gag}$ is formed by non-viral proteolytic cleavage of the Moloney murine leukemia virus (MoMuLV)gag precursor protein, Pr65$\sp{\rm gag}.$ P55$\sp{\rm gag}$ is produced in cells infected by a viral protease deletion mutant and by a recombinant murine sarcoma virus known to lack the protease gene, implying that a cellular protease is responsible for the cleavage. Structural and immunological studies show that the protein cleavage site is upstream of the CAp30-NCp10 viral proteolytic junction, implying that P55$\sp{\rm gag}$ lacks the carboxy-terminal residues of CAp30. During the course of studying P55$\sp{\rm gag},$ another protein was discovered, which I named nucleocapsid-related protein(NCRP). NCRP possesses the portion of CAp30 that is lacking in P55$\sp{\rm gag}.$ NCRP possesses antigenic epitopes present in CAp30 and NCp10. NCRP was observed in virus lysates and in nuclear lysates of MoMuLV infected cells; it was not detected in the cytoplasmic fractions of MoMuLV infected cells. Our results indicated that NCRP originates from Pr65$\sp{\rm gag},$ resulting from the same cellular proteolytic cleavage event that produces the viral cellular protein P55$\sp{\rm gag}.$ P55$\sp{\rm gag}$- and NCRP-like proteins also were observed in AKV murine leukemia virus (AKV MuLV) and feline leukemia virus (FeLV) infected cells and in their respective virus particles. The site of cleavage that yields P55$\sp{\rm gag}$ and NCRP is within the carboxy terminus of CAp30, likely within a motif highly conserved among mammalian type C retroviruses. This new motif, called the capsid conserved motif (CCM), overlaps a region containing both a possible bipartite nuclear targeting sequence and a region homologous with the U1 small nuclear ribonucleoprotein 70-kD protein. This domain, when intact, may act as a nuclear targeting sequence for the gag precursor proteins Pr65$\sp{\rm gag}$ and CAp30. Nuclei of cells infected with MoMuLV were examined for the presence of gag proteins. Both Pr65$\sp{\rm gag}$ and CAp30 were detected in the nuclear fraction of MoMuLV, AKV MuLV and FeLV infected cells. P55$\sp{\rm gag}$ was never detected in the nucleus of MoMuLV, AKV MuLV and FeLV infected cells or in their respective virus particles. I propose that NCRP may be involved in sequestering viral genomic RNA for the purposes of encapsidation and intracellular viral genomic RNA dimerization. ^

Shaping frequency entangled qudits

We demonstrate the creation, characterization, and manipulation of frequency-entangled qudits by shaping the energy spectrum of entangled photons. The generation of maximally entangled qudit states is verified up to dimension d=4 through tomographic quantum-state reconstruction. Subsequently, we measure Bell parameters for qubits and qutrits as a function of their degree of entanglement. In agreement with theoretical predictions, we observe that for qutrits the Bell parameter is less sensitive to a varying degree of entanglement than for qubits. For frequency-entangled photons, the dimensionality of a qudit is ultimately limited by the bandwidth of the pump laser and can be on the order of a few millions.

Two-dimensional Lattice Gauge Theories with Superconducting Quantum Circuits

A quantum simulator of U(1) lattice gauge theories can be implemented with superconducting circuits. This allows the investigation of confined and deconfined phases in quantum link models, and of valence bond solid and spin liquid phases in quantum dimer models. Fractionalized confining strings and the real-time dynamics of quantum phase transitions are accessible as well. Here we show how state-of-the-art superconducting technology allows us to simulate these phenomena in relatively small circuit lattices. By exploiting the strong non-linear couplings between quantized excitations emerging when superconducting qubits are coupled, we show how to engineer gauge invariant Hamiltonians, including ring-exchange and four-body Ising interactions. We demonstrate that, despite decoherence and disorder effects, minimal circuit instances allow us to investigate properties such as the dynamics of electric flux strings, signaling confinement in gauge invariant field theories. The experimental realization of these models in larger superconducting circuits could address open questions beyond current computational capability.

Monte Carlo modeling of polarized light propagation: Stokes vs Jones - Part I

This bipartite comparative study aims at inspecting the similarities and differences between the Jones and Stokes–Mueller formalisms when modeling polarized light propagation with numerical simulations of the Monte Carlo type. In this first part, we review the theoretical concepts that concern light propagation and detection with both pure and partially/totally unpolarized states. The latter case involving fluctuations, or “depolarizing effects,” is of special interest here: Jones and Stokes–Mueller are equally apt to model such effects and are expected to yield identical results. In a second, ensuing paper, empirical evidence is provided by means of numerical experiments, using both formalisms.

Pollen and macroremains from four profiles from site Samerberg 1

Pollen and macrofossil analysis of lake sediments revealed the complete development of vegetation from Riss late-glacial to early Würm glacial times at Samerberg (12°12' E, 47°45' N, 600 m a.s.l) on the northern border of the Alps. The pollen bearing sediments overlie three stratigraphic units, at the base a ground-moraine, then a 13 m thick layer of pollen free silt and clay, and then a younger moraine; all the sediments including the pollen bearing sediments, lie below the Würm moraine. The lake, which had developed in an older glacial basin, became extinct, when the ice of the river Inn glacier filled its basin during Würm full-glacial time at the latest. One interglacial, three interstadials, and the interdigitating treeless periods were identified at Samerberg. Whereas the cold periods cannot be distinguished from one another pollenanalytically, the interglacial and the two older interstadials have distinctive characteristics. A shrub phase with Juniperus initiated reforestation and was followed by a pine phase during the interglacial and each of the three interstadials. The further development of the interglacial vegetation proceeded with a phase when deciduous trees (mainly Quercus, oak) and hazel (Corylus) dominated, though spruce (Picea) was present at the same time in the area. A phase with abundant yew (Taxus) led to an apparently long lasting period with dominant spruce and fir (Abies) accompanied by some hornbeam (Carpinus). The vegetational development shows the main characteristics of the Riss/Würm interglacial, though certain differences in the vegetational development in the northern alpine foreland are obvious. These differences may result from the existence of an altitudinal zonation of the vegetation in the vicinity of the site and are the expression of its position at the border of the Alps. A greater age (e.g. the Holsteinian) can be excluded by reason of the vegetational development, and is also not indicated at first sight from the geological and stratigraphical data of the site. Characteristic of the Riss/Würm vegetational development in southern Germany - at least in the region between Lake Starnberg/Samerberg/Salzach - is the conspicuous yew phase. According to absolute pollen counts, yew not only displaced the deciduous species, but also displaced spruce preferentially, thus indicating climatic conditions less favourable for spruce, caused by mild winters (Ilex spreading!) and by short-term low precipitation, indicated by the reduced sedimentation rate. The oldest interstadials is bipartite, as due to the climatic deterioration the early vegetational development, culminating in a spruce phase, had been interrupted by another expansion of pine. A younger spruce-dominated period with fir and perhaps also with hornbeam and beech (Fagus) followed. An identical climatic development has been reported from other European sites with long pollen sequences (see chapter 6.7). However, different tree species are found in the same time intervals in Middle Europe during Early Würm times. Sediments of the last interglacial (Eem or Riss/Würm) have been found in all cases below the sediments of the bipartite interstadial, and in addition one more interstadial occurs in the overlying sediments. This proves that Eem and Riss/Würm of the north-european plain resp. of the alpine foreland are contemporaneous interglacials although this has been questioned by some authors. The climax vegetation of the second interstadial was a spruce forest without fir and without more demanding deciduous tree species. The vegetational development of the third interstadial is recorded fragmentary only. But it has been established that a spruce forest was present. The oldest interstadial must correspond to the danish Brørup interstadial as it is expressed in northern Germany, the second one to the Odderade interstadial. A third Early Würm interstadial, preserved fragmentarily at Samerberg, is known from other sites. The dutch Amersfoort interstadial most likely is the equivalent to the older part of the bipartite danish Brørup interstadial.

Modeling the evolution of item rating networks using time-domain preferential attachment

The understanding of the structure and dynamics of the intricate network of connections among people that consumes products through Internet appears as an extremely useful asset in order to study emergent properties related to social behavior. This knowledge could be useful, for example, to improve the performance of personal recommendation algorithms. In this contribution, we analyzed five-year records of movie-rating transactions provided by Netflix, a movie rental platform where users rate movies from an online catalog. This dataset can be studied as a bipartite user-item network whose structure evolves in time. Even though several topological properties from subsets of this bipartite network have been reported with a model that combines random and preferential attachment mechanisms [Beguerisse Díaz et al., 2010], there are still many aspects worth to be explored, as they are connected to relevant phenomena underlying the evolution of the network. In this work, we test the hypothesis that bursty human behavior is essential in order to describe how a bipartite user-item network evolves in time. To that end, we propose a novel model that combines, for user nodes, a network growth prescription based on a preferential attachment mechanism acting not only in the topological domain (i.e. based on node degrees) but also in time domain. In the case of items, the model mixes degree preferential attachment and random selection. With these ingredients, the model is not only able to reproduce the asymptotic degree distribution, but also shows an excellent agreement with the Netflix data in several time-dependent topological properties.

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.